/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:23:53,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:23:53,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:23:53,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:23:53,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:23:53,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:23:53,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:23:53,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:23:53,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:23:53,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:23:53,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:23:53,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:23:53,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:23:53,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:23:53,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:23:53,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:23:53,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:23:53,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:23:53,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:23:53,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:23:53,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:23:53,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:23:53,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:23:53,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:23:53,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:23:53,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:23:53,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:23:53,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:23:53,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:23:53,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:23:53,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:23:53,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:23:53,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:23:53,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:23:53,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:23:53,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:23:53,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:23:53,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:23:53,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:23:53,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:23:53,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:23:53,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:23:53,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:23:53,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:23:53,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:23:53,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:23:53,104 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:23:53,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:23:53,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:23:53,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:23:53,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:23:53,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:23:53,106 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:23:53,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:23:53,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:23:53,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:23:53,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:23:53,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:23:53,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:53,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:23:53,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:23:53,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:23:53,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:23:53,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:23:53,111 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:23:53,111 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:23:53,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:23:53,112 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:23:53,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:23:53,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:23:53,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:23:53,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:23:53,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:23:53,395 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:23:53,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 22:23:53,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c523406/ee971479a44746b581d16a545e6bb7b4/FLAGc611c6816 [2019-12-27 22:23:54,042 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:23:54,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 22:23:54,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c523406/ee971479a44746b581d16a545e6bb7b4/FLAGc611c6816 [2019-12-27 22:23:54,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29c523406/ee971479a44746b581d16a545e6bb7b4 [2019-12-27 22:23:54,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:23:54,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:23:54,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:54,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:23:54,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:23:54,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:54" (1/1) ... [2019-12-27 22:23:54,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24328a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:54, skipping insertion in model container [2019-12-27 22:23:54,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:54" (1/1) ... [2019-12-27 22:23:54,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:23:54,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:23:54,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:54,886 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:23:54,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:55,031 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:23:55,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55 WrapperNode [2019-12-27 22:23:55,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:55,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:55,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:23:55,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:23:55,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:55,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:23:55,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:23:55,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:23:55,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... [2019-12-27 22:23:55,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:23:55,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:23:55,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:23:55,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:23:55,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:23:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:23:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:23:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:23:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:23:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:23:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:23:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:23:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:23:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:23:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:23:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:23:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:23:55,233 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:23:56,021 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:23:56,021 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:23:56,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:56 BoogieIcfgContainer [2019-12-27 22:23:56,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:23:56,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:23:56,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:23:56,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:23:56,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:23:54" (1/3) ... [2019-12-27 22:23:56,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc21868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:56, skipping insertion in model container [2019-12-27 22:23:56,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:55" (2/3) ... [2019-12-27 22:23:56,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc21868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:56, skipping insertion in model container [2019-12-27 22:23:56,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:56" (3/3) ... [2019-12-27 22:23:56,031 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2019-12-27 22:23:56,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:23:56,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:23:56,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:23:56,055 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:23:56,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,124 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,153 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:56,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:23:56,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:23:56,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:23:56,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:23:56,196 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:23:56,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:23:56,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:23:56,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:23:56,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:23:56,214 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 22:23:56,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:23:56,319 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:23:56,319 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:56,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:23:56,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 22:23:56,417 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 22:23:56,417 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:56,428 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:23:56,454 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:23:56,455 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:23:59,445 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-27 22:23:59,794 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:23:59,920 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:23:59,949 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81758 [2019-12-27 22:23:59,950 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:23:59,953 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 22:24:18,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117812 states. [2019-12-27 22:24:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states. [2019-12-27 22:24:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:24:18,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:18,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:24:18,290 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash 839664, now seen corresponding path program 1 times [2019-12-27 22:24:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:18,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843732267] [2019-12-27 22:24:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:18,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843732267] [2019-12-27 22:24:18,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:18,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:24:18,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1380647263] [2019-12-27 22:24:18,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:18,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:18,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:24:18,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:18,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:18,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:24:18,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:24:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:18,609 INFO L87 Difference]: Start difference. First operand 117812 states. Second operand 3 states. [2019-12-27 22:24:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:22,374 INFO L93 Difference]: Finished difference Result 117510 states and 507540 transitions. [2019-12-27 22:24:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:24:22,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:24:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:23,114 INFO L225 Difference]: With dead ends: 117510 [2019-12-27 22:24:23,115 INFO L226 Difference]: Without dead ends: 115144 [2019-12-27 22:24:23,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:24:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115144 states. [2019-12-27 22:24:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115144 to 115144. [2019-12-27 22:24:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115144 states. [2019-12-27 22:24:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115144 states to 115144 states and 497894 transitions. [2019-12-27 22:24:33,743 INFO L78 Accepts]: Start accepts. Automaton has 115144 states and 497894 transitions. Word has length 3 [2019-12-27 22:24:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:33,743 INFO L462 AbstractCegarLoop]: Abstraction has 115144 states and 497894 transitions. [2019-12-27 22:24:33,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:24:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115144 states and 497894 transitions. [2019-12-27 22:24:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:24:33,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:33,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:33,748 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -79799111, now seen corresponding path program 1 times [2019-12-27 22:24:33,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:33,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632951246] [2019-12-27 22:24:33,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:33,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632951246] [2019-12-27 22:24:33,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:33,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:33,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304803611] [2019-12-27 22:24:33,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:33,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:33,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:24:33,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:33,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:33,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:24:33,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:33,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:24:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:24:33,889 INFO L87 Difference]: Start difference. First operand 115144 states and 497894 transitions. Second operand 4 states. [2019-12-27 22:24:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:39,606 INFO L93 Difference]: Finished difference Result 185114 states and 767412 transitions. [2019-12-27 22:24:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:39,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:24:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:40,525 INFO L225 Difference]: With dead ends: 185114 [2019-12-27 22:24:40,525 INFO L226 Difference]: Without dead ends: 185065 [2019-12-27 22:24:40,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:24:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185065 states. [2019-12-27 22:24:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185065 to 169989. [2019-12-27 22:24:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169989 states. [2019-12-27 22:24:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 713980 transitions. [2019-12-27 22:24:50,079 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 713980 transitions. Word has length 11 [2019-12-27 22:24:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:24:50,081 INFO L462 AbstractCegarLoop]: Abstraction has 169989 states and 713980 transitions. [2019-12-27 22:24:50,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:24:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 713980 transitions. [2019-12-27 22:24:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:24:50,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:24:50,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:24:50,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:24:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:24:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash -676042940, now seen corresponding path program 1 times [2019-12-27 22:24:50,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:24:50,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218665211] [2019-12-27 22:24:50,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:24:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:24:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:24:50,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218665211] [2019-12-27 22:24:50,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:24:50,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:24:50,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749862232] [2019-12-27 22:24:50,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:24:50,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:24:50,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:24:50,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:24:50,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:24:50,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:24:50,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:24:50,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:24:50,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:24:50,159 INFO L87 Difference]: Start difference. First operand 169989 states and 713980 transitions. Second operand 4 states. [2019-12-27 22:24:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:24:57,282 INFO L93 Difference]: Finished difference Result 241878 states and 992054 transitions. [2019-12-27 22:24:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:24:57,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:24:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:24:58,717 INFO L225 Difference]: With dead ends: 241878 [2019-12-27 22:24:58,718 INFO L226 Difference]: Without dead ends: 241815 [2019-12-27 22:24:58,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-12-27 22:25:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 205075. [2019-12-27 22:25:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205075 states. [2019-12-27 22:25:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205075 states to 205075 states and 855408 transitions. [2019-12-27 22:25:14,344 INFO L78 Accepts]: Start accepts. Automaton has 205075 states and 855408 transitions. Word has length 13 [2019-12-27 22:25:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:14,345 INFO L462 AbstractCegarLoop]: Abstraction has 205075 states and 855408 transitions. [2019-12-27 22:25:14,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 205075 states and 855408 transitions. [2019-12-27 22:25:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:25:14,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:14,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:14,348 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1689712693, now seen corresponding path program 1 times [2019-12-27 22:25:14,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:14,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98757790] [2019-12-27 22:25:14,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:14,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98757790] [2019-12-27 22:25:14,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:14,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:14,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739294697] [2019-12-27 22:25:14,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:14,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:14,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:25:14,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:14,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:14,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:14,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:14,419 INFO L87 Difference]: Start difference. First operand 205075 states and 855408 transitions. Second operand 3 states. [2019-12-27 22:25:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:14,570 INFO L93 Difference]: Finished difference Result 40406 states and 132180 transitions. [2019-12-27 22:25:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:14,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:25:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:14,632 INFO L225 Difference]: With dead ends: 40406 [2019-12-27 22:25:14,632 INFO L226 Difference]: Without dead ends: 40406 [2019-12-27 22:25:14,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40406 states. [2019-12-27 22:25:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40406 to 40406. [2019-12-27 22:25:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40406 states. [2019-12-27 22:25:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40406 states to 40406 states and 132180 transitions. [2019-12-27 22:25:16,840 INFO L78 Accepts]: Start accepts. Automaton has 40406 states and 132180 transitions. Word has length 13 [2019-12-27 22:25:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:16,841 INFO L462 AbstractCegarLoop]: Abstraction has 40406 states and 132180 transitions. [2019-12-27 22:25:16,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 40406 states and 132180 transitions. [2019-12-27 22:25:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:25:16,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:16,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:16,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1531561803, now seen corresponding path program 1 times [2019-12-27 22:25:16,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:16,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22448546] [2019-12-27 22:25:16,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22448546] [2019-12-27 22:25:16,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:16,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:16,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897717603] [2019-12-27 22:25:16,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:16,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:16,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 29 transitions. [2019-12-27 22:25:16,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:16,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:16,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:16,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:16,941 INFO L87 Difference]: Start difference. First operand 40406 states and 132180 transitions. Second operand 5 states. [2019-12-27 22:25:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:17,785 INFO L93 Difference]: Finished difference Result 54550 states and 174566 transitions. [2019-12-27 22:25:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:25:17,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:25:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:17,880 INFO L225 Difference]: With dead ends: 54550 [2019-12-27 22:25:17,880 INFO L226 Difference]: Without dead ends: 54537 [2019-12-27 22:25:17,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:25:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2019-12-27 22:25:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 40777. [2019-12-27 22:25:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40777 states. [2019-12-27 22:25:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 133064 transitions. [2019-12-27 22:25:21,699 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 133064 transitions. Word has length 19 [2019-12-27 22:25:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:21,700 INFO L462 AbstractCegarLoop]: Abstraction has 40777 states and 133064 transitions. [2019-12-27 22:25:21,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 133064 transitions. [2019-12-27 22:25:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:25:21,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:21,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:21,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1034032563, now seen corresponding path program 1 times [2019-12-27 22:25:21,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:21,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831732695] [2019-12-27 22:25:21,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:21,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831732695] [2019-12-27 22:25:21,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:21,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:21,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203377622] [2019-12-27 22:25:21,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:21,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:21,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:25:21,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:21,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:21,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:25:21,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:25:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:21,791 INFO L87 Difference]: Start difference. First operand 40777 states and 133064 transitions. Second operand 4 states. [2019-12-27 22:25:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:21,837 INFO L93 Difference]: Finished difference Result 7638 states and 20735 transitions. [2019-12-27 22:25:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:25:21,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:25:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:21,849 INFO L225 Difference]: With dead ends: 7638 [2019-12-27 22:25:21,850 INFO L226 Difference]: Without dead ends: 7638 [2019-12-27 22:25:21,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-27 22:25:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7498. [2019-12-27 22:25:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-27 22:25:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 20363 transitions. [2019-12-27 22:25:21,958 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 20363 transitions. Word has length 25 [2019-12-27 22:25:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:21,958 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 20363 transitions. [2019-12-27 22:25:21,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 20363 transitions. [2019-12-27 22:25:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:25:21,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:21,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:21,968 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2065802623, now seen corresponding path program 1 times [2019-12-27 22:25:21,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:21,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896762295] [2019-12-27 22:25:21,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:22,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896762295] [2019-12-27 22:25:22,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:22,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:25:22,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135704230] [2019-12-27 22:25:22,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:22,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:22,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 107 transitions. [2019-12-27 22:25:22,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:22,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:25:22,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:22,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:22,112 INFO L87 Difference]: Start difference. First operand 7498 states and 20363 transitions. Second operand 5 states. [2019-12-27 22:25:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:22,147 INFO L93 Difference]: Finished difference Result 5405 states and 15353 transitions. [2019-12-27 22:25:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:25:22,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:25:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:22,155 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 22:25:22,155 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 22:25:22,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 22:25:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 22:25:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 22:25:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13441 transitions. [2019-12-27 22:25:22,219 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13441 transitions. Word has length 37 [2019-12-27 22:25:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:22,220 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13441 transitions. [2019-12-27 22:25:22,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13441 transitions. [2019-12-27 22:25:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:22,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:22,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:22,227 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1806952947, now seen corresponding path program 1 times [2019-12-27 22:25:22,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:22,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436736401] [2019-12-27 22:25:22,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:22,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436736401] [2019-12-27 22:25:22,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:22,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:22,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667543972] [2019-12-27 22:25:22,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:22,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:22,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 22:25:22,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:22,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:22,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:22,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:22,479 INFO L87 Difference]: Start difference. First operand 4661 states and 13441 transitions. Second operand 3 states. [2019-12-27 22:25:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:22,546 INFO L93 Difference]: Finished difference Result 4670 states and 13455 transitions. [2019-12-27 22:25:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:22,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:22,554 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:25:22,554 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:25:22,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:25:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:25:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:25:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13451 transitions. [2019-12-27 22:25:22,613 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13451 transitions. Word has length 65 [2019-12-27 22:25:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:22,614 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13451 transitions. [2019-12-27 22:25:22,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13451 transitions. [2019-12-27 22:25:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:22,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:22,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:22,621 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash -736030129, now seen corresponding path program 1 times [2019-12-27 22:25:22,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:22,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33666681] [2019-12-27 22:25:22,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:22,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33666681] [2019-12-27 22:25:22,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:22,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:22,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1143674637] [2019-12-27 22:25:22,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:22,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:23,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 22:25:23,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:23,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:23,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:23,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:23,081 INFO L87 Difference]: Start difference. First operand 4666 states and 13451 transitions. Second operand 3 states. [2019-12-27 22:25:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:23,136 INFO L93 Difference]: Finished difference Result 4670 states and 13445 transitions. [2019-12-27 22:25:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:23,143 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 22:25:23,143 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 22:25:23,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 22:25:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 22:25:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 22:25:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13441 transitions. [2019-12-27 22:25:23,201 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13441 transitions. Word has length 65 [2019-12-27 22:25:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:23,202 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13441 transitions. [2019-12-27 22:25:23,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13441 transitions. [2019-12-27 22:25:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:23,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:23,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:23,209 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash -743654703, now seen corresponding path program 1 times [2019-12-27 22:25:23,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:23,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519842372] [2019-12-27 22:25:23,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:23,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519842372] [2019-12-27 22:25:23,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:23,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:23,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066830734] [2019-12-27 22:25:23,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:23,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:23,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 22:25:23,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:23,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:25:23,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:25:23,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:25:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:25:23,698 INFO L87 Difference]: Start difference. First operand 4666 states and 13441 transitions. Second operand 10 states. [2019-12-27 22:25:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:24,254 INFO L93 Difference]: Finished difference Result 7090 states and 20230 transitions. [2019-12-27 22:25:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:25:24,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:25:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:24,264 INFO L225 Difference]: With dead ends: 7090 [2019-12-27 22:25:24,264 INFO L226 Difference]: Without dead ends: 7090 [2019-12-27 22:25:24,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:25:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-27 22:25:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5981. [2019-12-27 22:25:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5981 states. [2019-12-27 22:25:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 17235 transitions. [2019-12-27 22:25:24,350 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 17235 transitions. Word has length 65 [2019-12-27 22:25:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:24,350 INFO L462 AbstractCegarLoop]: Abstraction has 5981 states and 17235 transitions. [2019-12-27 22:25:24,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:25:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 17235 transitions. [2019-12-27 22:25:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:24,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:24,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:24,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 326503145, now seen corresponding path program 2 times [2019-12-27 22:25:24,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:24,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109890344] [2019-12-27 22:25:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:24,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109890344] [2019-12-27 22:25:24,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:24,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:24,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1695955733] [2019-12-27 22:25:24,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:24,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:24,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 448 transitions. [2019-12-27 22:25:24,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:24,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:25:24,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:24,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:24,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:24,871 INFO L87 Difference]: Start difference. First operand 5981 states and 17235 transitions. Second operand 5 states. [2019-12-27 22:25:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:25,484 INFO L93 Difference]: Finished difference Result 9069 states and 25840 transitions. [2019-12-27 22:25:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:25:25,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:25:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:25,496 INFO L225 Difference]: With dead ends: 9069 [2019-12-27 22:25:25,496 INFO L226 Difference]: Without dead ends: 9069 [2019-12-27 22:25:25,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:25:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-12-27 22:25:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 6733. [2019-12-27 22:25:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-12-27 22:25:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 19502 transitions. [2019-12-27 22:25:25,599 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 19502 transitions. Word has length 65 [2019-12-27 22:25:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:25,600 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 19502 transitions. [2019-12-27 22:25:25,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 19502 transitions. [2019-12-27 22:25:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:25,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:25,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:25,609 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash 737396099, now seen corresponding path program 3 times [2019-12-27 22:25:25,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:25,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272766622] [2019-12-27 22:25:25,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:25,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272766622] [2019-12-27 22:25:25,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:25,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:25:25,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303280893] [2019-12-27 22:25:25,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:25,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:25,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 364 transitions. [2019-12-27 22:25:25,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:25,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:25:25,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:25:25,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:25:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:25:25,998 INFO L87 Difference]: Start difference. First operand 6733 states and 19502 transitions. Second operand 11 states. [2019-12-27 22:25:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:27,807 INFO L93 Difference]: Finished difference Result 16492 states and 46675 transitions. [2019-12-27 22:25:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:25:27,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:25:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:27,827 INFO L225 Difference]: With dead ends: 16492 [2019-12-27 22:25:27,827 INFO L226 Difference]: Without dead ends: 16492 [2019-12-27 22:25:27,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:25:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16492 states. [2019-12-27 22:25:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16492 to 7282. [2019-12-27 22:25:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7282 states. [2019-12-27 22:25:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 21181 transitions. [2019-12-27 22:25:27,998 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 21181 transitions. Word has length 65 [2019-12-27 22:25:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:27,998 INFO L462 AbstractCegarLoop]: Abstraction has 7282 states and 21181 transitions. [2019-12-27 22:25:27,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:25:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 21181 transitions. [2019-12-27 22:25:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:25:28,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:28,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:28,008 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 156309423, now seen corresponding path program 4 times [2019-12-27 22:25:28,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:28,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855680334] [2019-12-27 22:25:28,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:28,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855680334] [2019-12-27 22:25:28,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:28,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:28,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051163553] [2019-12-27 22:25:28,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:28,133 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:28,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 438 transitions. [2019-12-27 22:25:28,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:28,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:28,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:28,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:28,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:28,399 INFO L87 Difference]: Start difference. First operand 7282 states and 21181 transitions. Second operand 3 states. [2019-12-27 22:25:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:28,475 INFO L93 Difference]: Finished difference Result 7282 states and 21180 transitions. [2019-12-27 22:25:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:28,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:25:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:28,486 INFO L225 Difference]: With dead ends: 7282 [2019-12-27 22:25:28,487 INFO L226 Difference]: Without dead ends: 7282 [2019-12-27 22:25:28,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2019-12-27 22:25:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 4657. [2019-12-27 22:25:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-27 22:25:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 13801 transitions. [2019-12-27 22:25:28,576 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 13801 transitions. Word has length 65 [2019-12-27 22:25:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:28,576 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 13801 transitions. [2019-12-27 22:25:28,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 13801 transitions. [2019-12-27 22:25:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:25:28,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:28,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:28,583 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 939416227, now seen corresponding path program 1 times [2019-12-27 22:25:28,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:28,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226117984] [2019-12-27 22:25:28,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:28,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226117984] [2019-12-27 22:25:28,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:28,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:28,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168812120] [2019-12-27 22:25:28,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:28,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:28,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 449 transitions. [2019-12-27 22:25:28,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:28,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:25:28,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:25:28,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:25:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:28,854 INFO L87 Difference]: Start difference. First operand 4657 states and 13801 transitions. Second operand 5 states. [2019-12-27 22:25:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:29,016 INFO L93 Difference]: Finished difference Result 5653 states and 16123 transitions. [2019-12-27 22:25:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:25:29,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:25:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:29,024 INFO L225 Difference]: With dead ends: 5653 [2019-12-27 22:25:29,024 INFO L226 Difference]: Without dead ends: 5653 [2019-12-27 22:25:29,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:25:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-12-27 22:25:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 3561. [2019-12-27 22:25:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 22:25:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 22:25:29,082 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 66 [2019-12-27 22:25:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:29,082 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 22:25:29,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:25:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 22:25:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:25:29,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:29,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:29,087 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash -9053315, now seen corresponding path program 1 times [2019-12-27 22:25:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:29,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709126491] [2019-12-27 22:25:29,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:29,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709126491] [2019-12-27 22:25:29,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:29,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:25:29,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162651663] [2019-12-27 22:25:29,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:29,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:29,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 416 transitions. [2019-12-27 22:25:29,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:29,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:25:29,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:25:29,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:25:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:25:29,499 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 11 states. [2019-12-27 22:25:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:30,653 INFO L93 Difference]: Finished difference Result 6091 states and 17309 transitions. [2019-12-27 22:25:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:25:30,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 22:25:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:30,662 INFO L225 Difference]: With dead ends: 6091 [2019-12-27 22:25:30,663 INFO L226 Difference]: Without dead ends: 6091 [2019-12-27 22:25:30,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:25:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2019-12-27 22:25:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3561. [2019-12-27 22:25:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 22:25:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 22:25:30,757 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 67 [2019-12-27 22:25:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:30,757 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 22:25:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:25:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 22:25:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:25:30,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:30,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:30,762 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash -631043911, now seen corresponding path program 2 times [2019-12-27 22:25:30,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:30,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919377901] [2019-12-27 22:25:30,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:30,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919377901] [2019-12-27 22:25:30,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:30,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:30,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033081274] [2019-12-27 22:25:30,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:30,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:31,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 455 transitions. [2019-12-27 22:25:31,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:31,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:25:31,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:31,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:31,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:31,050 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 3 states. [2019-12-27 22:25:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:31,078 INFO L93 Difference]: Finished difference Result 3385 states and 9561 transitions. [2019-12-27 22:25:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:31,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:25:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:31,085 INFO L225 Difference]: With dead ends: 3385 [2019-12-27 22:25:31,085 INFO L226 Difference]: Without dead ends: 3385 [2019-12-27 22:25:31,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-12-27 22:25:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2989. [2019-12-27 22:25:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 22:25:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8455 transitions. [2019-12-27 22:25:31,171 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8455 transitions. Word has length 67 [2019-12-27 22:25:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:31,171 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8455 transitions. [2019-12-27 22:25:31,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8455 transitions. [2019-12-27 22:25:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:31,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:31,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:31,178 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1113013633, now seen corresponding path program 1 times [2019-12-27 22:25:31,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:31,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102507394] [2019-12-27 22:25:31,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:31,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102507394] [2019-12-27 22:25:31,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:31,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:25:31,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16276336] [2019-12-27 22:25:31,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:31,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:31,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 435 transitions. [2019-12-27 22:25:31,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:31,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:25:31,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:25:31,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:25:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:25:31,614 INFO L87 Difference]: Start difference. First operand 2989 states and 8455 transitions. Second operand 7 states. [2019-12-27 22:25:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:31,717 INFO L93 Difference]: Finished difference Result 6102 states and 17360 transitions. [2019-12-27 22:25:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:25:31,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 22:25:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:31,725 INFO L225 Difference]: With dead ends: 6102 [2019-12-27 22:25:31,726 INFO L226 Difference]: Without dead ends: 3697 [2019-12-27 22:25:31,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:25:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-12-27 22:25:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 2817. [2019-12-27 22:25:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 22:25:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7940 transitions. [2019-12-27 22:25:31,793 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7940 transitions. Word has length 68 [2019-12-27 22:25:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:31,794 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7940 transitions. [2019-12-27 22:25:31,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:25:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7940 transitions. [2019-12-27 22:25:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:31,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:31,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:31,799 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash -539233385, now seen corresponding path program 2 times [2019-12-27 22:25:31,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:31,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525463629] [2019-12-27 22:25:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:32,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525463629] [2019-12-27 22:25:32,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:32,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:25:32,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [989874030] [2019-12-27 22:25:32,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:32,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:32,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 22:25:32,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:32,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:25:32,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:25:32,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:25:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:25:32,777 INFO L87 Difference]: Start difference. First operand 2817 states and 7940 transitions. Second operand 17 states. [2019-12-27 22:25:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:34,246 INFO L93 Difference]: Finished difference Result 6720 states and 18875 transitions. [2019-12-27 22:25:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:25:34,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 22:25:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:34,256 INFO L225 Difference]: With dead ends: 6720 [2019-12-27 22:25:34,256 INFO L226 Difference]: Without dead ends: 6688 [2019-12-27 22:25:34,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 22:25:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2019-12-27 22:25:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 4328. [2019-12-27 22:25:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4328 states. [2019-12-27 22:25:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 12167 transitions. [2019-12-27 22:25:34,330 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 12167 transitions. Word has length 68 [2019-12-27 22:25:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:34,331 INFO L462 AbstractCegarLoop]: Abstraction has 4328 states and 12167 transitions. [2019-12-27 22:25:34,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:25:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 12167 transitions. [2019-12-27 22:25:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:34,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:34,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:34,335 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:34,335 INFO L82 PathProgramCache]: Analyzing trace with hash -233642199, now seen corresponding path program 3 times [2019-12-27 22:25:34,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:34,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951732805] [2019-12-27 22:25:34,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:34,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951732805] [2019-12-27 22:25:34,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:34,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:25:34,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057512008] [2019-12-27 22:25:34,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:34,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:34,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 531 transitions. [2019-12-27 22:25:34,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:25:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:35,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:35,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:25:35,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:25:35,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:25:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:25:35,437 INFO L87 Difference]: Start difference. First operand 4328 states and 12167 transitions. Second operand 22 states. [2019-12-27 22:25:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:37,856 INFO L93 Difference]: Finished difference Result 9834 states and 27235 transitions. [2019-12-27 22:25:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 22:25:37,856 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-27 22:25:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:37,869 INFO L225 Difference]: With dead ends: 9834 [2019-12-27 22:25:37,869 INFO L226 Difference]: Without dead ends: 9802 [2019-12-27 22:25:37,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 22:25:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2019-12-27 22:25:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 4763. [2019-12-27 22:25:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4763 states. [2019-12-27 22:25:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 13411 transitions. [2019-12-27 22:25:37,964 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 13411 transitions. Word has length 68 [2019-12-27 22:25:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:37,965 INFO L462 AbstractCegarLoop]: Abstraction has 4763 states and 13411 transitions. [2019-12-27 22:25:37,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:25:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 13411 transitions. [2019-12-27 22:25:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:37,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:37,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:37,970 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1643062481, now seen corresponding path program 4 times [2019-12-27 22:25:37,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:37,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686852587] [2019-12-27 22:25:37,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686852587] [2019-12-27 22:25:38,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:38,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:25:38,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009824928] [2019-12-27 22:25:38,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:38,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:38,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 497 transitions. [2019-12-27 22:25:38,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:25:38,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:25:38,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:25:38,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:25:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:25:38,874 INFO L87 Difference]: Start difference. First operand 4763 states and 13411 transitions. Second operand 20 states. [2019-12-27 22:25:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:40,693 INFO L93 Difference]: Finished difference Result 9947 states and 28045 transitions. [2019-12-27 22:25:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 22:25:40,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:25:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:40,707 INFO L225 Difference]: With dead ends: 9947 [2019-12-27 22:25:40,708 INFO L226 Difference]: Without dead ends: 9915 [2019-12-27 22:25:40,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 22:25:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2019-12-27 22:25:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 4539. [2019-12-27 22:25:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2019-12-27 22:25:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 12729 transitions. [2019-12-27 22:25:40,856 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 12729 transitions. Word has length 68 [2019-12-27 22:25:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:40,856 INFO L462 AbstractCegarLoop]: Abstraction has 4539 states and 12729 transitions. [2019-12-27 22:25:40,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:25:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 12729 transitions. [2019-12-27 22:25:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:25:40,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:40,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:40,863 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:40,864 INFO L82 PathProgramCache]: Analyzing trace with hash -691349817, now seen corresponding path program 5 times [2019-12-27 22:25:40,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:40,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529696254] [2019-12-27 22:25:40,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:25:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:25:41,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:25:41,079 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:25:41,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= v_~z$w_buff0_used~0_115 0) (= 0 v_~z$r_buff1_thd0~0_47) (= v_~main$tmp_guard0~0_10 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2040~0.base_21| 4)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z~0_28 0) (= v_~z$r_buff0_thd3~0_20 0) (= 0 v_~z$w_buff0~0_27) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21| 1)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_19|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21|)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t2040~0.base_21|) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21|) |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t2040~0.base=|v_ULTIMATE.start_main_~#t2040~0.base_21|, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_20|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t2040~0.offset=|v_ULTIMATE.start_main_~#t2040~0.offset_17|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2041~0.offset, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2041~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2040~0.base, ~x~0, ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2040~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:25:41,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2041~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12|) |v_ULTIMATE.start_main_~#t2041~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2041~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2041~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2041~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2041~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:25:41,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_17) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_93 v_~z$w_buff1_used~0_60) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_92 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:25:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2042~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2042~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2042~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9|) |v_ULTIMATE.start_main_~#t2042~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t2042~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_8|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:25:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In221129332 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In221129332 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In221129332 |P0Thread1of1ForFork0_#t~ite5_Out221129332|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out221129332|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In221129332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In221129332} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out221129332|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In221129332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In221129332} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:25:41,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In60030470 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In60030470 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In60030470 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In60030470 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out60030470| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out60030470| ~z$w_buff1_used~0_In60030470)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In60030470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In60030470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60030470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In60030470} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out60030470|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60030470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In60030470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60030470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In60030470} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:25:41,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2058757210 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2058757210 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-2058757210 ~z$r_buff0_thd1~0_Out-2058757210)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out-2058757210 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2058757210, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2058757210} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2058757210, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2058757210|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2058757210} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:25:41,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-773072549 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-773072549 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-773072549 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-773072549 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-773072549| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-773072549| ~z$r_buff1_thd1~0_In-773072549) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-773072549, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-773072549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-773072549, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-773072549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-773072549, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-773072549|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-773072549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-773072549, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-773072549} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:25:41,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:25:41,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In637682435 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In637682435 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out637682435| |P1Thread1of1ForFork1_#t~ite10_Out637682435|))) (or (and (= ~z$w_buff1~0_In637682435 |P1Thread1of1ForFork1_#t~ite9_Out637682435|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~z~0_In637682435 |P1Thread1of1ForFork1_#t~ite9_Out637682435|) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In637682435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In637682435, ~z$w_buff1~0=~z$w_buff1~0_In637682435, ~z~0=~z~0_In637682435} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out637682435|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In637682435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In637682435, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out637682435|, ~z$w_buff1~0=~z$w_buff1~0_In637682435, ~z~0=~z~0_In637682435} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 22:25:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In325187578 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In325187578 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out325187578| ~z$w_buff1~0_In325187578) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out325187578| ~z~0_In325187578) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In325187578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In325187578, ~z$w_buff1~0=~z$w_buff1~0_In325187578, ~z~0=~z~0_In325187578} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out325187578|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In325187578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In325187578, ~z$w_buff1~0=~z$w_buff1~0_In325187578, ~z~0=~z~0_In325187578} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:25:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_17, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:25:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-902947962 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-902947962 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-902947962| ~z$w_buff0_used~0_In-902947962)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-902947962|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-902947962, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-902947962} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-902947962, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-902947962, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-902947962|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:25:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1907026860 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1907026860 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1907026860 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1907026860 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1907026860| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1907026860 |P2Thread1of1ForFork2_#t~ite18_Out-1907026860|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1907026860, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1907026860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1907026860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1907026860} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1907026860, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1907026860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1907026860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1907026860, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1907026860|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:25:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In117826347 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In117826347 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out117826347|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In117826347 |P2Thread1of1ForFork2_#t~ite19_Out117826347|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117826347, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117826347} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In117826347, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117826347, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out117826347|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:25:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1383126179 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1383126179 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1383126179 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1383126179 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1383126179|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1383126179 |P2Thread1of1ForFork2_#t~ite20_Out1383126179|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1383126179, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1383126179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1383126179, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1383126179} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1383126179, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1383126179|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1383126179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1383126179, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1383126179} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:25:41,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_13) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:25:41,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2005516380 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2005516380 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out2005516380|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2005516380| ~z$w_buff0_used~0_In2005516380)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2005516380, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2005516380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2005516380, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2005516380|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2005516380} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:25:41,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In2037011269 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2037011269 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2037011269 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In2037011269 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out2037011269|)) (and (= ~z$w_buff1_used~0_In2037011269 |P1Thread1of1ForFork1_#t~ite12_Out2037011269|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2037011269, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2037011269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2037011269, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2037011269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2037011269, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2037011269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2037011269, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2037011269|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2037011269} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:25:41,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-220723237 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-220723237 256)))) (or (and (= ~z$r_buff0_thd2~0_In-220723237 |P1Thread1of1ForFork1_#t~ite13_Out-220723237|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-220723237|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-220723237, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-220723237} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-220723237, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-220723237|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-220723237} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:25:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-295393676 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-295393676 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-295393676 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-295393676 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-295393676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-295393676 |P1Thread1of1ForFork1_#t~ite14_Out-295393676|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-295393676, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-295393676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-295393676, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-295393676} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-295393676, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-295393676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-295393676, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-295393676|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-295393676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:25:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:25:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:25:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In75369478 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In75369478 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out75369478| |ULTIMATE.start_main_#t~ite24_Out75369478|))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out75369478| ~z$w_buff1~0_In75369478) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out75369478| ~z~0_In75369478) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In75369478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In75369478, ~z$w_buff1~0=~z$w_buff1~0_In75369478, ~z~0=~z~0_In75369478} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In75369478, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out75369478|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In75369478, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out75369478|, ~z$w_buff1~0=~z$w_buff1~0_In75369478, ~z~0=~z~0_In75369478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:25:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In838323104 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In838323104 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out838323104|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out838323104| ~z$w_buff0_used~0_In838323104)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In838323104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838323104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In838323104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838323104, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out838323104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:25:41,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1271504458 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1271504458 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1271504458 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1271504458 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1271504458 |ULTIMATE.start_main_#t~ite27_Out1271504458|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out1271504458| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1271504458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1271504458, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1271504458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1271504458} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1271504458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1271504458, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1271504458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1271504458, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1271504458|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:25:41,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-600264878 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-600264878 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-600264878| ~z$r_buff0_thd0~0_In-600264878)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-600264878|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-600264878, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-600264878} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-600264878, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-600264878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-600264878} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:25:41,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2044040963 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2044040963 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2044040963 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2044040963 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-2044040963| ~z$r_buff1_thd0~0_In-2044040963) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-2044040963| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2044040963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044040963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2044040963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2044040963} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2044040963, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2044040963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044040963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2044040963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2044040963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:25:41,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_55 v_~z$r_buff0_thd0~0_54)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_54, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:25:41,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L834-->L837-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:25:41,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:25:41,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:25:41 BasicIcfg [2019-12-27 22:25:41,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:25:41,207 INFO L168 Benchmark]: Toolchain (without parser) took 106877.66 ms. Allocated memory was 137.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 747.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,207 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.19 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.96 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,209 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,210 INFO L168 Benchmark]: RCFGBuilder took 870.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,210 INFO L168 Benchmark]: TraceAbstraction took 105180.87 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 681.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:25:41,213 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 701.19 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.96 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105180.87 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 681.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5870 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81758 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3122 SDtfs, 4659 SDslu, 10497 SDs, 0 SdLazy, 7326 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 84 SyntacticMatches, 49 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205075occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 100041 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 256640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...