/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:19:09,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:19:09,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:19:09,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:19:09,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:19:09,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:19:09,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:19:09,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:19:09,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:19:09,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:19:09,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:19:09,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:19:09,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:19:09,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:19:09,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:19:09,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:19:09,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:19:09,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:19:09,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:19:09,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:19:09,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:19:09,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:19:09,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:19:09,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:19:09,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:19:09,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:19:09,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:19:09,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:19:09,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:19:09,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:19:09,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:19:09,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:19:09,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:19:09,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:19:09,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:19:09,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:19:09,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:19:09,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:19:09,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:19:09,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:19:09,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:19:09,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:19:09,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:19:09,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:19:09,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:19:09,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:19:09,444 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:19:09,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:19:09,444 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:19:09,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:19:09,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:19:09,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:19:09,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:19:09,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:19:09,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:19:09,445 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:19:09,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:19:09,446 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:19:09,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:19:09,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:19:09,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:19:09,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:19:09,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:19:09,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:19:09,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:19:09,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:19:09,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:19:09,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:19:09,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:19:09,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:19:09,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:19:09,737 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:19:09,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-18 20:19:09,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61deaf413/fe5d5ad06dde41a38c4bd23e8154d9eb/FLAGbfe9cf92e [2019-12-18 20:19:10,317 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:19:10,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-18 20:19:10,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61deaf413/fe5d5ad06dde41a38c4bd23e8154d9eb/FLAGbfe9cf92e [2019-12-18 20:19:10,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61deaf413/fe5d5ad06dde41a38c4bd23e8154d9eb [2019-12-18 20:19:10,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:19:10,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:19:10,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:10,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:19:10,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:19:10,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:10" (1/1) ... [2019-12-18 20:19:10,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:10, skipping insertion in model container [2019-12-18 20:19:10,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:10" (1/1) ... [2019-12-18 20:19:10,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:19:10,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:19:11,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:11,347 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:19:11,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:11,506 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:19:11,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11 WrapperNode [2019-12-18 20:19:11,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:11,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:11,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:19:11,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:19:11,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:11,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:19:11,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:19:11,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:19:11,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (1/1) ... [2019-12-18 20:19:11,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:19:11,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:19:11,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:19:11,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:19:11,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (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 20:19:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:19:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:19:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:19:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:19:11,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:19:11,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:19:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:19:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:19:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:19:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:19:11,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:19:11,677 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 20:19:12,408 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:19:12,409 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:19:12,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:12 BoogieIcfgContainer [2019-12-18 20:19:12,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:19:12,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:19:12,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:19:12,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:19:12,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:19:10" (1/3) ... [2019-12-18 20:19:12,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d428df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:12, skipping insertion in model container [2019-12-18 20:19:12,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:11" (2/3) ... [2019-12-18 20:19:12,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d428df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:12, skipping insertion in model container [2019-12-18 20:19:12,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:12" (3/3) ... [2019-12-18 20:19:12,422 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-18 20:19:12,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:19:12,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:19:12,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:19:12,439 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:19:12,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,488 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,488 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:12,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:19:12,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:19:12,585 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:19:12,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:19:12,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:19:12,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:19:12,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:19:12,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:19:12,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:19:12,609 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 20:19:12,611 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:12,711 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:12,712 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:12,726 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:12,745 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:12,787 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:12,787 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:12,795 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:12,810 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:19:12,811 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:19:16,132 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 20:19:16,241 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 20:19:16,268 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-18 20:19:16,269 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 20:19:16,272 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 20:19:16,711 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-18 20:19:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-18 20:19:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:19:16,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:16,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:19:16,723 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-18 20:19:16,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:16,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292253078] [2019-12-18 20:19:16,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:16,959 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 20:19:16,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292253078] [2019-12-18 20:19:16,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:16,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:16,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294982745] [2019-12-18 20:19:16,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:16,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:16,987 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-18 20:19:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:17,251 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-18 20:19:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:19:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:17,332 INFO L225 Difference]: With dead ends: 8205 [2019-12-18 20:19:17,332 INFO L226 Difference]: Without dead ends: 7724 [2019-12-18 20:19:17,333 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 20:19:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-18 20:19:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-18 20:19:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-18 20:19:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-18 20:19:17,942 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-18 20:19:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:17,942 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-18 20:19:17,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-18 20:19:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:19:17,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:17,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:17,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:17,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-18 20:19:17,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:17,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192238292] [2019-12-18 20:19:17,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:18,008 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 20:19:18,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192238292] [2019-12-18 20:19:18,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:18,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:18,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837885614] [2019-12-18 20:19:18,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:18,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:18,012 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-18 20:19:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:18,042 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-18 20:19:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:18,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 20:19:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:18,049 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 20:19:18,050 INFO L226 Difference]: Without dead ends: 1230 [2019-12-18 20:19:18,052 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 20:19:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-18 20:19:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-18 20:19:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-18 20:19:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-18 20:19:18,093 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-18 20:19:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:18,093 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-18 20:19:18,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-18 20:19:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:19:18,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:18,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:18,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-18 20:19:18,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:18,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882836477] [2019-12-18 20:19:18,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:18,210 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 20:19:18,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882836477] [2019-12-18 20:19:18,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:18,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:18,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063711958] [2019-12-18 20:19:18,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:18,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:18,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:18,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:18,213 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-18 20:19:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:18,524 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-18 20:19:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:19:18,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:19:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:18,536 INFO L225 Difference]: With dead ends: 1827 [2019-12-18 20:19:18,537 INFO L226 Difference]: Without dead ends: 1827 [2019-12-18 20:19:18,537 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 20:19:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-18 20:19:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-18 20:19:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-18 20:19:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-18 20:19:18,593 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-18 20:19:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:18,594 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-18 20:19:18,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-18 20:19:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:19:18,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:18,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:18,598 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-18 20:19:18,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:18,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872228003] [2019-12-18 20:19:18,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:18,790 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 20:19:18,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872228003] [2019-12-18 20:19:18,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:18,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:19:18,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230837817] [2019-12-18 20:19:18,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:19:18,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:19:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:19:18,793 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-18 20:19:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:19,237 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-18 20:19:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:19:19,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:19:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:19,250 INFO L225 Difference]: With dead ends: 2335 [2019-12-18 20:19:19,251 INFO L226 Difference]: Without dead ends: 2335 [2019-12-18 20:19:19,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-18 20:19:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-18 20:19:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-18 20:19:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-18 20:19:19,309 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-18 20:19:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:19,310 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-18 20:19:19,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:19:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-18 20:19:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:19:19,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:19,312 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] [2019-12-18 20:19:19,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:19,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-18 20:19:19,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:19,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053577574] [2019-12-18 20:19:19,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:19,377 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 20:19:19,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053577574] [2019-12-18 20:19:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058548019] [2019-12-18 20:19:19,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:19,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:19,380 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-18 20:19:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:19,394 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-18 20:19:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:19,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:19:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:19,404 INFO L225 Difference]: With dead ends: 1702 [2019-12-18 20:19:19,404 INFO L226 Difference]: Without dead ends: 1702 [2019-12-18 20:19:19,405 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 20:19:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-18 20:19:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-18 20:19:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-18 20:19:19,445 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-18 20:19:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:19,446 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-18 20:19:19,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-18 20:19:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:19,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:19,449 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] [2019-12-18 20:19:19,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-18 20:19:19,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:19,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003845296] [2019-12-18 20:19:19,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:19,567 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 20:19:19,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003845296] [2019-12-18 20:19:19,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:19,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:19,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421812798] [2019-12-18 20:19:19,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:19,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:19,569 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-18 20:19:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:19,599 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-18 20:19:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:19,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 20:19:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:19,617 INFO L225 Difference]: With dead ends: 2698 [2019-12-18 20:19:19,618 INFO L226 Difference]: Without dead ends: 1248 [2019-12-18 20:19:19,618 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 20:19:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-18 20:19:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-18 20:19:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-18 20:19:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-18 20:19:19,654 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-18 20:19:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:19,654 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-18 20:19:19,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-18 20:19:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:19,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:19,656 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] [2019-12-18 20:19:19,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-18 20:19:19,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:19,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202883563] [2019-12-18 20:19:19,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:19,773 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 20:19:19,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202883563] [2019-12-18 20:19:19,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:19,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:19:19,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589124040] [2019-12-18 20:19:19,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:19,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:19,776 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 5 states. [2019-12-18 20:19:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:20,224 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-18 20:19:20,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:19:20,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:19:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:20,233 INFO L225 Difference]: With dead ends: 1897 [2019-12-18 20:19:20,233 INFO L226 Difference]: Without dead ends: 1897 [2019-12-18 20:19:20,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:19:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-18 20:19:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-18 20:19:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-18 20:19:20,277 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-18 20:19:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:20,278 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-18 20:19:20,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-18 20:19:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:19:20,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:20,281 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] [2019-12-18 20:19:20,281 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-18 20:19:20,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:20,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819014966] [2019-12-18 20:19:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:20,320 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 20:19:20,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819014966] [2019-12-18 20:19:20,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:20,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:20,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230243185] [2019-12-18 20:19:20,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:20,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:20,322 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 4 states. [2019-12-18 20:19:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:20,342 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-18 20:19:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:20,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 20:19:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:20,346 INFO L225 Difference]: With dead ends: 921 [2019-12-18 20:19:20,346 INFO L226 Difference]: Without dead ends: 824 [2019-12-18 20:19:20,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-18 20:19:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-18 20:19:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 20:19:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-18 20:19:20,364 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-18 20:19:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:20,364 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-18 20:19:20,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-18 20:19:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:20,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:20,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:20,368 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-18 20:19:20,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:20,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629854391] [2019-12-18 20:19:20,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:20,455 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 20:19:20,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629854391] [2019-12-18 20:19:20,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:20,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:19:20,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561799416] [2019-12-18 20:19:20,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:20,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:20,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:20,458 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-18 20:19:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:20,636 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-18 20:19:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:19:20,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:20,640 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 20:19:20,640 INFO L226 Difference]: Without dead ends: 903 [2019-12-18 20:19:20,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:19:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-18 20:19:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-18 20:19:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 20:19:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-18 20:19:20,659 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-18 20:19:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:20,659 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-18 20:19:20,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-18 20:19:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:20,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:20,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:20,662 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-18 20:19:20,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:20,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989642217] [2019-12-18 20:19:20,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:20,830 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 20:19:20,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989642217] [2019-12-18 20:19:20,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:20,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:19:20,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284722046] [2019-12-18 20:19:20,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:20,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:20,832 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-18 20:19:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:21,366 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-18 20:19:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:19:21,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:21,371 INFO L225 Difference]: With dead ends: 1033 [2019-12-18 20:19:21,371 INFO L226 Difference]: Without dead ends: 1033 [2019-12-18 20:19:21,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-18 20:19:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 833. [2019-12-18 20:19:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-18 20:19:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1740 transitions. [2019-12-18 20:19:21,390 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1740 transitions. Word has length 51 [2019-12-18 20:19:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:21,391 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1740 transitions. [2019-12-18 20:19:21,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1740 transitions. [2019-12-18 20:19:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:21,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:21,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:21,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-18 20:19:21,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:21,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427380897] [2019-12-18 20:19:21,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:21,472 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 20:19:21,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427380897] [2019-12-18 20:19:21,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:21,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:21,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433660994] [2019-12-18 20:19:21,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:21,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:21,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:21,475 INFO L87 Difference]: Start difference. First operand 833 states and 1740 transitions. Second operand 3 states. [2019-12-18 20:19:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:21,534 INFO L93 Difference]: Finished difference Result 1106 states and 2316 transitions. [2019-12-18 20:19:21,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:21,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:19:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:21,537 INFO L225 Difference]: With dead ends: 1106 [2019-12-18 20:19:21,538 INFO L226 Difference]: Without dead ends: 1106 [2019-12-18 20:19:21,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-18 20:19:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-12-18 20:19:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-18 20:19:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1876 transitions. [2019-12-18 20:19:21,556 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1876 transitions. Word has length 51 [2019-12-18 20:19:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:21,558 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1876 transitions. [2019-12-18 20:19:21,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1876 transitions. [2019-12-18 20:19:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:21,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:21,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:21,561 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-18 20:19:21,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:21,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572027247] [2019-12-18 20:19:21,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:21,632 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 20:19:21,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572027247] [2019-12-18 20:19:21,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:21,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:21,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423268265] [2019-12-18 20:19:21,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:21,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:21,634 INFO L87 Difference]: Start difference. First operand 890 states and 1876 transitions. Second operand 3 states. [2019-12-18 20:19:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:21,646 INFO L93 Difference]: Finished difference Result 889 states and 1874 transitions. [2019-12-18 20:19:21,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:21,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:19:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:21,649 INFO L225 Difference]: With dead ends: 889 [2019-12-18 20:19:21,649 INFO L226 Difference]: Without dead ends: 889 [2019-12-18 20:19:21,649 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 20:19:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-12-18 20:19:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 795. [2019-12-18 20:19:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-18 20:19:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1696 transitions. [2019-12-18 20:19:21,666 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1696 transitions. Word has length 52 [2019-12-18 20:19:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:21,666 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1696 transitions. [2019-12-18 20:19:21,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1696 transitions. [2019-12-18 20:19:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:19:21,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:21,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:21,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-18 20:19:21,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:21,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975814003] [2019-12-18 20:19:21,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:21,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:19:21,857 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:19:21,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_22|) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22|) 0) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22|) |v_ULTIMATE.start_main_~#t307~0.offset_17| 0)) |v_#memory_int_11|) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_22| 4)) (= v_~y$w_buff1_used~0_64 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_17| 0) (= 0 v_~weak$$choice0~0_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_22|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:19:21,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:19:21,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff0_thd0~0_In15689029 ~y$r_buff1_thd0~0_Out15689029) (= ~y$r_buff1_thd2~0_Out15689029 ~y$r_buff0_thd2~0_In15689029) (= ~x~0_In15689029 ~__unbuffered_p0_EAX~0_Out15689029) (= ~y$r_buff1_thd1~0_Out15689029 ~y$r_buff0_thd1~0_In15689029) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In15689029)) (= ~y$r_buff0_thd1~0_Out15689029 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15689029, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In15689029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In15689029, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In15689029, ~x~0=~x~0_In15689029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out15689029, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out15689029, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out15689029, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15689029, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out15689029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In15689029, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In15689029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out15689029, ~x~0=~x~0_In15689029} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:19:21,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In18163978 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In18163978 256) 0))) (or (and (= ~y$w_buff0_used~0_In18163978 |P0Thread1of1ForFork0_#t~ite5_Out18163978|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out18163978|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In18163978, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In18163978} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out18163978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In18163978, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In18163978} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:19:21,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-438748973 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-438748973 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-438748973 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-438748973 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-438748973 |P0Thread1of1ForFork0_#t~ite6_Out-438748973|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-438748973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-438748973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-438748973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438748973} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-438748973|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-438748973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-438748973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438748973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:19:21,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2139964999 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-2139964999 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-2139964999 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-2139964999 ~y$r_buff0_thd1~0_Out-2139964999)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139964999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2139964999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139964999, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2139964999|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2139964999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:19:21,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In875851172 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In875851172 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In875851172 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In875851172 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out875851172|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In875851172 |P0Thread1of1ForFork0_#t~ite8_Out875851172|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In875851172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In875851172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In875851172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In875851172} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In875851172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In875851172, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out875851172|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In875851172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In875851172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:19:21,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:19:21,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1347351390 256) 0))) (or (and (= ~y$w_buff1~0_In-1347351390 |P1Thread1of1ForFork1_#t~ite18_Out-1347351390|) (= |P1Thread1of1ForFork1_#t~ite17_In-1347351390| |P1Thread1of1ForFork1_#t~ite17_Out-1347351390|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1347351390 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1347351390 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1347351390 256) 0)) (= (mod ~y$w_buff0_used~0_In-1347351390 256) 0))) (= |P1Thread1of1ForFork1_#t~ite18_Out-1347351390| |P1Thread1of1ForFork1_#t~ite17_Out-1347351390|) .cse0 (= ~y$w_buff1~0_In-1347351390 |P1Thread1of1ForFork1_#t~ite17_Out-1347351390|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347351390, ~y$w_buff1~0=~y$w_buff1~0_In-1347351390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347351390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347351390, ~weak$$choice2~0=~weak$$choice2~0_In-1347351390, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1347351390|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347351390} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1347351390, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1347351390|, ~y$w_buff1~0=~y$w_buff1~0_In-1347351390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1347351390, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1347351390, ~weak$$choice2~0=~weak$$choice2~0_In-1347351390, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1347351390|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1347351390} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:19:21,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1034734488 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1034734488| ~y$w_buff0_used~0_In-1034734488) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1034734488 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1034734488 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-1034734488 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1034734488 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out-1034734488| |P1Thread1of1ForFork1_#t~ite20_Out-1034734488|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out-1034734488| ~y$w_buff0_used~0_In-1034734488) (= |P1Thread1of1ForFork1_#t~ite20_In-1034734488| |P1Thread1of1ForFork1_#t~ite20_Out-1034734488|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1034734488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034734488, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1034734488|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034734488, ~weak$$choice2~0=~weak$$choice2~0_In-1034734488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034734488} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1034734488, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034734488, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1034734488|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034734488, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1034734488|, ~weak$$choice2~0=~weak$$choice2~0_In-1034734488, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034734488} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:19:21,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-1550322079 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1550322079 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1550322079| |P1Thread1of1ForFork1_#t~ite23_Out-1550322079|)) (.cse5 (= (mod ~weak$$choice2~0_In-1550322079 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1550322079 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1550322079 256) 0))) (or (and (or (and .cse0 (= ~y$w_buff1_used~0_In-1550322079 |P1Thread1of1ForFork1_#t~ite23_Out-1550322079|) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_In-1550322079| |P1Thread1of1ForFork1_#t~ite23_Out-1550322079|) (not .cse5) (= ~y$w_buff1_used~0_In-1550322079 |P1Thread1of1ForFork1_#t~ite24_Out-1550322079|))) (= |P1Thread1of1ForFork1_#t~ite22_In-1550322079| |P1Thread1of1ForFork1_#t~ite22_Out-1550322079|)) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (not .cse3) .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out-1550322079| |P1Thread1of1ForFork1_#t~ite23_Out-1550322079|) (= |P1Thread1of1ForFork1_#t~ite22_Out-1550322079| 0) .cse5 (or (not .cse1) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1550322079, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550322079, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1550322079, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1550322079|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1550322079|, ~weak$$choice2~0=~weak$$choice2~0_In-1550322079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1550322079} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1550322079, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550322079, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1550322079, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1550322079|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1550322079|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1550322079|, ~weak$$choice2~0=~weak$$choice2~0_In-1550322079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1550322079} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 20:19:21,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:19:21,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1325418889 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In-1325418889 256))))) (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1325418889|) .cse0 (not (= (mod ~y$w_buff0_used~0_In-1325418889 256) 0)) (or .cse1 (not (= 0 (mod ~y$w_buff1_used~0_In-1325418889 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out-1325418889| |P1Thread1of1ForFork1_#t~ite29_Out-1325418889|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1325418889| |P1Thread1of1ForFork1_#t~ite28_Out-1325418889|) (or .cse1 (not (= (mod ~y$r_buff1_thd2~0_In-1325418889 256) 0))))) (and (= ~y$r_buff1_thd2~0_In-1325418889 |P1Thread1of1ForFork1_#t~ite30_Out-1325418889|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1325418889| |P1Thread1of1ForFork1_#t~ite29_Out-1325418889|) (= |P1Thread1of1ForFork1_#t~ite28_In-1325418889| |P1Thread1of1ForFork1_#t~ite28_Out-1325418889|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1325418889, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1325418889|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325418889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1325418889, ~weak$$choice2~0=~weak$$choice2~0_In-1325418889, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1325418889|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1325418889} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1325418889, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1325418889|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1325418889|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325418889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1325418889, ~weak$$choice2~0=~weak$$choice2~0_In-1325418889, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1325418889|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1325418889} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:19:21,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:19:21,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1262905356 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1262905356 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1262905356| |P1Thread1of1ForFork1_#t~ite32_Out1262905356|))) (or (and (not .cse0) (= ~y$w_buff1~0_In1262905356 |P1Thread1of1ForFork1_#t~ite32_Out1262905356|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~y~0_In1262905356 |P1Thread1of1ForFork1_#t~ite32_Out1262905356|) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1262905356, ~y$w_buff1~0=~y$w_buff1~0_In1262905356, ~y~0=~y~0_In1262905356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1262905356} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1262905356, ~y$w_buff1~0=~y$w_buff1~0_In1262905356, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1262905356|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1262905356|, ~y~0=~y~0_In1262905356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1262905356} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 20:19:21,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1743426356 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1743426356 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1743426356 |P1Thread1of1ForFork1_#t~ite34_Out-1743426356|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1743426356| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743426356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743426356} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743426356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743426356, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1743426356|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:19:21,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1460868482 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1460868482 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1460868482 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1460868482 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1460868482|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1460868482 |P1Thread1of1ForFork1_#t~ite35_Out-1460868482|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1460868482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460868482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460868482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1460868482} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1460868482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460868482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460868482, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1460868482|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1460868482} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:19:21,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2000982036 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2000982036 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2000982036| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out2000982036| ~y$r_buff0_thd2~0_In2000982036)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2000982036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2000982036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2000982036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2000982036, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2000982036|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:19:21,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In68850999 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In68850999 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In68850999 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In68850999 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out68850999| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out68850999| ~y$r_buff1_thd2~0_In68850999)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In68850999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68850999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68850999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68850999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In68850999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68850999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68850999, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out68850999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68850999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:21,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:21,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:19:21,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In123416099 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In123416099 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out123416099| ~y$w_buff1~0_In123416099)) (and (= |ULTIMATE.start_main_#t~ite40_Out123416099| ~y~0_In123416099) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In123416099, ~y~0=~y~0_In123416099, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123416099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123416099} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out123416099|, ~y$w_buff1~0=~y$w_buff1~0_In123416099, ~y~0=~y~0_In123416099, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123416099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123416099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:19:21,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 20:19:21,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1662720629 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1662720629 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1662720629| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1662720629| ~y$w_buff0_used~0_In1662720629)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1662720629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1662720629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1662720629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1662720629, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1662720629|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:19:21,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In952551228 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In952551228 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In952551228 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In952551228 256)))) (or (and (= ~y$w_buff1_used~0_In952551228 |ULTIMATE.start_main_#t~ite43_Out952551228|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out952551228|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In952551228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In952551228, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In952551228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952551228} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In952551228, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In952551228, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out952551228|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In952551228, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952551228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:19:21,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-423001178 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-423001178 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-423001178 |ULTIMATE.start_main_#t~ite44_Out-423001178|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-423001178| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-423001178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-423001178} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-423001178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-423001178, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-423001178|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:19:21,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2007535792 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-2007535792 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2007535792 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-2007535792 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-2007535792| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-2007535792| ~y$r_buff1_thd0~0_In-2007535792)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007535792, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2007535792, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2007535792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007535792} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007535792, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2007535792, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2007535792, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2007535792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007535792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:19:21,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:19:21,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:19:21 BasicIcfg [2019-12-18 20:19:21,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:19:21,978 INFO L168 Benchmark]: Toolchain (without parser) took 11301.91 ms. Allocated memory was 137.9 MB in the beginning and 404.2 MB in the end (delta: 266.3 MB). Free memory was 100.0 MB in the beginning and 131.3 MB in the end (delta: -31.3 MB). Peak memory consumption was 235.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,978 INFO L168 Benchmark]: CDTParser took 1.62 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.70 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.28 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,981 INFO L168 Benchmark]: Boogie Preprocessor took 35.18 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,981 INFO L168 Benchmark]: RCFGBuilder took 806.26 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 106.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,982 INFO L168 Benchmark]: TraceAbstraction took 9563.77 ms. Allocated memory was 202.4 MB in the beginning and 404.2 MB in the end (delta: 201.9 MB). Free memory was 105.9 MB in the beginning and 131.3 MB in the end (delta: -25.4 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:21,989 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.70 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.28 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.18 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.26 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 106.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9563.77 ms. Allocated memory was 202.4 MB in the beginning and 404.2 MB in the end (delta: 201.9 MB). Free memory was 105.9 MB in the beginning and 131.3 MB in the end (delta: -25.4 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1174 SDslu, 2515 SDs, 0 SdLazy, 1504 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 40156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...