/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:51:59,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:51:59,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:51:59,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:51:59,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:51:59,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:51:59,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:51:59,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:51:59,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:51:59,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:51:59,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:51:59,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:51:59,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:51:59,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:51:59,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:51:59,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:51:59,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:51:59,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:51:59,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:51:59,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:51:59,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:51:59,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:51:59,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:51:59,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:51:59,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:51:59,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:51:59,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:51:59,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:51:59,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:51:59,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:51:59,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:51:59,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:51:59,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:51:59,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:51:59,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:51:59,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:51:59,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:51:59,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:51:59,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:51:59,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:51:59,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:51:59,165 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.epf [2019-12-18 21:51:59,180 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:51:59,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:51:59,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:51:59,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:51:59,182 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:51:59,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:51:59,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:51:59,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:51:59,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:51:59,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:51:59,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:51:59,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:51:59,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:51:59,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:51:59,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:51:59,187 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:51:59,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:51:59,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:51:59,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:51:59,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:51:59,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:51:59,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:51:59,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:51:59,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:51:59,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:51:59,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:51:59,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:51:59,189 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:51:59,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:51:59,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:51:59,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:51:59,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:51:59,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:51:59,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:51:59,490 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:51:59,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 21:51:59,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a716fc0/8ea5bd1e2f2d4f5a9ddffafbdf7d7879/FLAG1f131f118 [2019-12-18 21:52:00,113 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:52:00,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 21:52:00,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a716fc0/8ea5bd1e2f2d4f5a9ddffafbdf7d7879/FLAG1f131f118 [2019-12-18 21:52:00,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a716fc0/8ea5bd1e2f2d4f5a9ddffafbdf7d7879 [2019-12-18 21:52:00,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:52:00,409 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:52:00,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:00,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:52:00,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:52:00,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:00" (1/1) ... [2019-12-18 21:52:00,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c513ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:00, skipping insertion in model container [2019-12-18 21:52:00,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:00" (1/1) ... [2019-12-18 21:52:00,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:52:00,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:52:01,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:01,056 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:52:01,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:01,257 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:52:01,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01 WrapperNode [2019-12-18 21:52:01,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:01,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:01,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:52:01,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:52:01,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:01,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:52:01,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:52:01,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:52:01,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (1/1) ... [2019-12-18 21:52:01,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:52:01,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:52:01,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:52:01,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:52:01,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (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-18 21:52:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:52:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:52:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:52:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:52:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:52:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:52:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:52:01,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:52:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:52:01,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:52:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:52:01,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:52:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:52:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:52:01,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:52:01,499 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:52:02,305 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:52:02,305 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:52:02,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:02 BoogieIcfgContainer [2019-12-18 21:52:02,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:52:02,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:52:02,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:52:02,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:52:02,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:52:00" (1/3) ... [2019-12-18 21:52:02,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a45ac02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:02, skipping insertion in model container [2019-12-18 21:52:02,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:01" (2/3) ... [2019-12-18 21:52:02,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a45ac02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:02, skipping insertion in model container [2019-12-18 21:52:02,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:02" (3/3) ... [2019-12-18 21:52:02,317 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2019-12-18 21:52:02,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:52:02,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:52:02,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:52:02,340 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:52:02,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,410 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,411 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,411 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,411 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,412 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,430 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,430 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,433 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,434 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,435 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:02,450 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:52:02,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:52:02,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:52:02,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:52:02,470 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:52:02,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:52:02,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:52:02,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:52:02,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:52:02,488 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 21:52:02,490 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:52:02,594 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:52:02,595 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:02,615 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:52:02,636 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:52:02,714 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:52:02,714 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:02,721 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:52:02,735 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:52:02,737 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:52:06,373 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:52:06,516 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:52:06,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-18 21:52:06,549 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:52:06,552 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-18 21:52:08,797 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:52:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:52:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:52:08,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:08,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:08,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-18 21:52:08,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:08,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107247599] [2019-12-18 21:52:08,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:09,141 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-18 21:52:09,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107247599] [2019-12-18 21:52:09,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:09,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:52:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697253563] [2019-12-18 21:52:09,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:09,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:09,173 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:52:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:09,788 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-18 21:52:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:09,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:52:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:11,271 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 21:52:11,271 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 21:52:11,278 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-18 21:52:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 21:52:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 21:52:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 21:52:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-18 21:52:14,589 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-18 21:52:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:14,590 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-18 21:52:14,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-18 21:52:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:52:14,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:14,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:14,597 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-18 21:52:14,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:14,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361253279] [2019-12-18 21:52:14,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:14,731 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-18 21:52:14,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361253279] [2019-12-18 21:52:14,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:14,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:14,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236813188] [2019-12-18 21:52:14,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:14,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:14,736 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-18 21:52:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:15,422 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-18 21:52:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:15,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:52:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:15,709 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 21:52:15,710 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 21:52:15,711 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-18 21:52:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 21:52:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-18 21:52:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-18 21:52:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-18 21:52:17,877 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-18 21:52:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:17,878 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-18 21:52:17,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-18 21:52:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:52:17,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:17,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:17,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-18 21:52:17,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:17,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037044699] [2019-12-18 21:52:17,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:17,956 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-18 21:52:17,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037044699] [2019-12-18 21:52:17,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:17,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:17,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849109385] [2019-12-18 21:52:17,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:17,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:17,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:17,959 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-18 21:52:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:18,836 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-18 21:52:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:18,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:52:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:19,253 INFO L225 Difference]: With dead ends: 57862 [2019-12-18 21:52:19,253 INFO L226 Difference]: Without dead ends: 57862 [2019-12-18 21:52:19,254 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-18 21:52:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-18 21:52:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-18 21:52:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-18 21:52:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-18 21:52:23,267 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-18 21:52:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:23,267 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-18 21:52:23,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-18 21:52:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:52:23,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:23,282 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] [2019-12-18 21:52:23,283 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-18 21:52:23,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:23,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831434102] [2019-12-18 21:52:23,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:23,382 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-18 21:52:23,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831434102] [2019-12-18 21:52:23,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:23,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:23,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910450168] [2019-12-18 21:52:23,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:23,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:23,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:23,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:23,385 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 4 states. [2019-12-18 21:52:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:23,621 INFO L93 Difference]: Finished difference Result 41440 states and 157219 transitions. [2019-12-18 21:52:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:52:23,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 21:52:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:23,728 INFO L225 Difference]: With dead ends: 41440 [2019-12-18 21:52:23,729 INFO L226 Difference]: Without dead ends: 40332 [2019-12-18 21:52:23,729 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-18 21:52:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40332 states. [2019-12-18 21:52:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40332 to 40332. [2019-12-18 21:52:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-18 21:52:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-18 21:52:26,673 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-18 21:52:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:26,673 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-18 21:52:26,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-18 21:52:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:52:26,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:26,686 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] [2019-12-18 21:52:26,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-18 21:52:26,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:26,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802493712] [2019-12-18 21:52:26,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:26,760 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-18 21:52:26,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802493712] [2019-12-18 21:52:26,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:26,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:26,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069579245] [2019-12-18 21:52:26,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:26,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:26,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:26,763 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 5 states. [2019-12-18 21:52:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:27,799 INFO L93 Difference]: Finished difference Result 53868 states and 201666 transitions. [2019-12-18 21:52:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:52:27,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:52:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:27,947 INFO L225 Difference]: With dead ends: 53868 [2019-12-18 21:52:27,947 INFO L226 Difference]: Without dead ends: 53847 [2019-12-18 21:52:27,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:52:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53847 states. [2019-12-18 21:52:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53847 to 40578. [2019-12-18 21:52:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-12-18 21:52:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 154375 transitions. [2019-12-18 21:52:31,214 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 154375 transitions. Word has length 22 [2019-12-18 21:52:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:31,214 INFO L462 AbstractCegarLoop]: Abstraction has 40578 states and 154375 transitions. [2019-12-18 21:52:31,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 154375 transitions. [2019-12-18 21:52:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:52:31,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:31,255 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] [2019-12-18 21:52:31,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-18 21:52:31,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:31,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185288187] [2019-12-18 21:52:31,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:31,304 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-18 21:52:31,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185288187] [2019-12-18 21:52:31,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:31,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:31,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54731289] [2019-12-18 21:52:31,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:31,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:31,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:31,307 INFO L87 Difference]: Start difference. First operand 40578 states and 154375 transitions. Second operand 3 states. [2019-12-18 21:52:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:31,557 INFO L93 Difference]: Finished difference Result 51158 states and 192741 transitions. [2019-12-18 21:52:31,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:31,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 21:52:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:31,673 INFO L225 Difference]: With dead ends: 51158 [2019-12-18 21:52:31,673 INFO L226 Difference]: Without dead ends: 51158 [2019-12-18 21:52:31,673 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-18 21:52:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-12-18 21:52:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 44232. [2019-12-18 21:52:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-18 21:52:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-18 21:52:32,831 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 30 [2019-12-18 21:52:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:32,832 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-18 21:52:32,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-18 21:52:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:52:32,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:32,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] [2019-12-18 21:52:32,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-18 21:52:32,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:32,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394236106] [2019-12-18 21:52:32,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:32,953 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-18 21:52:32,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394236106] [2019-12-18 21:52:32,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:32,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:52:32,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870236185] [2019-12-18 21:52:32,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:32,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:32,956 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-18 21:52:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:33,075 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-18 21:52:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:33,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 21:52:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:33,102 INFO L225 Difference]: With dead ends: 19345 [2019-12-18 21:52:33,102 INFO L226 Difference]: Without dead ends: 18469 [2019-12-18 21:52:33,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:52:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-18 21:52:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-18 21:52:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-18 21:52:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-18 21:52:33,373 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-18 21:52:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:33,373 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-18 21:52:33,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-18 21:52:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 21:52:33,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:33,383 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] [2019-12-18 21:52:33,384 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-18 21:52:33,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:33,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539055118] [2019-12-18 21:52:33,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:33,479 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-18 21:52:33,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539055118] [2019-12-18 21:52:33,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:33,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:52:33,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822006545] [2019-12-18 21:52:33,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:52:33,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:52:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:33,482 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-18 21:52:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:33,563 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-18 21:52:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:52:33,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 21:52:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:33,568 INFO L225 Difference]: With dead ends: 3432 [2019-12-18 21:52:33,569 INFO L226 Difference]: Without dead ends: 3063 [2019-12-18 21:52:33,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:52:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-18 21:52:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-18 21:52:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-18 21:52:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-18 21:52:33,606 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-18 21:52:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:33,606 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-18 21:52:33,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:52:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-18 21:52:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:52:33,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:33,611 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] [2019-12-18 21:52:33,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-18 21:52:33,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:33,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846455449] [2019-12-18 21:52:33,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:33,722 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-18 21:52:33,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846455449] [2019-12-18 21:52:33,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:33,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:52:33,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754523702] [2019-12-18 21:52:33,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:52:33,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:52:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:52:33,724 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-18 21:52:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:33,954 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-18 21:52:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:52:33,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 21:52:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:33,958 INFO L225 Difference]: With dead ends: 1341 [2019-12-18 21:52:33,958 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 21:52:33,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:52:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 21:52:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-18 21:52:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-18 21:52:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-18 21:52:33,982 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-18 21:52:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:33,982 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-18 21:52:33,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:52:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-18 21:52:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:52:33,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:33,987 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] [2019-12-18 21:52:33,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-18 21:52:33,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:33,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523329815] [2019-12-18 21:52:33,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:34,117 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-18 21:52:34,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523329815] [2019-12-18 21:52:34,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:34,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:34,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172179273] [2019-12-18 21:52:34,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:34,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:34,119 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 3 states. [2019-12-18 21:52:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:34,161 INFO L93 Difference]: Finished difference Result 1179 states and 3330 transitions. [2019-12-18 21:52:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:34,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:52:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:34,164 INFO L225 Difference]: With dead ends: 1179 [2019-12-18 21:52:34,164 INFO L226 Difference]: Without dead ends: 1179 [2019-12-18 21:52:34,165 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-18 21:52:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2019-12-18 21:52:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2019-12-18 21:52:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2019-12-18 21:52:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 3330 transitions. [2019-12-18 21:52:34,185 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 3330 transitions. Word has length 58 [2019-12-18 21:52:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:34,186 INFO L462 AbstractCegarLoop]: Abstraction has 1179 states and 3330 transitions. [2019-12-18 21:52:34,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 3330 transitions. [2019-12-18 21:52:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:52:34,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:34,189 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] [2019-12-18 21:52:34,189 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 435926507, now seen corresponding path program 1 times [2019-12-18 21:52:34,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:34,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920624196] [2019-12-18 21:52:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:34,372 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-18 21:52:34,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920624196] [2019-12-18 21:52:34,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:34,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:52:34,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218873286] [2019-12-18 21:52:34,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:52:34,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:52:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:52:34,375 INFO L87 Difference]: Start difference. First operand 1179 states and 3330 transitions. Second operand 7 states. [2019-12-18 21:52:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:34,500 INFO L93 Difference]: Finished difference Result 2288 states and 6033 transitions. [2019-12-18 21:52:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:52:34,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:52:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:34,503 INFO L225 Difference]: With dead ends: 2288 [2019-12-18 21:52:34,503 INFO L226 Difference]: Without dead ends: 1561 [2019-12-18 21:52:34,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:52:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-12-18 21:52:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1051. [2019-12-18 21:52:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-12-18 21:52:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 2897 transitions. [2019-12-18 21:52:34,517 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 2897 transitions. Word has length 59 [2019-12-18 21:52:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:34,517 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 2897 transitions. [2019-12-18 21:52:34,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:52:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 2897 transitions. [2019-12-18 21:52:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:52:34,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:34,519 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] [2019-12-18 21:52:34,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1912027671, now seen corresponding path program 2 times [2019-12-18 21:52:34,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:34,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395020881] [2019-12-18 21:52:34,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:34,594 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-18 21:52:34,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395020881] [2019-12-18 21:52:34,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:34,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:34,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379702781] [2019-12-18 21:52:34,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:34,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:34,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:34,596 INFO L87 Difference]: Start difference. First operand 1051 states and 2897 transitions. Second operand 3 states. [2019-12-18 21:52:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:34,616 INFO L93 Difference]: Finished difference Result 1005 states and 2714 transitions. [2019-12-18 21:52:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:34,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:52:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:34,619 INFO L225 Difference]: With dead ends: 1005 [2019-12-18 21:52:34,619 INFO L226 Difference]: Without dead ends: 1005 [2019-12-18 21:52:34,620 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-18 21:52:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-12-18 21:52:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2019-12-18 21:52:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-18 21:52:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2714 transitions. [2019-12-18 21:52:34,637 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2714 transitions. Word has length 59 [2019-12-18 21:52:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:34,637 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2714 transitions. [2019-12-18 21:52:34,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2714 transitions. [2019-12-18 21:52:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:52:34,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:34,640 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] [2019-12-18 21:52:34,640 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 1 times [2019-12-18 21:52:34,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:34,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334511659] [2019-12-18 21:52:34,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:34,909 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-18 21:52:34,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334511659] [2019-12-18 21:52:34,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:34,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:52:34,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218864765] [2019-12-18 21:52:34,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:52:34,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:52:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:52:34,911 INFO L87 Difference]: Start difference. First operand 1005 states and 2714 transitions. Second operand 9 states. [2019-12-18 21:52:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:35,222 INFO L93 Difference]: Finished difference Result 1946 states and 4901 transitions. [2019-12-18 21:52:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:52:35,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-12-18 21:52:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:35,224 INFO L225 Difference]: With dead ends: 1946 [2019-12-18 21:52:35,224 INFO L226 Difference]: Without dead ends: 796 [2019-12-18 21:52:35,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:52:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-18 21:52:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 565. [2019-12-18 21:52:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-12-18 21:52:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1231 transitions. [2019-12-18 21:52:35,233 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1231 transitions. Word has length 60 [2019-12-18 21:52:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:35,233 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 1231 transitions. [2019-12-18 21:52:35,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:52:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1231 transitions. [2019-12-18 21:52:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:52:35,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:35,235 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] [2019-12-18 21:52:35,235 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 2 times [2019-12-18 21:52:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:35,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337983015] [2019-12-18 21:52:35,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:35,368 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-18 21:52:35,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337983015] [2019-12-18 21:52:35,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:35,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:52:35,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908100885] [2019-12-18 21:52:35,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:52:35,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:35,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:52:35,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:35,371 INFO L87 Difference]: Start difference. First operand 565 states and 1231 transitions. Second operand 6 states. [2019-12-18 21:52:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:35,436 INFO L93 Difference]: Finished difference Result 811 states and 1706 transitions. [2019-12-18 21:52:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:52:35,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:52:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:35,437 INFO L225 Difference]: With dead ends: 811 [2019-12-18 21:52:35,437 INFO L226 Difference]: Without dead ends: 246 [2019-12-18 21:52:35,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:52:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-18 21:52:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 222. [2019-12-18 21:52:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 21:52:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 386 transitions. [2019-12-18 21:52:35,443 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 386 transitions. Word has length 60 [2019-12-18 21:52:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:35,443 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 386 transitions. [2019-12-18 21:52:35,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:52:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 386 transitions. [2019-12-18 21:52:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:52:35,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:35,444 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] [2019-12-18 21:52:35,444 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 3 times [2019-12-18 21:52:35,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:35,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354481517] [2019-12-18 21:52:35,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:35,723 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-18 21:52:35,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354481517] [2019-12-18 21:52:35,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:35,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:52:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488713841] [2019-12-18 21:52:35,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:52:35,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:52:35,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:52:35,725 INFO L87 Difference]: Start difference. First operand 222 states and 386 transitions. Second operand 15 states. [2019-12-18 21:52:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:36,238 INFO L93 Difference]: Finished difference Result 380 states and 644 transitions. [2019-12-18 21:52:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:52:36,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:52:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:36,239 INFO L225 Difference]: With dead ends: 380 [2019-12-18 21:52:36,239 INFO L226 Difference]: Without dead ends: 348 [2019-12-18 21:52:36,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:52:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-18 21:52:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2019-12-18 21:52:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-18 21:52:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 571 transitions. [2019-12-18 21:52:36,245 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 571 transitions. Word has length 60 [2019-12-18 21:52:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:36,245 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 571 transitions. [2019-12-18 21:52:36,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:52:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 571 transitions. [2019-12-18 21:52:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:52:36,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:36,246 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] [2019-12-18 21:52:36,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 4 times [2019-12-18 21:52:36,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:36,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156310512] [2019-12-18 21:52:36,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:52:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:52:36,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:52:36,369 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:52:36,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22| 1)) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1485~0.base_22|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22|)) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22|) |v_ULTIMATE.start_main_~#t1485~0.offset_17| 0)) |v_#memory_int_27|) (= 0 |v_ULTIMATE.start_main_~#t1485~0.offset_17|) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1485~0.base_22| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1485~0.base=|v_ULTIMATE.start_main_~#t1485~0.base_22|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1485~0.offset=|v_ULTIMATE.start_main_~#t1485~0.offset_17|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_20|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_16|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[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~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1485~0.base, ULTIMATE.start_main_~#t1488~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1486~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1485~0.offset, 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~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1487~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t1487~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1486~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1488~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:52:36,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1486~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1486~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13|) |v_ULTIMATE.start_main_~#t1486~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1486~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1486~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1486~0.offset] because there is no mapped edge [2019-12-18 21:52:36,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1487~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1487~0.base_10| 4)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10| 1) |v_#valid_40|) (not (= |v_ULTIMATE.start_main_~#t1487~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1487~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10|) |v_ULTIMATE.start_main_~#t1487~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1487~0.offset, #length, ULTIMATE.start_main_~#t1487~0.base] because there is no mapped edge [2019-12-18 21:52:36,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1488~0.base_11| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1488~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1488~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1488~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11|) |v_ULTIMATE.start_main_~#t1488~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1488~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:52:36,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~a~0_In873534900 ~__unbuffered_p3_EAX~0_Out873534900) (= ~z$r_buff1_thd0~0_Out873534900 ~z$r_buff0_thd0~0_In873534900) (= ~z$r_buff1_thd3~0_Out873534900 ~z$r_buff0_thd3~0_In873534900) (= ~z$r_buff0_thd1~0_In873534900 ~z$r_buff1_thd1~0_Out873534900) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In873534900 0)) (= ~z$r_buff0_thd4~0_Out873534900 1) (= ~z$r_buff1_thd4~0_Out873534900 ~z$r_buff0_thd4~0_In873534900) (= ~z$r_buff1_thd2~0_Out873534900 ~z$r_buff0_thd2~0_In873534900)) InVars {~a~0=~a~0_In873534900, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In873534900, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In873534900, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In873534900, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In873534900, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In873534900, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873534900} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In873534900, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out873534900, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out873534900, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out873534900, ~a~0=~a~0_In873534900, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In873534900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out873534900, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out873534900, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out873534900, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out873534900, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In873534900, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In873534900, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873534900} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:52:36,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:52:36,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:52:36,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1404013632 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1404013632 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1404013632|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1404013632 |P3Thread1of1ForFork3_#t~ite11_Out-1404013632|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1404013632, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1404013632} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1404013632, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1404013632, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1404013632|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:52:36,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-617652764 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-617652764 256) 0))) (or (and (= ~z~0_In-617652764 |P2Thread1of1ForFork2_#t~ite3_Out-617652764|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-617652764 |P2Thread1of1ForFork2_#t~ite3_Out-617652764|) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-617652764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-617652764, ~z$w_buff1~0=~z$w_buff1~0_In-617652764, ~z~0=~z~0_In-617652764} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-617652764|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-617652764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-617652764, ~z$w_buff1~0=~z$w_buff1~0_In-617652764, ~z~0=~z~0_In-617652764} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:52:36,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:52:36,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-262663804 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-262663804 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-262663804 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-262663804 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-262663804| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-262663804 |P3Thread1of1ForFork3_#t~ite12_Out-262663804|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-262663804, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-262663804, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-262663804, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-262663804} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-262663804, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-262663804, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-262663804, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-262663804, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-262663804|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:52:36,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In2147448704 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2147448704 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out2147448704 ~z$r_buff0_thd4~0_In2147448704)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out2147448704 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2147448704, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2147448704} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2147448704, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2147448704, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out2147448704|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:52:36,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In358849924 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In358849924 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In358849924 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In358849924 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out358849924| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out358849924| ~z$r_buff1_thd4~0_In358849924)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In358849924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358849924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In358849924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358849924} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In358849924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358849924, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out358849924|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In358849924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358849924} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:52:36,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:52:36,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2090388746 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2090388746 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2090388746 |P2Thread1of1ForFork2_#t~ite5_Out-2090388746|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-2090388746|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2090388746, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2090388746} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-2090388746|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2090388746, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2090388746} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:52:36,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2078263379 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2078263379 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2078263379 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2078263379 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out2078263379|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In2078263379 |P2Thread1of1ForFork2_#t~ite6_Out2078263379|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2078263379, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078263379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078263379, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078263379} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out2078263379|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2078263379, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078263379, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078263379, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078263379} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:52:36,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1000607800 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1000607800 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1000607800| ~z$r_buff0_thd3~0_In-1000607800) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1000607800| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1000607800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1000607800} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1000607800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1000607800, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1000607800|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:52:36,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In937813152 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In937813152 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In937813152 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In937813152 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out937813152| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out937813152| ~z$r_buff1_thd3~0_In937813152) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In937813152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In937813152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In937813152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In937813152} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In937813152, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In937813152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In937813152, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In937813152, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out937813152|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:52:36,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:52:36,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:52:36,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In645657460 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In645657460 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In645657460 |ULTIMATE.start_main_#t~ite19_Out645657460|)) (and (= ~z~0_In645657460 |ULTIMATE.start_main_#t~ite19_Out645657460|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In645657460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645657460, ~z$w_buff1~0=~z$w_buff1~0_In645657460, ~z~0=~z~0_In645657460} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out645657460|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In645657460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645657460, ~z$w_buff1~0=~z$w_buff1~0_In645657460, ~z~0=~z~0_In645657460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:52:36,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:52:36,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1742024928 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1742024928 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1742024928| ~z$w_buff0_used~0_In1742024928) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1742024928|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1742024928, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1742024928} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1742024928, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1742024928, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1742024928|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:52:36,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1948765526 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1948765526 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1948765526 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1948765526 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1948765526|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1948765526 |ULTIMATE.start_main_#t~ite22_Out-1948765526|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948765526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948765526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1948765526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1948765526} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948765526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948765526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1948765526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1948765526, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1948765526|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:52:36,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1765192606 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1765192606 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1765192606|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1765192606 |ULTIMATE.start_main_#t~ite23_Out-1765192606|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765192606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765192606} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765192606, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765192606, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1765192606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:52:36,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2090732072 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2090732072 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2090732072 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2090732072 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out2090732072| ~z$r_buff1_thd0~0_In2090732072) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out2090732072| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2090732072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2090732072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2090732072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2090732072} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2090732072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2090732072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2090732072, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2090732072|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2090732072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:52:36,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In87795912 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite33_Out87795912| ~z$w_buff1~0_In87795912) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In87795912 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In87795912 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In87795912 256))) (and (= 0 (mod ~z$w_buff1_used~0_In87795912 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out87795912| |ULTIMATE.start_main_#t~ite34_Out87795912|)) (and (not .cse0) (= ~z$w_buff1~0_In87795912 |ULTIMATE.start_main_#t~ite34_Out87795912|) (= |ULTIMATE.start_main_#t~ite33_In87795912| |ULTIMATE.start_main_#t~ite33_Out87795912|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In87795912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In87795912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In87795912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87795912, ~z$w_buff1~0=~z$w_buff1~0_In87795912, ~weak$$choice2~0=~weak$$choice2~0_In87795912, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In87795912|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In87795912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In87795912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In87795912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87795912, ~z$w_buff1~0=~z$w_buff1~0_In87795912, ~weak$$choice2~0=~weak$$choice2~0_In87795912, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out87795912|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out87795912|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:52:36,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-448043011 256)))) (or (and (= ~z$w_buff1_used~0_In-448043011 |ULTIMATE.start_main_#t~ite40_Out-448043011|) (= |ULTIMATE.start_main_#t~ite39_In-448043011| |ULTIMATE.start_main_#t~ite39_Out-448043011|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-448043011 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-448043011 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-448043011 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-448043011 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-448043011| ~z$w_buff1_used~0_In-448043011) (= |ULTIMATE.start_main_#t~ite39_Out-448043011| |ULTIMATE.start_main_#t~ite40_Out-448043011|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-448043011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-448043011, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-448043011|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-448043011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-448043011, ~weak$$choice2~0=~weak$$choice2~0_In-448043011} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-448043011, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-448043011|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-448043011|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-448043011, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-448043011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-448043011, ~weak$$choice2~0=~weak$$choice2~0_In-448043011} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:52:36,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:52:36,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite46_Out1301184400| |ULTIMATE.start_main_#t~ite45_Out1301184400|)) (.cse1 (= (mod ~weak$$choice2~0_In1301184400 256) 0)) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In1301184400 256))) (.cse4 (= (mod ~z$r_buff1_thd0~0_In1301184400 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In1301184400 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1301184400 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 (= |ULTIMATE.start_main_#t~ite44_Out1301184400| 0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite44_Out1301184400| |ULTIMATE.start_main_#t~ite45_Out1301184400|) (or .cse3 (not .cse4)) (or (not .cse5) .cse3))) (and (or (and (= |ULTIMATE.start_main_#t~ite45_In1301184400| |ULTIMATE.start_main_#t~ite45_Out1301184400|) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out1301184400| ~z$r_buff1_thd0~0_In1301184400)) (and .cse0 (= ~z$r_buff1_thd0~0_In1301184400 |ULTIMATE.start_main_#t~ite45_Out1301184400|) .cse1 (or (and .cse5 .cse6) (and .cse4 .cse6) .cse2))) (= |ULTIMATE.start_main_#t~ite44_In1301184400| |ULTIMATE.start_main_#t~ite44_Out1301184400|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1301184400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1301184400, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1301184400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301184400, ~weak$$choice2~0=~weak$$choice2~0_In1301184400, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1301184400|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1301184400|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1301184400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1301184400, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1301184400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1301184400, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1301184400|, ~weak$$choice2~0=~weak$$choice2~0_In1301184400, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1301184400|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1301184400|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:52:36,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 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___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_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_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:52:36,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:52:36,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:52:36 BasicIcfg [2019-12-18 21:52:36,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:52:36,482 INFO L168 Benchmark]: Toolchain (without parser) took 36073.93 ms. Allocated memory was 146.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.3 MB in the beginning and 857.3 MB in the end (delta: -754.9 MB). Peak memory consumption was 969.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,483 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.47 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,485 INFO L168 Benchmark]: Boogie Preprocessor took 50.49 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,486 INFO L168 Benchmark]: RCFGBuilder took 899.63 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,487 INFO L168 Benchmark]: TraceAbstraction took 34172.27 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.9 MB in the beginning and 857.3 MB in the end (delta: -756.3 MB). Peak memory consumption was 910.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:52:36,490 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.47 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.49 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.63 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34172.27 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.9 MB in the beginning and 857.3 MB in the end (delta: -756.3 MB). Peak memory consumption was 910.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L825] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L827] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L829] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 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) [L847] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] 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)) [L848] 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)) [L849] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] 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)) [L850] 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)) [L852] 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)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 33.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1739 SDtfs, 2357 SDslu, 3827 SDs, 0 SdLazy, 1257 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred 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: 17.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 32874 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 126358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...