/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/mix054_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:48:46,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:48:46,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:48:46,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:48:46,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:48:46,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:48:46,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:48:46,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:48:46,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:48:46,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:48:46,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:48:46,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:48:46,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:48:46,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:48:46,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:48:46,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:48:46,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:48:46,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:48:46,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:48:46,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:48:46,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:48:46,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:48:46,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:48:46,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:48:46,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:48:46,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:48:46,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:48:46,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:48:46,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:48:46,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:48:46,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:48:46,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:48:46,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:48:46,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:48:46,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:48:46,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:48:46,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:48:46,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:48:46,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:48:46,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:48:46,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:48:46,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:48:46,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:48:46,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:48:46,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:48:46,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:48:46,423 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:48:46,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:48:46,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:48:46,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:48:46,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:48:46,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:48:46,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:48:46,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:48:46,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:48:46,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:48:46,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:48:46,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:48:46,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:46,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:48:46,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:48:46,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:48:46,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:48:46,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:48:46,427 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:48:46,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:48:46,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:48:46,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:48:46,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:48:46,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:48:46,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:48:46,730 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:48:46,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-18 21:48:46,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf85bed/699b7e6f76f04261afb8ebc9ac265eff/FLAGa34dd0b5a [2019-12-18 21:48:47,404 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:48:47,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-18 21:48:47,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf85bed/699b7e6f76f04261afb8ebc9ac265eff/FLAGa34dd0b5a [2019-12-18 21:48:47,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf85bed/699b7e6f76f04261afb8ebc9ac265eff [2019-12-18 21:48:47,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:48:47,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:48:47,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:47,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:48:47,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:48:47,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:47" (1/1) ... [2019-12-18 21:48:47,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:47, skipping insertion in model container [2019-12-18 21:48:47,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:47" (1/1) ... [2019-12-18 21:48:47,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:48:47,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:48:48,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:48,281 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:48:48,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:48,457 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:48:48,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48 WrapperNode [2019-12-18 21:48:48,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:48,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:48,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:48:48,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:48:48,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:48,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:48:48,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:48:48,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:48:48,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:48:48,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:48:48,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:48:48,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:48:48,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:48:48,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:48:48,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:48:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:48:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:48:48,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:48:48,636 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:48:49,339 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:48:49,340 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:48:49,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:49 BoogieIcfgContainer [2019-12-18 21:48:49,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:48:49,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:48:49,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:48:49,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:48:49,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:48:47" (1/3) ... [2019-12-18 21:48:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa00494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:49, skipping insertion in model container [2019-12-18 21:48:49,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (2/3) ... [2019-12-18 21:48:49,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa00494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:49, skipping insertion in model container [2019-12-18 21:48:49,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:49" (3/3) ... [2019-12-18 21:48:49,353 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-18 21:48:49,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:48:49,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:48:49,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:48:49,376 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:48:49,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,488 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,506 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:48:49,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:48:49,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:48:49,531 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:48:49,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:48:49,531 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:48:49,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:48:49,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:48:49,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:48:49,547 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 21:48:49,549 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:48:49,624 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:48:49,625 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:49,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:48:49,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:48:49,700 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:48:49,700 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:49,706 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:48:49,720 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:48:49,721 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:48:52,816 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 21:48:52,922 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 21:48:52,941 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-18 21:48:52,942 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 21:48:52,945 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-18 21:48:53,394 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-18 21:48:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-18 21:48:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:48:53,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:53,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:48:53,405 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-18 21:48:53,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:53,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818231118] [2019-12-18 21:48:53,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:53,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818231118] [2019-12-18 21:48:53,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:53,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:48:53,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467199164] [2019-12-18 21:48:53,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:53,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:53,643 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-18 21:48:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:53,948 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-18 21:48:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:53,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:48:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:54,050 INFO L225 Difference]: With dead ends: 8310 [2019-12-18 21:48:54,050 INFO L226 Difference]: Without dead ends: 7790 [2019-12-18 21:48:54,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-18 21:48:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-18 21:48:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-18 21:48:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-18 21:48:54,437 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-18 21:48:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:54,438 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-18 21:48:54,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-18 21:48:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:48:54,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:54,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:54,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-18 21:48:54,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:54,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711830432] [2019-12-18 21:48:54,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:54,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711830432] [2019-12-18 21:48:54,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:54,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87905858] [2019-12-18 21:48:54,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:54,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:54,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:54,584 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-18 21:48:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:55,095 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-18 21:48:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:55,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:48:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:55,196 INFO L225 Difference]: With dead ends: 12240 [2019-12-18 21:48:55,196 INFO L226 Difference]: Without dead ends: 12233 [2019-12-18 21:48:55,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-18 21:48:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-18 21:48:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-18 21:48:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-18 21:48:55,654 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-18 21:48:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:55,654 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-18 21:48:55,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-18 21:48:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:48:55,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:55,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:55,664 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-18 21:48:55,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:55,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070718743] [2019-12-18 21:48:55,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:55,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070718743] [2019-12-18 21:48:55,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:55,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:55,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478504872] [2019-12-18 21:48:55,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:48:55,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:48:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:55,832 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-18 21:48:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:56,332 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-18 21:48:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:48:56,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:48:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:56,393 INFO L225 Difference]: With dead ends: 15483 [2019-12-18 21:48:56,393 INFO L226 Difference]: Without dead ends: 15483 [2019-12-18 21:48:56,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:48:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-18 21:48:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-18 21:48:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-18 21:48:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-18 21:48:57,539 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-18 21:48:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:57,540 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-18 21:48:57,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:48:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-18 21:48:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:48:57,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:57,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:57,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-18 21:48:57,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:57,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995364702] [2019-12-18 21:48:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:57,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995364702] [2019-12-18 21:48:57,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:57,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:48:57,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831813335] [2019-12-18 21:48:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:57,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:57,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:57,622 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-18 21:48:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:57,672 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-18 21:48:57,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:57,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:48:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:57,709 INFO L225 Difference]: With dead ends: 12387 [2019-12-18 21:48:57,709 INFO L226 Difference]: Without dead ends: 12387 [2019-12-18 21:48:57,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-18 21:48:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-18 21:48:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-18 21:48:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-18 21:48:58,060 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-18 21:48:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:58,060 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-18 21:48:58,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-18 21:48:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:58,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:58,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:58,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-18 21:48:58,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:58,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792886718] [2019-12-18 21:48:58,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:58,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792886718] [2019-12-18 21:48:58,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:58,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:58,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681115955] [2019-12-18 21:48:58,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:58,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,122 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 3 states. [2019-12-18 21:48:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:58,341 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-18 21:48:58,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:58,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 21:48:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:58,369 INFO L225 Difference]: With dead ends: 20943 [2019-12-18 21:48:58,369 INFO L226 Difference]: Without dead ends: 11612 [2019-12-18 21:48:58,370 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 21:48:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-18 21:48:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-18 21:48:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-18 21:48:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-18 21:48:58,675 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-18 21:48:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:58,675 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-18 21:48:58,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-18 21:48:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:58,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:58,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:58,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-18 21:48:58,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:58,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000193981] [2019-12-18 21:48:58,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:58,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000193981] [2019-12-18 21:48:58,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:58,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:58,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946009570] [2019-12-18 21:48:58,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:58,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,784 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 3 states. [2019-12-18 21:48:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:58,844 INFO L93 Difference]: Finished difference Result 10925 states and 33164 transitions. [2019-12-18 21:48:58,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:58,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 21:48:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:58,870 INFO L225 Difference]: With dead ends: 10925 [2019-12-18 21:48:58,870 INFO L226 Difference]: Without dead ends: 10925 [2019-12-18 21:48:58,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10925 states. [2019-12-18 21:48:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10925 to 10917. [2019-12-18 21:48:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10917 states. [2019-12-18 21:48:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 33148 transitions. [2019-12-18 21:48:59,269 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 33148 transitions. Word has length 17 [2019-12-18 21:48:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,270 INFO L462 AbstractCegarLoop]: Abstraction has 10917 states and 33148 transitions. [2019-12-18 21:48:59,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 33148 transitions. [2019-12-18 21:48:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:59,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:59,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1842424808, now seen corresponding path program 1 times [2019-12-18 21:48:59,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154246039] [2019-12-18 21:48:59,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154246039] [2019-12-18 21:48:59,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:59,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959490] [2019-12-18 21:48:59,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:59,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:59,352 INFO L87 Difference]: Start difference. First operand 10917 states and 33148 transitions. Second operand 4 states. [2019-12-18 21:48:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:59,389 INFO L93 Difference]: Finished difference Result 1827 states and 4498 transitions. [2019-12-18 21:48:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:48:59,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 21:48:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:59,395 INFO L225 Difference]: With dead ends: 1827 [2019-12-18 21:48:59,395 INFO L226 Difference]: Without dead ends: 1295 [2019-12-18 21:48:59,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-12-18 21:48:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2019-12-18 21:48:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-18 21:48:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2824 transitions. [2019-12-18 21:48:59,421 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2824 transitions. Word has length 17 [2019-12-18 21:48:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,421 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2824 transitions. [2019-12-18 21:48:59,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2824 transitions. [2019-12-18 21:48:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:48:59,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,424 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 21:48:59,425 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-18 21:48:59,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030633018] [2019-12-18 21:48:59,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030633018] [2019-12-18 21:48:59,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:48:59,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223453764] [2019-12-18 21:48:59,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:48:59,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:48:59,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:48:59,533 INFO L87 Difference]: Start difference. First operand 1295 states and 2824 transitions. Second operand 6 states. [2019-12-18 21:48:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:59,730 INFO L93 Difference]: Finished difference Result 1351 states and 2894 transitions. [2019-12-18 21:48:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:48:59,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:48:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:59,733 INFO L225 Difference]: With dead ends: 1351 [2019-12-18 21:48:59,733 INFO L226 Difference]: Without dead ends: 1300 [2019-12-18 21:48:59,735 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 21:48:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-18 21:48:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1241. [2019-12-18 21:48:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-18 21:48:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2709 transitions. [2019-12-18 21:48:59,754 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2709 transitions. Word has length 25 [2019-12-18 21:48:59,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,754 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2709 transitions. [2019-12-18 21:48:59,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:48:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2709 transitions. [2019-12-18 21:48:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:48:59,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,756 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 21:48:59,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-18 21:48:59,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094558051] [2019-12-18 21:48:59,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094558051] [2019-12-18 21:48:59,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:48:59,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354060680] [2019-12-18 21:48:59,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:48:59,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:48:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:59,854 INFO L87 Difference]: Start difference. First operand 1241 states and 2709 transitions. Second operand 5 states. [2019-12-18 21:48:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:59,893 INFO L93 Difference]: Finished difference Result 662 states and 1418 transitions. [2019-12-18 21:48:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:59,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:48:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:59,895 INFO L225 Difference]: With dead ends: 662 [2019-12-18 21:48:59,895 INFO L226 Difference]: Without dead ends: 524 [2019-12-18 21:48:59,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:48:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-18 21:48:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-18 21:48:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-18 21:48:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1164 transitions. [2019-12-18 21:48:59,905 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1164 transitions. Word has length 28 [2019-12-18 21:48:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,908 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1164 transitions. [2019-12-18 21:48:59,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:48:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1164 transitions. [2019-12-18 21:48:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:48:59,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,913 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 21:48:59,914 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2101668284, now seen corresponding path program 1 times [2019-12-18 21:48:59,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333612363] [2019-12-18 21:48:59,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333612363] [2019-12-18 21:48:59,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:59,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14303119] [2019-12-18 21:48:59,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:59,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:59,974 INFO L87 Difference]: Start difference. First operand 524 states and 1164 transitions. Second operand 3 states. [2019-12-18 21:49:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,017 INFO L93 Difference]: Finished difference Result 776 states and 1668 transitions. [2019-12-18 21:49:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:00,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,019 INFO L225 Difference]: With dead ends: 776 [2019-12-18 21:49:00,019 INFO L226 Difference]: Without dead ends: 776 [2019-12-18 21:49:00,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-18 21:49:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 584. [2019-12-18 21:49:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-12-18 21:49:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1284 transitions. [2019-12-18 21:49:00,029 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1284 transitions. Word has length 52 [2019-12-18 21:49:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:00,030 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1284 transitions. [2019-12-18 21:49:00,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1284 transitions. [2019-12-18 21:49:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:00,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:00,032 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 21:49:00,032 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1679965585, now seen corresponding path program 1 times [2019-12-18 21:49:00,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:00,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511264322] [2019-12-18 21:49:00,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:00,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511264322] [2019-12-18 21:49:00,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:00,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:00,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169864300] [2019-12-18 21:49:00,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:00,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:00,128 INFO L87 Difference]: Start difference. First operand 584 states and 1284 transitions. Second operand 7 states. [2019-12-18 21:49:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,310 INFO L93 Difference]: Finished difference Result 1131 states and 2408 transitions. [2019-12-18 21:49:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:49:00,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:49:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,312 INFO L225 Difference]: With dead ends: 1131 [2019-12-18 21:49:00,312 INFO L226 Difference]: Without dead ends: 792 [2019-12-18 21:49:00,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 21:49:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-12-18 21:49:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 639. [2019-12-18 21:49:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-12-18 21:49:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1372 transitions. [2019-12-18 21:49:00,323 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1372 transitions. Word has length 52 [2019-12-18 21:49:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:00,323 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 1372 transitions. [2019-12-18 21:49:00,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1372 transitions. [2019-12-18 21:49:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:00,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:00,325 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 21:49:00,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1571745907, now seen corresponding path program 2 times [2019-12-18 21:49:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:00,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189536902] [2019-12-18 21:49:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:00,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189536902] [2019-12-18 21:49:00,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:00,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:49:00,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306105347] [2019-12-18 21:49:00,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:00,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:00,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:00,464 INFO L87 Difference]: Start difference. First operand 639 states and 1372 transitions. Second operand 7 states. [2019-12-18 21:49:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:01,197 INFO L93 Difference]: Finished difference Result 1146 states and 2372 transitions. [2019-12-18 21:49:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:49:01,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:49:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:01,200 INFO L225 Difference]: With dead ends: 1146 [2019-12-18 21:49:01,200 INFO L226 Difference]: Without dead ends: 1122 [2019-12-18 21:49:01,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:49:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-12-18 21:49:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 882. [2019-12-18 21:49:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-18 21:49:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1880 transitions. [2019-12-18 21:49:01,215 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1880 transitions. Word has length 52 [2019-12-18 21:49:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,216 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1880 transitions. [2019-12-18 21:49:01,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1880 transitions. [2019-12-18 21:49:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:01,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:01,219 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1052851771, now seen corresponding path program 3 times [2019-12-18 21:49:01,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933486066] [2019-12-18 21:49:01,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:01,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933486066] [2019-12-18 21:49:01,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:01,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:01,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762567463] [2019-12-18 21:49:01,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:01,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,293 INFO L87 Difference]: Start difference. First operand 882 states and 1880 transitions. Second operand 3 states. [2019-12-18 21:49:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:01,346 INFO L93 Difference]: Finished difference Result 1069 states and 2269 transitions. [2019-12-18 21:49:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:01,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:01,348 INFO L225 Difference]: With dead ends: 1069 [2019-12-18 21:49:01,348 INFO L226 Difference]: Without dead ends: 1069 [2019-12-18 21:49:01,348 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 21:49:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-12-18 21:49:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 847. [2019-12-18 21:49:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-18 21:49:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1826 transitions. [2019-12-18 21:49:01,363 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1826 transitions. Word has length 52 [2019-12-18 21:49:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,364 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1826 transitions. [2019-12-18 21:49:01,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1826 transitions. [2019-12-18 21:49:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:49:01,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,366 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 21:49:01,366 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-18 21:49:01,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757272272] [2019-12-18 21:49:01,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:01,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:49:01,470 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:49:01,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1441~0.base_22| 4) |v_#length_15|) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (= 0 v_~y$flush_delayed~0_13) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_22| 1)) (= v_~y$r_buff0_thd1~0_29 0) (= |v_ULTIMATE.start_main_~#t1441~0.offset_17| 0) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (= (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_22|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1441~0.base_22|) (= 0 |v_#NULL.base_3|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1441~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1441~0.base_22|) |v_ULTIMATE.start_main_~#t1441~0.offset_17| 0)) |v_#memory_int_13|) (= v_~y$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ~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_23|, 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_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_22|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, 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_7, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #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_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~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_~#t1441~0.offset, 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, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:49:01,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-18 21:49:01,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_Out-268886952 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-268886952 0)) (= ~x~0_Out-268886952 1) (= ~y$r_buff1_thd0~0_Out-268886952 ~y$r_buff0_thd0~0_In-268886952) (= ~y$r_buff0_thd1~0_In-268886952 ~y$r_buff1_thd1~0_Out-268886952) (= ~y$r_buff1_thd2~0_Out-268886952 ~y$r_buff0_thd2~0_In-268886952)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268886952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-268886952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-268886952, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-268886952} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-268886952, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-268886952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268886952, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-268886952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-268886952, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-268886952, ~x~0=~x~0_Out-268886952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-268886952} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:49:01,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1280045516 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1280045516 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1280045516|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1280045516| ~y$w_buff0_used~0_In1280045516) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1280045516, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1280045516} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1280045516|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280045516, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1280045516} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:49:01,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2067024687 256)))) (or (and .cse0 (= ~y$w_buff0~0_In2067024687 |P1Thread1of1ForFork1_#t~ite14_Out2067024687|) (= |P1Thread1of1ForFork1_#t~ite14_Out2067024687| |P1Thread1of1ForFork1_#t~ite15_Out2067024687|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2067024687 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2067024687 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2067024687 256)) (and (= (mod ~y$r_buff1_thd2~0_In2067024687 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite14_In2067024687| |P1Thread1of1ForFork1_#t~ite14_Out2067024687|) (not .cse0) (= ~y$w_buff0~0_In2067024687 |P1Thread1of1ForFork1_#t~ite15_Out2067024687|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2067024687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067024687, ~y$w_buff0~0=~y$w_buff0~0_In2067024687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2067024687, ~weak$$choice2~0=~weak$$choice2~0_In2067024687, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2067024687|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067024687} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2067024687, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067024687, ~y$w_buff0~0=~y$w_buff0~0_In2067024687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2067024687, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2067024687|, ~weak$$choice2~0=~weak$$choice2~0_In2067024687, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2067024687|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067024687} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:49:01,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-605784605 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-605784605| |P1Thread1of1ForFork1_#t~ite20_Out-605784605|) (= |P1Thread1of1ForFork1_#t~ite21_Out-605784605| ~y$w_buff0_used~0_In-605784605)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-605784605| |P1Thread1of1ForFork1_#t~ite20_Out-605784605|) (= ~y$w_buff0_used~0_In-605784605 |P1Thread1of1ForFork1_#t~ite20_Out-605784605|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-605784605 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-605784605 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-605784605 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-605784605 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-605784605, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-605784605, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-605784605|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-605784605, ~weak$$choice2~0=~weak$$choice2~0_In-605784605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-605784605} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-605784605, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-605784605, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-605784605|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-605784605, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-605784605|, ~weak$$choice2~0=~weak$$choice2~0_In-605784605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-605784605} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:49:01,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} 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 21:49:01,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1073828717 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1073828717| |P1Thread1of1ForFork1_#t~ite29_Out-1073828717|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1073828717| ~y$r_buff1_thd2~0_In-1073828717)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1073828717| ~y$r_buff1_thd2~0_In-1073828717) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1073828717 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1073828717 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1073828717 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1073828717 256) 0)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-1073828717| |P1Thread1of1ForFork1_#t~ite29_Out-1073828717|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1073828717, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1073828717|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073828717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1073828717, ~weak$$choice2~0=~weak$$choice2~0_In-1073828717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073828717} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1073828717, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1073828717|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1073828717|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073828717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1073828717, ~weak$$choice2~0=~weak$$choice2~0_In-1073828717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073828717} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:49:01,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} 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_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:49:01,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-476908470| |P1Thread1of1ForFork1_#t~ite33_Out-476908470|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-476908470 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-476908470 256) 0))) (or (and (= ~y~0_In-476908470 |P1Thread1of1ForFork1_#t~ite32_Out-476908470|) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-476908470| ~y$w_buff1~0_In-476908470) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476908470, ~y$w_buff1~0=~y$w_buff1~0_In-476908470, ~y~0=~y~0_In-476908470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476908470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-476908470, ~y$w_buff1~0=~y$w_buff1~0_In-476908470, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-476908470|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-476908470|, ~y~0=~y~0_In-476908470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476908470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 21:49:01,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1778012511 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1778012511 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1778012511 |P1Thread1of1ForFork1_#t~ite34_Out-1778012511|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1778012511|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1778012511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1778012511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1778012511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1778012511, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1778012511|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:49:01,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In470729568 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In470729568 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In470729568 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In470729568 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out470729568| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out470729568| ~y$w_buff1_used~0_In470729568)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In470729568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In470729568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In470729568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In470729568} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In470729568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In470729568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In470729568, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out470729568|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In470729568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:49:01,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1603638582 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1603638582 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1603638582| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1603638582| ~y$r_buff0_thd2~0_In-1603638582)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1603638582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1603638582} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1603638582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1603638582, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1603638582|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:49:01,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In169272057 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In169272057 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In169272057 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In169272057 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out169272057| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In169272057 |P1Thread1of1ForFork1_#t~ite37_Out169272057|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In169272057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In169272057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In169272057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In169272057} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In169272057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In169272057, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In169272057, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out169272057|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In169272057} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:49:01,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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 21:49:01,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1728843229 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1728843229 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1728843229 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1728843229 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1728843229| ~y$w_buff1_used~0_In-1728843229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1728843229|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728843229, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728843229, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728843229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728843229} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1728843229|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1728843229, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1728843229, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1728843229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1728843229} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:49:01,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In785828201 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In785828201 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out785828201) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out785828201 ~y$r_buff0_thd1~0_In785828201)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In785828201, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In785828201} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In785828201, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out785828201|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out785828201} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:49:01,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1302011030 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1302011030 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1302011030 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1302011030 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1302011030 |P0Thread1of1ForFork0_#t~ite8_Out1302011030|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1302011030|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1302011030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302011030, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1302011030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302011030} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1302011030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1302011030, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1302011030|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1302011030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1302011030} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:49:01,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, 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_8} 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 21:49:01,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:49:01,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1996273493| |ULTIMATE.start_main_#t~ite40_Out-1996273493|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1996273493 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1996273493 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out-1996273493| ~y~0_In-1996273493) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1996273493| ~y$w_buff1~0_In-1996273493) .cse0 (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1996273493, ~y~0=~y~0_In-1996273493, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1996273493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996273493} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1996273493|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1996273493|, ~y$w_buff1~0=~y$w_buff1~0_In-1996273493, ~y~0=~y~0_In-1996273493, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1996273493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996273493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:49:01,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-432816107 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-432816107 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-432816107| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-432816107| ~y$w_buff0_used~0_In-432816107) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-432816107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-432816107} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-432816107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-432816107, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-432816107|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:49:01,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In994813568 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In994813568 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In994813568 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In994813568 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out994813568|)) (and (= ~y$w_buff1_used~0_In994813568 |ULTIMATE.start_main_#t~ite43_Out994813568|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In994813568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In994813568, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In994813568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In994813568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In994813568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In994813568, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out994813568|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In994813568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In994813568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:49:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In42514601 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In42514601 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out42514601| ~y$r_buff0_thd0~0_In42514601) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out42514601| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In42514601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42514601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In42514601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42514601, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out42514601|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:49:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1182633065 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1182633065 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1182633065 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1182633065 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1182633065| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1182633065| ~y$r_buff1_thd0~0_In-1182633065)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1182633065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1182633065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1182633065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182633065} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1182633065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1182633065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1182633065, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1182633065|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182633065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:49:01,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 21:49:01,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:49:01 BasicIcfg [2019-12-18 21:49:01,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:49:01,576 INFO L168 Benchmark]: Toolchain (without parser) took 13907.36 ms. Allocated memory was 140.5 MB in the beginning and 630.7 MB in the end (delta: 490.2 MB). Free memory was 99.8 MB in the beginning and 367.1 MB in the end (delta: -267.3 MB). Peak memory consumption was 222.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,577 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 140.5 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.51 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 99.4 MB in the beginning and 156.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.36 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,581 INFO L168 Benchmark]: Boogie Preprocessor took 41.89 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,582 INFO L168 Benchmark]: RCFGBuilder took 776.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,583 INFO L168 Benchmark]: TraceAbstraction took 12229.74 ms. Allocated memory was 201.9 MB in the beginning and 630.7 MB in the end (delta: 428.9 MB). Free memory was 106.4 MB in the beginning and 367.1 MB in the end (delta: -260.7 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,591 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 140.5 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.51 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 99.4 MB in the beginning and 156.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.36 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.89 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.49 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12229.74 ms. Allocated memory was 201.9 MB in the beginning and 630.7 MB in the end (delta: 428.9 MB). Free memory was 106.4 MB in the beginning and 367.1 MB in the end (delta: -260.7 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] 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_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L757] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L736] 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) [L757] 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) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 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)) [L759] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_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))=0, x=2, 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] [L759] 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)) [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_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))=0, x=2, 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] [L761] 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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L769] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L769] 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) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 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 [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 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, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1455 SDtfs, 1384 SDslu, 2577 SDs, 0 SdLazy, 1390 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 5875 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 33495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...