/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:19:21,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:19:21,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:19:21,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:19:21,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:19:21,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:19:21,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:19:21,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:19:21,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:19:21,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:19:21,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:19:21,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:19:21,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:19:21,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:19:21,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:19:21,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:19:21,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:19:21,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:19:21,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:19:21,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:19:21,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:19:21,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:19:21,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:19:21,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:19:21,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:19:21,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:19:21,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:19:21,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:19:21,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:19:21,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:19:21,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:19:21,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:19:21,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:19:21,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:19:21,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:19:21,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:19:21,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:19:21,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:19:21,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:19:21,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:19:21,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:19:21,490 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-SemanticLbe.epf [2019-12-18 17:19:21,504 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:19:21,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:19:21,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:19:21,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:19:21,506 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:19:21,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:19:21,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:19:21,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:19:21,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:19:21,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:19:21,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:19:21,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:19:21,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:19:21,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:19:21,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:19:21,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:19:21,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:19:21,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:19:21,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:19:21,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:19:21,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:19:21,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:19:21,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:19:21,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:19:21,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:19:21,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:19:21,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:19:21,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:19:21,809 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:19:21,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-18 17:19:21,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee423c80c/c7f229398db8456b8be3bf5f5880524d/FLAG5fe9d338c [2019-12-18 17:19:22,479 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:19:22,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-18 17:19:22,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee423c80c/c7f229398db8456b8be3bf5f5880524d/FLAG5fe9d338c [2019-12-18 17:19:22,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee423c80c/c7f229398db8456b8be3bf5f5880524d [2019-12-18 17:19:22,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:19:22,724 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:19:22,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:19:22,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:19:22,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:19:22,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:19:22" (1/1) ... [2019-12-18 17:19:22,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192be1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:22, skipping insertion in model container [2019-12-18 17:19:22,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:19:22" (1/1) ... [2019-12-18 17:19:22,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:19:22,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:19:23,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:19:23,307 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:19:23,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:19:23,472 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:19:23,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23 WrapperNode [2019-12-18 17:19:23,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:19:23,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:19:23,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:19:23,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:19:23,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:19:23,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:19:23,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:19:23,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:19:23,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (1/1) ... [2019-12-18 17:19:23,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:19:23,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:19:23,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:19:23,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:19:23,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (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 17:19:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:19:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:19:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:19:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:19:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:19:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:19:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:19:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:19:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:19:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:19:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:19:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:19:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:19:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:19:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:19:23,666 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 17:19:24,410 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:19:24,411 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:19:24,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:19:24 BoogieIcfgContainer [2019-12-18 17:19:24,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:19:24,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:19:24,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:19:24,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:19:24,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:19:22" (1/3) ... [2019-12-18 17:19:24,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cca8047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:19:24, skipping insertion in model container [2019-12-18 17:19:24,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:19:23" (2/3) ... [2019-12-18 17:19:24,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cca8047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:19:24, skipping insertion in model container [2019-12-18 17:19:24,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:19:24" (3/3) ... [2019-12-18 17:19:24,422 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2019-12-18 17:19:24,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:19:24,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:19:24,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:19:24,442 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:19:24,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,485 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,485 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,512 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,512 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,512 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,513 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,540 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,556 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,557 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,558 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:19:24,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:19:24,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:19:24,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:19:24,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:19:24,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:19:24,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:19:24,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:19:24,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:19:24,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:19:24,626 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 17:19:24,628 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:19:24,730 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:19:24,730 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:19:24,745 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:19:24,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:19:24,841 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:19:24,841 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:19:24,848 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:19:24,865 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:19:24,867 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:19:29,971 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:19:30,082 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:19:30,554 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:19:30,705 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:19:30,724 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 17:19:30,725 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 17:19:30,728 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 17:19:31,996 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 17:19:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 17:19:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:19:32,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:32,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:19:32,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 17:19:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:32,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045122792] [2019-12-18 17:19:32,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:32,389 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 17:19:32,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045122792] [2019-12-18 17:19:32,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:32,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:19:32,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416202181] [2019-12-18 17:19:32,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:32,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:32,428 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 17:19:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:32,851 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 17:19:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:32,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:19:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:33,097 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 17:19:33,098 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 17:19:33,099 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 17:19:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 17:19:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 17:19:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 17:19:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 17:19:34,997 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 17:19:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:35,000 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 17:19:35,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 17:19:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:19:35,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:35,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:19:35,016 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 17:19:35,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:35,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897451333] [2019-12-18 17:19:35,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:35,124 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 17:19:35,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897451333] [2019-12-18 17:19:35,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:35,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:19:35,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451519424] [2019-12-18 17:19:35,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:19:35,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:19:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:19:35,128 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 17:19:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:35,768 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 17:19:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:19:35,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:19:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:35,899 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 17:19:35,899 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 17:19:35,900 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 17:19:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 17:19:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 17:19:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 17:19:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 17:19:38,016 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 17:19:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:38,016 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 17:19:38,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:19:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 17:19:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:19:38,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:38,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:19:38,023 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 17:19:38,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:38,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208515990] [2019-12-18 17:19:38,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:38,116 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 17:19:38,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208515990] [2019-12-18 17:19:38,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:38,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:19:38,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830737640] [2019-12-18 17:19:38,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:19:38,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:19:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:19:38,122 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 17:19:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:38,699 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 17:19:38,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:19:38,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:19:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:38,857 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 17:19:38,858 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 17:19:38,858 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 17:19:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 17:19:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 17:19:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 17:19:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 17:19:40,142 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 17:19:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:40,142 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 17:19:40,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:19:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 17:19:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 17:19:40,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:40,154 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] [2019-12-18 17:19:40,155 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 17:19:40,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:40,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902028227] [2019-12-18 17:19:40,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:40,217 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 17:19:40,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902028227] [2019-12-18 17:19:40,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:19:40,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444669389] [2019-12-18 17:19:40,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:40,219 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 17:19:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:40,393 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 17:19:40,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:40,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 17:19:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:40,483 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 17:19:40,484 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 17:19:40,484 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 17:19:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 17:19:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 17:19:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 17:19:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 17:19:43,161 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 17:19:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:43,164 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 17:19:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 17:19:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:19:43,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:43,176 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 17:19:43,176 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 17:19:43,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:43,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503344269] [2019-12-18 17:19:43,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:43,271 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 17:19:43,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503344269] [2019-12-18 17:19:43,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:43,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:19:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741380428] [2019-12-18 17:19:43,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:43,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:43,274 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 17:19:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:43,668 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 17:19:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:43,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:19:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:43,741 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 17:19:43,741 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 17:19:43,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 17:19:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 17:19:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 17:19:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 17:19:44,762 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 17:19:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 17:19:44,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 17:19:44,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:19:44,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:44,774 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 17:19:44,774 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:44,774 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 17:19:44,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:44,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901215909] [2019-12-18 17:19:44,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:44,823 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 17:19:44,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901215909] [2019-12-18 17:19:44,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:44,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:19:44,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761988304] [2019-12-18 17:19:44,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:44,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:44,825 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 17:19:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:44,960 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 17:19:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:44,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:19:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:45,026 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 17:19:45,026 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 17:19:45,026 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 17:19:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 17:19:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 17:19:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 17:19:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 17:19:46,985 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 17:19:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:46,986 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 17:19:46,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 17:19:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:19:46,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:46,996 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 17:19:46,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 17:19:46,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:46,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938317468] [2019-12-18 17:19:46,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:47,073 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 17:19:47,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938317468] [2019-12-18 17:19:47,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:47,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:19:47,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250501609] [2019-12-18 17:19:47,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:19:47,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:19:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:19:47,075 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-18 17:19:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:47,179 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-18 17:19:47,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:19:47,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:19:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:47,196 INFO L225 Difference]: With dead ends: 12827 [2019-12-18 17:19:47,196 INFO L226 Difference]: Without dead ends: 10855 [2019-12-18 17:19:47,197 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 17:19:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-18 17:19:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-18 17:19:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-18 17:19:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-18 17:19:47,380 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-18 17:19:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:47,381 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-18 17:19:47,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:19:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-18 17:19:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:19:47,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:47,385 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] [2019-12-18 17:19:47,385 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-18 17:19:47,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:47,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334084117] [2019-12-18 17:19:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:47,437 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 17:19:47,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334084117] [2019-12-18 17:19:47,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:47,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:19:47,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524681424] [2019-12-18 17:19:47,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:19:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:19:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:19:47,439 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-18 17:19:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:47,535 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-18 17:19:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:19:47,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 17:19:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:47,559 INFO L225 Difference]: With dead ends: 16412 [2019-12-18 17:19:47,559 INFO L226 Difference]: Without dead ends: 8743 [2019-12-18 17:19:47,560 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 17:19:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-18 17:19:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-18 17:19:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-18 17:19:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-18 17:19:48,042 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-18 17:19:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:48,043 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-18 17:19:48,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:19:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-18 17:19:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:19:48,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:48,048 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] [2019-12-18 17:19:48,048 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-18 17:19:48,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:48,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226524463] [2019-12-18 17:19:48,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:48,164 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 17:19:48,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226524463] [2019-12-18 17:19:48,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:48,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:19:48,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466901344] [2019-12-18 17:19:48,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:19:48,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:48,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:19:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:19:48,168 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 6 states. [2019-12-18 17:19:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:48,285 INFO L93 Difference]: Finished difference Result 3436 states and 9854 transitions. [2019-12-18 17:19:48,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:19:48,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-18 17:19:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:48,293 INFO L225 Difference]: With dead ends: 3436 [2019-12-18 17:19:48,293 INFO L226 Difference]: Without dead ends: 2817 [2019-12-18 17:19:48,294 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 17:19:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-18 17:19:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2797. [2019-12-18 17:19:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-18 17:19:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 7967 transitions. [2019-12-18 17:19:48,343 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 7967 transitions. Word has length 23 [2019-12-18 17:19:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:48,344 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 7967 transitions. [2019-12-18 17:19:48,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:19:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 7967 transitions. [2019-12-18 17:19:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:19:48,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:48,352 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] [2019-12-18 17:19:48,352 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 17:19:48,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:48,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726329538] [2019-12-18 17:19:48,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:48,392 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 17:19:48,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726329538] [2019-12-18 17:19:48,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:48,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:19:48,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314771093] [2019-12-18 17:19:48,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:48,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:48,394 INFO L87 Difference]: Start difference. First operand 2797 states and 7967 transitions. Second operand 3 states. [2019-12-18 17:19:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:48,449 INFO L93 Difference]: Finished difference Result 4322 states and 12247 transitions. [2019-12-18 17:19:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:48,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:19:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:48,457 INFO L225 Difference]: With dead ends: 4322 [2019-12-18 17:19:48,457 INFO L226 Difference]: Without dead ends: 4322 [2019-12-18 17:19:48,458 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 17:19:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-18 17:19:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3273. [2019-12-18 17:19:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-18 17:19:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 9436 transitions. [2019-12-18 17:19:48,505 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 9436 transitions. Word has length 32 [2019-12-18 17:19:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:48,506 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 9436 transitions. [2019-12-18 17:19:48,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 9436 transitions. [2019-12-18 17:19:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:19:48,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:48,510 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] [2019-12-18 17:19:48,510 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 17:19:48,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:48,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851252942] [2019-12-18 17:19:48,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:48,600 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 17:19:48,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851252942] [2019-12-18 17:19:48,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:48,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:19:48,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039846321] [2019-12-18 17:19:48,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:19:48,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:19:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:19:48,602 INFO L87 Difference]: Start difference. First operand 3273 states and 9436 transitions. Second operand 6 states. [2019-12-18 17:19:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:49,150 INFO L93 Difference]: Finished difference Result 6672 states and 18337 transitions. [2019-12-18 17:19:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:19:49,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:19:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:49,159 INFO L225 Difference]: With dead ends: 6672 [2019-12-18 17:19:49,160 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 17:19:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:19:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 17:19:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 3403. [2019-12-18 17:19:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-12-18 17:19:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 9764 transitions. [2019-12-18 17:19:49,213 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 9764 transitions. Word has length 32 [2019-12-18 17:19:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:49,213 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 9764 transitions. [2019-12-18 17:19:49,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:19:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 9764 transitions. [2019-12-18 17:19:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:19:49,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:49,218 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] [2019-12-18 17:19:49,218 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash 668169174, now seen corresponding path program 1 times [2019-12-18 17:19:49,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:49,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600247575] [2019-12-18 17:19:49,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:49,311 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 17:19:49,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600247575] [2019-12-18 17:19:49,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:49,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:19:49,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239402081] [2019-12-18 17:19:49,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:19:49,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:49,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:19:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:19:49,313 INFO L87 Difference]: Start difference. First operand 3403 states and 9764 transitions. Second operand 7 states. [2019-12-18 17:19:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:49,470 INFO L93 Difference]: Finished difference Result 2629 states and 7805 transitions. [2019-12-18 17:19:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:19:49,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 17:19:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:49,474 INFO L225 Difference]: With dead ends: 2629 [2019-12-18 17:19:49,474 INFO L226 Difference]: Without dead ends: 1778 [2019-12-18 17:19:49,474 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 17:19:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-18 17:19:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1633. [2019-12-18 17:19:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-12-18 17:19:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 4725 transitions. [2019-12-18 17:19:49,501 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 4725 transitions. Word has length 32 [2019-12-18 17:19:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:49,501 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 4725 transitions. [2019-12-18 17:19:49,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:19:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 4725 transitions. [2019-12-18 17:19:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:19:49,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:49,504 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] [2019-12-18 17:19:49,504 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 210598672, now seen corresponding path program 1 times [2019-12-18 17:19:49,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:49,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786757865] [2019-12-18 17:19:49,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:49,550 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 17:19:49,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786757865] [2019-12-18 17:19:49,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:49,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:19:49,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426853967] [2019-12-18 17:19:49,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:49,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:49,553 INFO L87 Difference]: Start difference. First operand 1633 states and 4725 transitions. Second operand 3 states. [2019-12-18 17:19:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:49,585 INFO L93 Difference]: Finished difference Result 2025 states and 5601 transitions. [2019-12-18 17:19:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:49,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:19:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:49,589 INFO L225 Difference]: With dead ends: 2025 [2019-12-18 17:19:49,590 INFO L226 Difference]: Without dead ends: 2025 [2019-12-18 17:19:49,590 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 17:19:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-12-18 17:19:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1650. [2019-12-18 17:19:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-12-18 17:19:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 4662 transitions. [2019-12-18 17:19:49,618 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 4662 transitions. Word has length 47 [2019-12-18 17:19:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:49,618 INFO L462 AbstractCegarLoop]: Abstraction has 1650 states and 4662 transitions. [2019-12-18 17:19:49,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 4662 transitions. [2019-12-18 17:19:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:19:49,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:49,622 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] [2019-12-18 17:19:49,622 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 537782324, now seen corresponding path program 1 times [2019-12-18 17:19:49,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364145592] [2019-12-18 17:19:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:49,690 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 17:19:49,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364145592] [2019-12-18 17:19:49,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:49,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:19:49,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543997543] [2019-12-18 17:19:49,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:19:49,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:19:49,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:19:49,692 INFO L87 Difference]: Start difference. First operand 1650 states and 4662 transitions. Second operand 6 states. [2019-12-18 17:19:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:49,872 INFO L93 Difference]: Finished difference Result 4743 states and 13379 transitions. [2019-12-18 17:19:49,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:19:49,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 17:19:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:49,878 INFO L225 Difference]: With dead ends: 4743 [2019-12-18 17:19:49,878 INFO L226 Difference]: Without dead ends: 3059 [2019-12-18 17:19:49,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:19:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2019-12-18 17:19:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 1846. [2019-12-18 17:19:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2019-12-18 17:19:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 5208 transitions. [2019-12-18 17:19:49,907 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 5208 transitions. Word has length 47 [2019-12-18 17:19:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:49,907 INFO L462 AbstractCegarLoop]: Abstraction has 1846 states and 5208 transitions. [2019-12-18 17:19:49,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:19:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 5208 transitions. [2019-12-18 17:19:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:19:49,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:49,910 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] [2019-12-18 17:19:49,910 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1324143500, now seen corresponding path program 2 times [2019-12-18 17:19:49,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:49,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243231669] [2019-12-18 17:19:49,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:49,982 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 17:19:49,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243231669] [2019-12-18 17:19:49,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:49,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:19:49,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963643289] [2019-12-18 17:19:49,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:19:49,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:19:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:19:49,984 INFO L87 Difference]: Start difference. First operand 1846 states and 5208 transitions. Second operand 4 states. [2019-12-18 17:19:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:50,005 INFO L93 Difference]: Finished difference Result 2272 states and 6156 transitions. [2019-12-18 17:19:50,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:19:50,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:19:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:50,006 INFO L225 Difference]: With dead ends: 2272 [2019-12-18 17:19:50,007 INFO L226 Difference]: Without dead ends: 474 [2019-12-18 17:19:50,007 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 17:19:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-18 17:19:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-12-18 17:19:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-12-18 17:19:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1033 transitions. [2019-12-18 17:19:50,013 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1033 transitions. Word has length 47 [2019-12-18 17:19:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:50,013 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1033 transitions. [2019-12-18 17:19:50,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:19:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1033 transitions. [2019-12-18 17:19:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:19:50,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:50,015 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] [2019-12-18 17:19:50,015 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash 288167740, now seen corresponding path program 3 times [2019-12-18 17:19:50,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:50,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143018400] [2019-12-18 17:19:50,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:50,090 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 17:19:50,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143018400] [2019-12-18 17:19:50,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:50,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:19:50,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418982830] [2019-12-18 17:19:50,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:19:50,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:19:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:19:50,092 INFO L87 Difference]: Start difference. First operand 474 states and 1033 transitions. Second operand 7 states. [2019-12-18 17:19:50,255 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 17:19:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:50,384 INFO L93 Difference]: Finished difference Result 842 states and 1807 transitions. [2019-12-18 17:19:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:19:50,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:19:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:50,385 INFO L225 Difference]: With dead ends: 842 [2019-12-18 17:19:50,385 INFO L226 Difference]: Without dead ends: 564 [2019-12-18 17:19:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:19:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-18 17:19:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 506. [2019-12-18 17:19:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-18 17:19:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1093 transitions. [2019-12-18 17:19:50,393 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1093 transitions. Word has length 47 [2019-12-18 17:19:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:50,393 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1093 transitions. [2019-12-18 17:19:50,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:19:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1093 transitions. [2019-12-18 17:19:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:19:50,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:50,395 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] [2019-12-18 17:19:50,395 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash -261128468, now seen corresponding path program 4 times [2019-12-18 17:19:50,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:50,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528575242] [2019-12-18 17:19:50,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:19:50,495 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 17:19:50,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528575242] [2019-12-18 17:19:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:19:50,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:19:50,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733859663] [2019-12-18 17:19:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:19:50,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:19:50,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:19:50,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:19:50,498 INFO L87 Difference]: Start difference. First operand 506 states and 1093 transitions. Second operand 3 states. [2019-12-18 17:19:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:19:50,511 INFO L93 Difference]: Finished difference Result 506 states and 1091 transitions. [2019-12-18 17:19:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:19:50,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:19:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:19:50,512 INFO L225 Difference]: With dead ends: 506 [2019-12-18 17:19:50,513 INFO L226 Difference]: Without dead ends: 506 [2019-12-18 17:19:50,513 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 17:19:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-18 17:19:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-12-18 17:19:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-18 17:19:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1091 transitions. [2019-12-18 17:19:50,520 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1091 transitions. Word has length 47 [2019-12-18 17:19:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:19:50,520 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1091 transitions. [2019-12-18 17:19:50,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:19:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1091 transitions. [2019-12-18 17:19:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:19:50,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:19:50,522 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] [2019-12-18 17:19:50,522 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:19:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:19:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 1 times [2019-12-18 17:19:50,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:19:50,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616411075] [2019-12-18 17:19:50,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:19:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:19:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:19:50,694 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:19:50,694 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:19:50,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_59|) (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59|) |v_ULTIMATE.start_main_~#t997~0.offset_37| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59|) 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t997~0.base_59| 4) |v_#length_31|) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_37|) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59| 1)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_37|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_22|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_59|, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_32|, ~y~0=v_~y~0_19, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_35|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_23|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-18 17:19:50,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-18 17:19:50,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-18 17:19:50,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-18 17:19:50,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~__unbuffered_p3_EBX~0_Out969572712 ~b~0_In969572712) (= ~__unbuffered_p3_EAX~0_Out969572712 ~a~0_Out969572712) (= ~z$r_buff0_thd3~0_In969572712 ~z$r_buff1_thd3~0_Out969572712) (= 1 ~a~0_Out969572712) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In969572712)) (= ~z$r_buff0_thd2~0_In969572712 ~z$r_buff1_thd2~0_Out969572712) (= ~z$r_buff0_thd1~0_In969572712 ~z$r_buff1_thd1~0_Out969572712) (= ~z$r_buff1_thd0~0_Out969572712 ~z$r_buff0_thd0~0_In969572712) (= 1 ~z$r_buff0_thd4~0_Out969572712) (= ~z$r_buff1_thd4~0_Out969572712 ~z$r_buff0_thd4~0_In969572712)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In969572712, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In969572712, ~b~0=~b~0_In969572712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In969572712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In969572712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In969572712, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In969572712} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In969572712, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out969572712, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out969572712, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out969572712, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out969572712, ~a~0=~a~0_Out969572712, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In969572712, ~b~0=~b~0_In969572712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out969572712, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out969572712, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out969572712, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out969572712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In969572712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In969572712, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In969572712} AuxVars[] AssignedVars[~a~0, ~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, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:19:50,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 17:19:50,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 17:19:50,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1025744418 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1025744418| |P2Thread1of1ForFork1_#t~ite8_Out-1025744418|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1025744418 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1025744418 256) 0)) (and (= (mod ~z$w_buff1_used~0_In-1025744418 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1025744418 256) 0))) (= ~z$w_buff0~0_In-1025744418 |P2Thread1of1ForFork1_#t~ite8_Out-1025744418|) .cse1) (and (not .cse1) (= ~z$w_buff0~0_In-1025744418 |P2Thread1of1ForFork1_#t~ite9_Out-1025744418|) (= |P2Thread1of1ForFork1_#t~ite8_In-1025744418| |P2Thread1of1ForFork1_#t~ite8_Out-1025744418|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1025744418, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025744418, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025744418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025744418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025744418, ~weak$$choice2~0=~weak$$choice2~0_In-1025744418, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1025744418|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1025744418, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1025744418, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1025744418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025744418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1025744418, ~weak$$choice2~0=~weak$$choice2~0_In-1025744418, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1025744418|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1025744418|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:19:50,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1220718356 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In-1220718356| |P2Thread1of1ForFork1_#t~ite11_Out-1220718356|) (= ~z$w_buff1~0_In-1220718356 |P2Thread1of1ForFork1_#t~ite12_Out-1220718356|)) (and (= |P2Thread1of1ForFork1_#t~ite12_Out-1220718356| |P2Thread1of1ForFork1_#t~ite11_Out-1220718356|) (= ~z$w_buff1~0_In-1220718356 |P2Thread1of1ForFork1_#t~ite11_Out-1220718356|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1220718356 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1220718356 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1220718356 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1220718356 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1220718356, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1220718356, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-1220718356|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1220718356, ~z$w_buff1~0=~z$w_buff1~0_In-1220718356, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1220718356, ~weak$$choice2~0=~weak$$choice2~0_In-1220718356} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1220718356, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1220718356|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1220718356, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1220718356|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1220718356, ~z$w_buff1~0=~z$w_buff1~0_In-1220718356, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1220718356, ~weak$$choice2~0=~weak$$choice2~0_In-1220718356} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:19:50,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1070364957 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1070364957| |P2Thread1of1ForFork1_#t~ite14_Out1070364957|) (= ~z$w_buff0_used~0_In1070364957 |P2Thread1of1ForFork1_#t~ite15_Out1070364957|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1070364957 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1070364957 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1070364957 256))) (and (= (mod ~z$w_buff1_used~0_In1070364957 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out1070364957| ~z$w_buff0_used~0_In1070364957) (= |P2Thread1of1ForFork1_#t~ite14_Out1070364957| |P2Thread1of1ForFork1_#t~ite15_Out1070364957|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1070364957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1070364957, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1070364957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1070364957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1070364957, ~weak$$choice2~0=~weak$$choice2~0_In1070364957} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1070364957|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1070364957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1070364957, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1070364957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1070364957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1070364957, ~weak$$choice2~0=~weak$$choice2~0_In1070364957} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 17:19:50,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 17:19:50,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In533849512 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In533849512| |P2Thread1of1ForFork1_#t~ite23_Out533849512|) (= ~z$r_buff1_thd3~0_In533849512 |P2Thread1of1ForFork1_#t~ite24_Out533849512|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In533849512 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In533849512 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In533849512 256)) .cse1) (= (mod ~z$w_buff0_used~0_In533849512 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out533849512| ~z$r_buff1_thd3~0_In533849512) (= |P2Thread1of1ForFork1_#t~ite23_Out533849512| |P2Thread1of1ForFork1_#t~ite24_Out533849512|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In533849512, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In533849512, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In533849512|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In533849512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In533849512, ~weak$$choice2~0=~weak$$choice2~0_In533849512} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out533849512|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In533849512, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In533849512, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out533849512|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In533849512, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In533849512, ~weak$$choice2~0=~weak$$choice2~0_In533849512} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 17:19:50,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:19:50,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In518926165 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In518926165 256)))) (or (and (= ~z$w_buff0_used~0_In518926165 |P3Thread1of1ForFork2_#t~ite28_Out518926165|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out518926165|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In518926165, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In518926165} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out518926165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In518926165, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In518926165} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:19:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1633234413 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1633234413 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1633234413 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1633234413 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1633234413|)) (and (= ~z$w_buff1_used~0_In1633234413 |P3Thread1of1ForFork2_#t~ite29_Out1633234413|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1633234413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1633234413, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1633234413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1633234413} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1633234413|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1633234413, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1633234413, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1633234413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1633234413} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:19:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-349641487 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-349641487 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-349641487 ~z$r_buff0_thd4~0_In-349641487)) (and (= ~z$r_buff0_thd4~0_Out-349641487 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-349641487, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-349641487} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-349641487, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-349641487, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-349641487|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 17:19:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-520897340 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-520897340 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-520897340 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-520897340 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out-520897340| ~z$r_buff1_thd4~0_In-520897340) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork2_#t~ite31_Out-520897340| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-520897340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520897340, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-520897340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520897340} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-520897340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520897340, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-520897340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520897340, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-520897340|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:19:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:19:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:19:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1931836960 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1931836960 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite36_Out1931836960| |ULTIMATE.start_main_#t~ite37_Out1931836960|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1931836960| ~z$w_buff1~0_In1931836960) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out1931836960| ~z~0_In1931836960)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1931836960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1931836960, ~z$w_buff1~0=~z$w_buff1~0_In1931836960, ~z~0=~z~0_In1931836960} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1931836960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1931836960, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1931836960|, ~z$w_buff1~0=~z$w_buff1~0_In1931836960, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1931836960|, ~z~0=~z~0_In1931836960} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:19:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1654304677 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1654304677 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1654304677 |ULTIMATE.start_main_#t~ite38_Out-1654304677|)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1654304677| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1654304677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654304677} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1654304677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654304677, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1654304677|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:19:50,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1025071973 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1025071973 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1025071973 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1025071973 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1025071973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1025071973| ~z$w_buff1_used~0_In1025071973)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1025071973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1025071973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1025071973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025071973} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1025071973, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1025071973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1025071973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1025071973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025071973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:19:50,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1349386295 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1349386295 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1349386295|)) (and (= ~z$r_buff0_thd0~0_In-1349386295 |ULTIMATE.start_main_#t~ite40_Out-1349386295|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1349386295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349386295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1349386295, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1349386295|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349386295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:19:50,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In945089654 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In945089654 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In945089654 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In945089654 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out945089654| ~z$r_buff1_thd0~0_In945089654) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out945089654| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In945089654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In945089654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In945089654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In945089654} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out945089654|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In945089654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In945089654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In945089654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In945089654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:19:50,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:19:50,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:19:50 BasicIcfg [2019-12-18 17:19:50,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:19:50,804 INFO L168 Benchmark]: Toolchain (without parser) took 28080.66 ms. Allocated memory was 137.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.7 MB in the beginning and 995.2 MB in the end (delta: -894.5 MB). Peak memory consumption was 427.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,805 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.79 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,812 INFO L168 Benchmark]: Boogie Preprocessor took 43.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,812 INFO L168 Benchmark]: RCFGBuilder took 831.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 105.7 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,813 INFO L168 Benchmark]: TraceAbstraction took 26388.77 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 105.0 MB in the beginning and 995.2 MB in the end (delta: -890.2 MB). Peak memory consumption was 366.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:19:50,819 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.79 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 156.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 105.7 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26388.77 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 105.0 MB in the beginning and 995.2 MB in the end (delta: -890.2 MB). Peak memory consumption was 366.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L845] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L847] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L849] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 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) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 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 [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1904 SDtfs, 2396 SDslu, 3102 SDs, 0 SdLazy, 958 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred 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: 11.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 14542 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 41390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...