/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:54:50,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:54:50,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:54:50,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:54:50,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:54:50,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:54:50,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:54:50,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:54:50,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:54:50,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:54:50,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:54:50,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:54:50,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:54:50,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:54:50,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:54:50,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:54:50,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:54:50,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:54:50,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:54:50,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:54:50,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:54:50,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:54:50,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:54:50,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:54:50,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:54:50,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:54:50,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:54:50,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:54:50,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:54:50,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:54:50,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:54:50,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:54:50,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:54:50,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:54:50,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:54:50,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:54:50,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:54:50,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:54:50,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:54:50,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:54:50,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:54:50,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:54:50,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:54:50,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:54:50,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:54:50,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:54:50,576 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:54:50,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:54:50,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:54:50,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:54:50,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:54:50,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:54:50,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:54:50,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:54:50,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:54:50,579 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:54:50,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:54:50,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:54:50,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:54:50,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:54:50,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:54:50,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:54:50,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:54:50,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:54:50,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:54:50,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:54:50,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:54:50,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:54:50,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:54:50,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:54:50,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:54:50,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:54:50,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:54:50,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:54:50,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:54:50,896 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:54:50,896 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:54:50,897 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_pso.opt.i [2019-12-18 14:54:50,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98595413d/06313a934fbe41ab999cb827b25ad3e3/FLAGeda5518b3 [2019-12-18 14:54:51,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:54:51,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_pso.opt.i [2019-12-18 14:54:51,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98595413d/06313a934fbe41ab999cb827b25ad3e3/FLAGeda5518b3 [2019-12-18 14:54:51,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98595413d/06313a934fbe41ab999cb827b25ad3e3 [2019-12-18 14:54:51,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:54:51,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:54:51,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:51,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:54:51,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:54:51,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:51" (1/1) ... [2019-12-18 14:54:51,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:51, skipping insertion in model container [2019-12-18 14:54:51,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:51" (1/1) ... [2019-12-18 14:54:51,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:54:51,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:54:52,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:52,441 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:54:52,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:52,583 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:54:52,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52 WrapperNode [2019-12-18 14:54:52,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:52,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:52,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:54:52,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:54:52,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:52,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:54:52,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:54:52,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:54:52,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (1/1) ... [2019-12-18 14:54:52,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:54:52,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:54:52,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:54:52,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:54:52,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (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 14:54:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:54:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:54:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:54:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:54:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:54:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:54:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:54:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:54:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:54:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:54:52,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:54:52,756 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 14:54:53,439 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:54:53,440 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:54:53,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:53 BoogieIcfgContainer [2019-12-18 14:54:53,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:54:53,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:54:53,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:54:53,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:54:53,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:54:51" (1/3) ... [2019-12-18 14:54:53,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f506396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:53, skipping insertion in model container [2019-12-18 14:54:53,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:52" (2/3) ... [2019-12-18 14:54:53,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f506396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:53, skipping insertion in model container [2019-12-18 14:54:53,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:53" (3/3) ... [2019-12-18 14:54:53,454 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.opt.i [2019-12-18 14:54:53,466 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:54:53,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:54:53,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:54:53,481 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:54:53,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:53,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:54:53,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:54:53,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:54:53,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:54:53,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:54:53,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:54:53,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:54:53,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:54:53,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:54:53,683 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:54:53,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:54:53,759 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:54:53,760 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:53,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 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/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:54:53,795 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:54:53,837 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:54:53,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:53,847 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 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/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:54:53,862 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 14:54:53,863 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:54:58,556 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:54:58,713 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 14:54:58,714 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 14:54:58,717 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 14:54:59,114 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 14:54:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 14:54:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:54:59,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:59,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:54:59,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 14:54:59,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:59,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715197238] [2019-12-18 14:54:59,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:59,327 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 14:54:59,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715197238] [2019-12-18 14:54:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:54:59,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871086385] [2019-12-18 14:54:59,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:59,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:59,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:59,352 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 14:54:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:59,599 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 14:54:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:59,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:54:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:59,695 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 14:54:59,696 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 14:54:59,697 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 14:54:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 14:55:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 14:55:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 14:55:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 14:55:00,176 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 14:55:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:00,176 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 14:55:00,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 14:55:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:55:00,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:00,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:00,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 14:55:00,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:00,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573199690] [2019-12-18 14:55:00,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:00,429 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 14:55:00,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573199690] [2019-12-18 14:55:00,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:00,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:00,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966201580] [2019-12-18 14:55:00,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:00,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:00,435 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 14:55:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:00,531 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-12-18 14:55:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:00,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:55:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:00,539 INFO L225 Difference]: With dead ends: 1760 [2019-12-18 14:55:00,539 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 14:55:00,544 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 14:55:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 14:55:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-12-18 14:55:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-18 14:55:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-12-18 14:55:00,589 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-12-18 14:55:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:00,589 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-12-18 14:55:00,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-12-18 14:55:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:55:00,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:00,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:00,596 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:00,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 14:55:00,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:00,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409544433] [2019-12-18 14:55:00,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:00,732 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 14:55:00,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409544433] [2019-12-18 14:55:00,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:00,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:00,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151236775] [2019-12-18 14:55:00,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:00,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:00,735 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-12-18 14:55:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:01,102 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-12-18 14:55:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:55:01,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:55:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:01,113 INFO L225 Difference]: With dead ends: 1855 [2019-12-18 14:55:01,114 INFO L226 Difference]: Without dead ends: 1854 [2019-12-18 14:55:01,114 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 14:55:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-12-18 14:55:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-12-18 14:55:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-18 14:55:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-18 14:55:01,160 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-12-18 14:55:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:01,161 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-18 14:55:01,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-18 14:55:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 14:55:01,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:01,165 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] [2019-12-18 14:55:01,165 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 14:55:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:01,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655456802] [2019-12-18 14:55:01,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:01,352 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 14:55:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655456802] [2019-12-18 14:55:01,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:01,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:01,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161744199] [2019-12-18 14:55:01,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:55:01,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:55:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:55:01,354 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-18 14:55:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:01,896 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-18 14:55:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:55:01,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 14:55:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:01,910 INFO L225 Difference]: With dead ends: 2337 [2019-12-18 14:55:01,910 INFO L226 Difference]: Without dead ends: 2285 [2019-12-18 14:55:01,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:55:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-18 14:55:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-18 14:55:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-18 14:55:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-18 14:55:01,960 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-18 14:55:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:01,962 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-18 14:55:01,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:55:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-18 14:55:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:55:01,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:01,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:01,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-18 14:55:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:01,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168104225] [2019-12-18 14:55:01,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:02,134 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 14:55:02,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168104225] [2019-12-18 14:55:02,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:02,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:55:02,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928911942] [2019-12-18 14:55:02,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:02,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:02,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:02,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:02,137 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 3 states. [2019-12-18 14:55:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:02,153 INFO L93 Difference]: Finished difference Result 1624 states and 3602 transitions. [2019-12-18 14:55:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:02,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 14:55:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:02,163 INFO L225 Difference]: With dead ends: 1624 [2019-12-18 14:55:02,163 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 14:55:02,163 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 14:55:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 14:55:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2019-12-18 14:55:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-12-18 14:55:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 3602 transitions. [2019-12-18 14:55:02,201 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 3602 transitions. Word has length 26 [2019-12-18 14:55:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:02,202 INFO L462 AbstractCegarLoop]: Abstraction has 1624 states and 3602 transitions. [2019-12-18 14:55:02,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 3602 transitions. [2019-12-18 14:55:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:55:02,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:02,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:02,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash -929253500, now seen corresponding path program 1 times [2019-12-18 14:55:02,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:02,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771842698] [2019-12-18 14:55:02,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:02,312 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 14:55:02,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771842698] [2019-12-18 14:55:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861407009] [2019-12-18 14:55:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:02,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:02,315 INFO L87 Difference]: Start difference. First operand 1624 states and 3602 transitions. Second operand 4 states. [2019-12-18 14:55:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:02,363 INFO L93 Difference]: Finished difference Result 2605 states and 5852 transitions. [2019-12-18 14:55:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:02,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 14:55:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:02,373 INFO L225 Difference]: With dead ends: 2605 [2019-12-18 14:55:02,374 INFO L226 Difference]: Without dead ends: 1149 [2019-12-18 14:55:02,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:55:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-12-18 14:55:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-12-18 14:55:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-18 14:55:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-18 14:55:02,410 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 27 [2019-12-18 14:55:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:02,411 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-18 14:55:02,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-18 14:55:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:55:02,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:02,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:02,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:02,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 2 times [2019-12-18 14:55:02,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:02,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494561460] [2019-12-18 14:55:02,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:02,511 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 14:55:02,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494561460] [2019-12-18 14:55:02,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:02,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:55:02,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823041241] [2019-12-18 14:55:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:02,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:02,514 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 5 states. [2019-12-18 14:55:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:03,062 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-18 14:55:03,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:55:03,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:55:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:03,081 INFO L225 Difference]: With dead ends: 1862 [2019-12-18 14:55:03,081 INFO L226 Difference]: Without dead ends: 1862 [2019-12-18 14:55:03,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:55:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-18 14:55:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-18 14:55:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-18 14:55:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-18 14:55:03,125 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-18 14:55:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:03,125 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-18 14:55:03,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-18 14:55:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:55:03,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:03,128 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 14:55:03,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-18 14:55:03,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:03,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498851578] [2019-12-18 14:55:03,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:03,197 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 14:55:03,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498851578] [2019-12-18 14:55:03,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:03,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:03,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194516475] [2019-12-18 14:55:03,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:03,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:03,200 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 5 states. [2019-12-18 14:55:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:03,243 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-18 14:55:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:55:03,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:55:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:03,246 INFO L225 Difference]: With dead ends: 974 [2019-12-18 14:55:03,247 INFO L226 Difference]: Without dead ends: 842 [2019-12-18 14:55:03,247 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 14:55:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-18 14:55:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-18 14:55:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-18 14:55:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-18 14:55:03,265 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-18 14:55:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:03,266 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-18 14:55:03,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-18 14:55:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:55:03,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:03,269 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] [2019-12-18 14:55:03,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:03,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-18 14:55:03,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:03,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089146471] [2019-12-18 14:55:03,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:03,376 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 14:55:03,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089146471] [2019-12-18 14:55:03,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:03,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:03,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755019139] [2019-12-18 14:55:03,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:03,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:03,379 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-18 14:55:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:03,572 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-18 14:55:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:55:03,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 14:55:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:03,576 INFO L225 Difference]: With dead ends: 1394 [2019-12-18 14:55:03,576 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 14:55:03,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 14:55:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-18 14:55:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-18 14:55:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-18 14:55:03,603 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-18 14:55:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:03,603 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-18 14:55:03,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-18 14:55:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:55:03,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:03,606 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] [2019-12-18 14:55:03,606 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-18 14:55:03,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:03,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176335865] [2019-12-18 14:55:03,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:03,698 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 14:55:03,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176335865] [2019-12-18 14:55:03,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:03,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:03,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373435514] [2019-12-18 14:55:03,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:03,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:03,702 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-18 14:55:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:03,756 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-18 14:55:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:03,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 14:55:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:03,760 INFO L225 Difference]: With dead ends: 1051 [2019-12-18 14:55:03,760 INFO L226 Difference]: Without dead ends: 1051 [2019-12-18 14:55:03,760 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 14:55:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-18 14:55:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-18 14:55:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-18 14:55:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-18 14:55:03,789 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-18 14:55:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:03,790 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-18 14:55:03,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-18 14:55:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:55:03,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:03,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:03,794 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-18 14:55:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401880645] [2019-12-18 14:55:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:03,996 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 14:55:03,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401880645] [2019-12-18 14:55:03,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:03,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:03,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153036403] [2019-12-18 14:55:03,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:03,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:03,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:03,998 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 3 states. [2019-12-18 14:55:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:04,012 INFO L93 Difference]: Finished difference Result 848 states and 1813 transitions. [2019-12-18 14:55:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:04,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 14:55:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:04,017 INFO L225 Difference]: With dead ends: 848 [2019-12-18 14:55:04,017 INFO L226 Difference]: Without dead ends: 848 [2019-12-18 14:55:04,018 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 14:55:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-18 14:55:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 754. [2019-12-18 14:55:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 14:55:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 14:55:04,036 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 14:55:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 14:55:04,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 14:55:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:55:04,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:04,040 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 14:55:04,041 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 14:55:04,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:04,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648076366] [2019-12-18 14:55:04,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:04,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:55:04,235 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:55:04,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2311~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2311~0.base_48|) |v_ULTIMATE.start_main_~#t2311~0.offset_31| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2311~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2311~0.base_48| 1) |v_#valid_73|) (= 0 v_~weak$$choice0~0_29) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2311~0.base_48|)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2311~0.base_48| 4)) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2311~0.base_48|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2311~0.base=|v_ULTIMATE.start_main_~#t2311~0.base_48|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, ULTIMATE.start_main_~#t2312~0.offset=|v_ULTIMATE.start_main_~#t2312~0.offset_31|, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2311~0.offset=|v_ULTIMATE.start_main_~#t2311~0.offset_31|, ULTIMATE.start_main_~#t2312~0.base=|v_ULTIMATE.start_main_~#t2312~0.base_49|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2311~0.base, ~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, ULTIMATE.start_main_~#t2312~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2311~0.offset, ULTIMATE.start_main_~#t2312~0.base, #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_#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 14:55:04,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2312~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2312~0.base_13|) (= |v_ULTIMATE.start_main_~#t2312~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2312~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2312~0.base_13|) |v_ULTIMATE.start_main_~#t2312~0.offset_11| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2312~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2312~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2312~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2312~0.offset=|v_ULTIMATE.start_main_~#t2312~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2312~0.base=|v_ULTIMATE.start_main_~#t2312~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2312~0.offset, #length, ULTIMATE.start_main_~#t2312~0.base] because there is no mapped edge [2019-12-18 14:55:04,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out-1231450436 1) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1231450436)) (= ~y$r_buff1_thd0~0_Out-1231450436 ~y$r_buff0_thd0~0_In-1231450436) (= ~y$r_buff1_thd2~0_Out-1231450436 ~y$r_buff0_thd2~0_In-1231450436) (= ~y$r_buff0_thd1~0_In-1231450436 ~y$r_buff1_thd1~0_Out-1231450436) (= ~x~0_Out-1231450436 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231450436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1231450436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1231450436, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1231450436} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1231450436, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1231450436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231450436, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1231450436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1231450436, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1231450436, ~x~0=~x~0_Out-1231450436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1231450436} 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 14:55:04,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1577833511 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1577833511 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1577833511 |P0Thread1of1ForFork0_#t~ite5_Out-1577833511|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1577833511| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577833511, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1577833511} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1577833511|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577833511, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1577833511} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:55:04,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2037850038 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2037850038 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-2037850038 256)) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2037850038 256))) (= (mod ~y$w_buff0_used~0_In-2037850038 256) 0))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2037850038| |P1Thread1of1ForFork1_#t~ite20_Out-2037850038|) .cse1 (= ~y$w_buff0_used~0_In-2037850038 |P1Thread1of1ForFork1_#t~ite20_Out-2037850038|)) (and (= ~y$w_buff0_used~0_In-2037850038 |P1Thread1of1ForFork1_#t~ite21_Out-2037850038|) (= |P1Thread1of1ForFork1_#t~ite20_In-2037850038| |P1Thread1of1ForFork1_#t~ite20_Out-2037850038|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037850038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037850038, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2037850038|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037850038, ~weak$$choice2~0=~weak$$choice2~0_In-2037850038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037850038} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037850038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037850038, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2037850038|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037850038, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2037850038|, ~weak$$choice2~0=~weak$$choice2~0_In-2037850038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037850038} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 14:55:04,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In506653520 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In506653520 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In506653520 256) 0)) (.cse4 (= 0 (mod ~weak$$choice2~0_In506653520 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out506653520| |P1Thread1of1ForFork1_#t~ite23_Out506653520|)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In506653520 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In506653520| |P1Thread1of1ForFork1_#t~ite22_Out506653520|) (or (and (= ~y$w_buff1_used~0_In506653520 |P1Thread1of1ForFork1_#t~ite23_Out506653520|) (or (and .cse0 .cse1) .cse2 (and .cse3 .cse1)) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_In506653520| |P1Thread1of1ForFork1_#t~ite23_Out506653520|) (= ~y$w_buff1_used~0_In506653520 |P1Thread1of1ForFork1_#t~ite24_Out506653520|) (not .cse4)))) (let ((.cse6 (not .cse1))) (and (not .cse2) (or .cse6 (not .cse3)) (or (not .cse0) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out506653520| 0) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out506653520| |P1Thread1of1ForFork1_#t~ite23_Out506653520|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In506653520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In506653520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506653520, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In506653520|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In506653520|, ~weak$$choice2~0=~weak$$choice2~0_In506653520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In506653520} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In506653520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In506653520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506653520, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out506653520|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out506653520|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out506653520|, ~weak$$choice2~0=~weak$$choice2~0_In506653520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In506653520} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 14:55:04,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1285999233 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1285999233 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1285999233 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1285999233 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1285999233| ~y$w_buff1_used~0_In-1285999233) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1285999233|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1285999233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285999233, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1285999233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285999233} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1285999233|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1285999233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285999233, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1285999233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285999233} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:55:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1860575950 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1860575950 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1860575950)) (and (= ~y$r_buff0_thd1~0_In1860575950 ~y$r_buff0_thd1~0_Out1860575950) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1860575950, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1860575950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1860575950, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1860575950|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1860575950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:55:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In-1360874274 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1360874274 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1360874274 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1360874274 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1360874274| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1360874274| ~y$r_buff1_thd1~0_In-1360874274) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1360874274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360874274, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1360874274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360874274} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1360874274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360874274, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1360874274|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1360874274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360874274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:55:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:55:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2050683290 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2050683290| |P1Thread1of1ForFork1_#t~ite30_Out-2050683290|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-2050683290| ~y$r_buff1_thd2~0_In-2050683290) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2050683290 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-2050683290 256) 0)) (= (mod ~y$w_buff0_used~0_In-2050683290 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-2050683290 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2050683290| |P1Thread1of1ForFork1_#t~ite29_Out-2050683290|) (= ~y$r_buff1_thd2~0_In-2050683290 |P1Thread1of1ForFork1_#t~ite30_Out-2050683290|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2050683290, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2050683290|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050683290, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2050683290, ~weak$$choice2~0=~weak$$choice2~0_In-2050683290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050683290} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2050683290, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2050683290|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2050683290|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050683290, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2050683290, ~weak$$choice2~0=~weak$$choice2~0_In-2050683290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050683290} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:55:04,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 14:55:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2124821985 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2124821985 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In2124821985 |P1Thread1of1ForFork1_#t~ite32_Out2124821985|)) (and (= ~y~0_In2124821985 |P1Thread1of1ForFork1_#t~ite32_Out2124821985|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2124821985, ~y$w_buff1~0=~y$w_buff1~0_In2124821985, ~y~0=~y~0_In2124821985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124821985} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2124821985, ~y$w_buff1~0=~y$w_buff1~0_In2124821985, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out2124821985|, ~y~0=~y~0_In2124821985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124821985} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:55:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 14:55:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1395166954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1395166954 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1395166954|)) (and (= ~y$w_buff0_used~0_In-1395166954 |P1Thread1of1ForFork1_#t~ite34_Out-1395166954|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1395166954} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1395166954, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1395166954|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:55:04,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In559021361 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In559021361 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In559021361 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In559021361 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out559021361| ~y$w_buff1_used~0_In559021361)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out559021361|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In559021361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In559021361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559021361} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In559021361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In559021361, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out559021361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559021361} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:55:04,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1909330722 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1909330722 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1909330722| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1909330722| ~y$r_buff0_thd2~0_In1909330722) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1909330722, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1909330722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1909330722, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1909330722, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1909330722|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:55:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1664959203 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1664959203 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1664959203 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1664959203 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1664959203|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1664959203 |P1Thread1of1ForFork1_#t~ite37_Out-1664959203|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1664959203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664959203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664959203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664959203} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1664959203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664959203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664959203, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1664959203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664959203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:55:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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 14:55:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 14:55:04,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:55:04,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-701113500 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-701113500 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-701113500| ~y$w_buff1~0_In-701113500) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-701113500| ~y~0_In-701113500)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-701113500, ~y~0=~y~0_In-701113500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-701113500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-701113500} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-701113500|, ~y$w_buff1~0=~y$w_buff1~0_In-701113500, ~y~0=~y~0_In-701113500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-701113500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-701113500} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:55:04,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 14:55:04,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1220971812 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1220971812 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1220971812| ~y$w_buff0_used~0_In-1220971812) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1220971812| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1220971812} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1220971812, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1220971812|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:55:04,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In297268182 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In297268182 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In297268182 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In297268182 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out297268182|)) (and (= ~y$w_buff1_used~0_In297268182 |ULTIMATE.start_main_#t~ite43_Out297268182|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In297268182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In297268182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In297268182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In297268182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In297268182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In297268182, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out297268182|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In297268182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In297268182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:55:04,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In221202062 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In221202062 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out221202062| 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In221202062 |ULTIMATE.start_main_#t~ite44_Out221202062|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In221202062, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In221202062} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In221202062, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In221202062, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out221202062|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:55:04,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1828594052 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1828594052 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1828594052 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1828594052 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1828594052| ~y$r_buff1_thd0~0_In1828594052)) (and (= |ULTIMATE.start_main_#t~ite45_Out1828594052| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1828594052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1828594052, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1828594052, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1828594052} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1828594052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1828594052, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1828594052, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1828594052|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1828594052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:55:04,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, 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 14:55:04,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:55:04 BasicIcfg [2019-12-18 14:55:04,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:55:04,354 INFO L168 Benchmark]: Toolchain (without parser) took 12560.12 ms. Allocated memory was 145.8 MB in the beginning and 404.2 MB in the end (delta: 258.5 MB). Free memory was 101.9 MB in the beginning and 247.3 MB in the end (delta: -145.4 MB). Peak memory consumption was 113.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,355 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.88 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,361 INFO L168 Benchmark]: Boogie Preprocessor took 39.47 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,362 INFO L168 Benchmark]: RCFGBuilder took 758.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 109.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,363 INFO L168 Benchmark]: TraceAbstraction took 10908.17 ms. Allocated memory was 203.4 MB in the beginning and 404.2 MB in the end (delta: 200.8 MB). Free memory was 108.5 MB in the beginning and 247.3 MB in the end (delta: -138.8 MB). Peak memory consumption was 62.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:04,372 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.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.88 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.47 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 109.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10908.17 ms. Allocated memory was 203.4 MB in the beginning and 404.2 MB in the end (delta: 200.8 MB). Free memory was 108.5 MB in the beginning and 247.3 MB in the end (delta: -138.8 MB). Peak memory consumption was 62.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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, __unbuffered_p1_EBX=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] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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) [L759] 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) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1217 SDtfs, 1361 SDslu, 2154 SDs, 0 SdLazy, 1061 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...