/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:08:55,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:08:55,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:08:55,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:08:55,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:08:55,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:08:55,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:08:55,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:08:55,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:08:55,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:08:55,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:08:55,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:08:55,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:08:55,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:08:55,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:08:55,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:08:55,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:08:55,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:08:55,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:08:55,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:08:55,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:08:55,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:08:55,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:08:55,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:08:55,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:08:55,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:08:55,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:08:55,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:08:55,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:08:55,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:08:55,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:08:55,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:08:55,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:08:55,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:08:55,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:08:55,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:08:55,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:08:55,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:08:55,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:08:55,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:08:55,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:08:55,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:08:55,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:08:55,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:08:55,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:08:55,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:08:55,576 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:08:55,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:08:55,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:08:55,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:08:55,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:08:55,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:08:55,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:08:55,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:08:55,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:08:55,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:08:55,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:08:55,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:08:55,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:08:55,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:08:55,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:08:55,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:08:55,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:08:55,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:08:55,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:08:55,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:08:55,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:08:55,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:08:55,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:08:55,581 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:08:55,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:08:55,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:08:55,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:08:55,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:08:55,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:08:55,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:08:55,871 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:08:55,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-18 22:08:55,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4c0080/cb0eb95a1b4e4aa2894ad11a348f2b21/FLAG419ffcf59 [2019-12-18 22:08:56,506 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:08:56,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-18 22:08:56,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4c0080/cb0eb95a1b4e4aa2894ad11a348f2b21/FLAG419ffcf59 [2019-12-18 22:08:56,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bf4c0080/cb0eb95a1b4e4aa2894ad11a348f2b21 [2019-12-18 22:08:56,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:08:56,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:08:56,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:56,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:08:56,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:08:56,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:56" (1/1) ... [2019-12-18 22:08:56,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637331f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:56, skipping insertion in model container [2019-12-18 22:08:56,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:56" (1/1) ... [2019-12-18 22:08:56,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:08:56,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:08:57,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:57,423 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:08:57,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:57,584 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:08:57,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57 WrapperNode [2019-12-18 22:08:57,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:57,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:57,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:08:57,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:08:57,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:57,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:08:57,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:08:57,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:08:57,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (1/1) ... [2019-12-18 22:08:57,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:08:57,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:08:57,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:08:57,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:08:57,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (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 22:08:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:08:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:08:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:08:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:08:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:08:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:08:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:08:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:08:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:08:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:08:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:08:57,760 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 22:08:58,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:08:58,530 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:08:58,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:58 BoogieIcfgContainer [2019-12-18 22:08:58,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:08:58,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:08:58,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:08:58,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:08:58,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:56" (1/3) ... [2019-12-18 22:08:58,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4341fa8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:58, skipping insertion in model container [2019-12-18 22:08:58,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:57" (2/3) ... [2019-12-18 22:08:58,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4341fa8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:58, skipping insertion in model container [2019-12-18 22:08:58,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:58" (3/3) ... [2019-12-18 22:08:58,541 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-18 22:08:58,552 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:08:58,552 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:08:58,561 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:08:58,562 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:08:58,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,650 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,650 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,650 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,650 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,689 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:58,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:08:58,729 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:08:58,729 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:08:58,729 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:08:58,729 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:08:58,729 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:08:58,729 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:08:58,730 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:08:58,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:08:58,747 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-18 22:08:58,748 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 22:08:58,841 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 22:08:58,841 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:58,864 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 22:08:58,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 22:08:58,951 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 22:08:58,952 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:58,962 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 22:08:58,987 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 22:08:58,988 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:09:02,035 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:09:02,376 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:09:02,507 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:09:02,551 INFO L206 etLargeBlockEncoding]: Checked pairs total: 149863 [2019-12-18 22:09:02,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:09:02,555 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 133 transitions [2019-12-18 22:09:04,200 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27271 states. [2019-12-18 22:09:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states. [2019-12-18 22:09:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:09:04,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:04,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:09:04,210 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash 955890454, now seen corresponding path program 1 times [2019-12-18 22:09:04,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:04,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935387685] [2019-12-18 22:09:04,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:04,551 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 22:09:04,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935387685] [2019-12-18 22:09:04,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:04,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:04,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201826303] [2019-12-18 22:09:04,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:04,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:04,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:04,580 INFO L87 Difference]: Start difference. First operand 27271 states. Second operand 3 states. [2019-12-18 22:09:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:05,793 INFO L93 Difference]: Finished difference Result 26946 states and 96635 transitions. [2019-12-18 22:09:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:05,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:09:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:06,034 INFO L225 Difference]: With dead ends: 26946 [2019-12-18 22:09:06,036 INFO L226 Difference]: Without dead ends: 25207 [2019-12-18 22:09:06,038 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 22:09:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-18 22:09:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 25207. [2019-12-18 22:09:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25207 states. [2019-12-18 22:09:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25207 states to 25207 states and 90336 transitions. [2019-12-18 22:09:07,682 INFO L78 Accepts]: Start accepts. Automaton has 25207 states and 90336 transitions. Word has length 5 [2019-12-18 22:09:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:07,683 INFO L462 AbstractCegarLoop]: Abstraction has 25207 states and 90336 transitions. [2019-12-18 22:09:07,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25207 states and 90336 transitions. [2019-12-18 22:09:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:09:07,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:07,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:07,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1479335670, now seen corresponding path program 1 times [2019-12-18 22:09:07,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:07,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690506161] [2019-12-18 22:09:07,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:07,828 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 22:09:07,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690506161] [2019-12-18 22:09:07,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:07,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:07,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842858470] [2019-12-18 22:09:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:07,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:07,832 INFO L87 Difference]: Start difference. First operand 25207 states and 90336 transitions. Second operand 4 states. [2019-12-18 22:09:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:08,441 INFO L93 Difference]: Finished difference Result 38966 states and 133479 transitions. [2019-12-18 22:09:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:08,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:09:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:08,592 INFO L225 Difference]: With dead ends: 38966 [2019-12-18 22:09:08,592 INFO L226 Difference]: Without dead ends: 38948 [2019-12-18 22:09:08,593 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 22:09:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-18 22:09:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 37967. [2019-12-18 22:09:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37967 states. [2019-12-18 22:09:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37967 states to 37967 states and 130916 transitions. [2019-12-18 22:09:11,372 INFO L78 Accepts]: Start accepts. Automaton has 37967 states and 130916 transitions. Word has length 11 [2019-12-18 22:09:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:11,372 INFO L462 AbstractCegarLoop]: Abstraction has 37967 states and 130916 transitions. [2019-12-18 22:09:11,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37967 states and 130916 transitions. [2019-12-18 22:09:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:09:11,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:11,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:11,376 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1793441041, now seen corresponding path program 1 times [2019-12-18 22:09:11,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:11,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25429580] [2019-12-18 22:09:11,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:11,433 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 22:09:11,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25429580] [2019-12-18 22:09:11,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:11,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:11,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36089494] [2019-12-18 22:09:11,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:11,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:11,436 INFO L87 Difference]: Start difference. First operand 37967 states and 130916 transitions. Second operand 4 states. [2019-12-18 22:09:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:13,247 INFO L93 Difference]: Finished difference Result 48754 states and 165257 transitions. [2019-12-18 22:09:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:13,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:09:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:13,429 INFO L225 Difference]: With dead ends: 48754 [2019-12-18 22:09:13,429 INFO L226 Difference]: Without dead ends: 48739 [2019-12-18 22:09:13,429 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 22:09:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-18 22:09:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 43861. [2019-12-18 22:09:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43861 states. [2019-12-18 22:09:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 150189 transitions. [2019-12-18 22:09:14,863 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 150189 transitions. Word has length 14 [2019-12-18 22:09:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:14,864 INFO L462 AbstractCegarLoop]: Abstraction has 43861 states and 150189 transitions. [2019-12-18 22:09:14,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 150189 transitions. [2019-12-18 22:09:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 22:09:14,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:14,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:14,869 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 237931436, now seen corresponding path program 1 times [2019-12-18 22:09:14,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:14,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773417837] [2019-12-18 22:09:14,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:14,936 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 22:09:14,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773417837] [2019-12-18 22:09:14,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:14,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:14,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277323666] [2019-12-18 22:09:14,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:14,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:14,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:14,941 INFO L87 Difference]: Start difference. First operand 43861 states and 150189 transitions. Second operand 3 states. [2019-12-18 22:09:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:15,580 INFO L93 Difference]: Finished difference Result 71282 states and 233582 transitions. [2019-12-18 22:09:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:15,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 22:09:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:15,714 INFO L225 Difference]: With dead ends: 71282 [2019-12-18 22:09:15,714 INFO L226 Difference]: Without dead ends: 71282 [2019-12-18 22:09:15,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71282 states. [2019-12-18 22:09:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71282 to 63620. [2019-12-18 22:09:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63620 states. [2019-12-18 22:09:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63620 states to 63620 states and 211773 transitions. [2019-12-18 22:09:19,890 INFO L78 Accepts]: Start accepts. Automaton has 63620 states and 211773 transitions. Word has length 15 [2019-12-18 22:09:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:19,890 INFO L462 AbstractCegarLoop]: Abstraction has 63620 states and 211773 transitions. [2019-12-18 22:09:19,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63620 states and 211773 transitions. [2019-12-18 22:09:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:09:19,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:19,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:19,895 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:19,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1616735725, now seen corresponding path program 1 times [2019-12-18 22:09:19,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:19,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910183740] [2019-12-18 22:09:19,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:19,935 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 22:09:19,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910183740] [2019-12-18 22:09:19,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:19,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:19,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745244068] [2019-12-18 22:09:19,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:19,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:19,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:19,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:19,938 INFO L87 Difference]: Start difference. First operand 63620 states and 211773 transitions. Second operand 3 states. [2019-12-18 22:09:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:20,181 INFO L93 Difference]: Finished difference Result 63517 states and 211446 transitions. [2019-12-18 22:09:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:20,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:09:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:20,307 INFO L225 Difference]: With dead ends: 63517 [2019-12-18 22:09:20,308 INFO L226 Difference]: Without dead ends: 63517 [2019-12-18 22:09:20,308 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 22:09:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63517 states. [2019-12-18 22:09:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63517 to 63517. [2019-12-18 22:09:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63517 states. [2019-12-18 22:09:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63517 states to 63517 states and 211446 transitions. [2019-12-18 22:09:24,318 INFO L78 Accepts]: Start accepts. Automaton has 63517 states and 211446 transitions. Word has length 16 [2019-12-18 22:09:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:24,319 INFO L462 AbstractCegarLoop]: Abstraction has 63517 states and 211446 transitions. [2019-12-18 22:09:24,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63517 states and 211446 transitions. [2019-12-18 22:09:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:09:24,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:24,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:24,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1032158122, now seen corresponding path program 1 times [2019-12-18 22:09:24,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:24,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594780886] [2019-12-18 22:09:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:24,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 22:09:24,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594780886] [2019-12-18 22:09:24,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:24,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:24,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520157798] [2019-12-18 22:09:24,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:24,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:24,379 INFO L87 Difference]: Start difference. First operand 63517 states and 211446 transitions. Second operand 4 states. [2019-12-18 22:09:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:24,986 INFO L93 Difference]: Finished difference Result 77880 states and 255480 transitions. [2019-12-18 22:09:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:24,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:09:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:25,140 INFO L225 Difference]: With dead ends: 77880 [2019-12-18 22:09:25,141 INFO L226 Difference]: Without dead ends: 77863 [2019-12-18 22:09:25,141 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 22:09:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77863 states. [2019-12-18 22:09:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77863 to 64071. [2019-12-18 22:09:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64071 states. [2019-12-18 22:09:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64071 states to 64071 states and 213322 transitions. [2019-12-18 22:09:27,644 INFO L78 Accepts]: Start accepts. Automaton has 64071 states and 213322 transitions. Word has length 17 [2019-12-18 22:09:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:27,644 INFO L462 AbstractCegarLoop]: Abstraction has 64071 states and 213322 transitions. [2019-12-18 22:09:27,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 64071 states and 213322 transitions. [2019-12-18 22:09:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:09:27,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:27,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:27,652 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash 274413131, now seen corresponding path program 1 times [2019-12-18 22:09:27,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:27,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598506450] [2019-12-18 22:09:27,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:27,719 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 22:09:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598506450] [2019-12-18 22:09:27,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:27,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:27,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27543319] [2019-12-18 22:09:27,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:27,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:27,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:27,722 INFO L87 Difference]: Start difference. First operand 64071 states and 213322 transitions. Second operand 3 states. [2019-12-18 22:09:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:27,953 INFO L93 Difference]: Finished difference Result 60500 states and 201181 transitions. [2019-12-18 22:09:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:27,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:09:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:28,062 INFO L225 Difference]: With dead ends: 60500 [2019-12-18 22:09:28,062 INFO L226 Difference]: Without dead ends: 60374 [2019-12-18 22:09:28,062 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 22:09:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-18 22:09:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 60374. [2019-12-18 22:09:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60374 states. [2019-12-18 22:09:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60374 states to 60374 states and 200794 transitions. [2019-12-18 22:09:31,334 INFO L78 Accepts]: Start accepts. Automaton has 60374 states and 200794 transitions. Word has length 17 [2019-12-18 22:09:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:31,334 INFO L462 AbstractCegarLoop]: Abstraction has 60374 states and 200794 transitions. [2019-12-18 22:09:31,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60374 states and 200794 transitions. [2019-12-18 22:09:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 22:09:31,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:31,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:31,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 363158557, now seen corresponding path program 1 times [2019-12-18 22:09:31,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:31,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813987697] [2019-12-18 22:09:31,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:31,420 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 22:09:31,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813987697] [2019-12-18 22:09:31,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:31,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:31,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077520950] [2019-12-18 22:09:31,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:31,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:31,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:31,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:31,424 INFO L87 Difference]: Start difference. First operand 60374 states and 200794 transitions. Second operand 5 states. [2019-12-18 22:09:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:32,386 INFO L93 Difference]: Finished difference Result 84981 states and 275357 transitions. [2019-12-18 22:09:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:09:32,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 22:09:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:32,555 INFO L225 Difference]: With dead ends: 84981 [2019-12-18 22:09:32,555 INFO L226 Difference]: Without dead ends: 84967 [2019-12-18 22:09:32,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84967 states. [2019-12-18 22:09:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84967 to 65930. [2019-12-18 22:09:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65930 states. [2019-12-18 22:09:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65930 states to 65930 states and 218108 transitions. [2019-12-18 22:09:37,983 INFO L78 Accepts]: Start accepts. Automaton has 65930 states and 218108 transitions. Word has length 20 [2019-12-18 22:09:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:37,983 INFO L462 AbstractCegarLoop]: Abstraction has 65930 states and 218108 transitions. [2019-12-18 22:09:37,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 65930 states and 218108 transitions. [2019-12-18 22:09:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 22:09:38,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:38,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:38,001 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1131596126, now seen corresponding path program 1 times [2019-12-18 22:09:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:38,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682464587] [2019-12-18 22:09:38,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:38,076 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 22:09:38,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682464587] [2019-12-18 22:09:38,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:38,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:38,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185361819] [2019-12-18 22:09:38,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:38,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:38,078 INFO L87 Difference]: Start difference. First operand 65930 states and 218108 transitions. Second operand 5 states. [2019-12-18 22:09:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:39,128 INFO L93 Difference]: Finished difference Result 89060 states and 288103 transitions. [2019-12-18 22:09:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:09:39,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 22:09:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:39,370 INFO L225 Difference]: With dead ends: 89060 [2019-12-18 22:09:39,371 INFO L226 Difference]: Without dead ends: 89032 [2019-12-18 22:09:39,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89032 states. [2019-12-18 22:09:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89032 to 61456. [2019-12-18 22:09:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61456 states. [2019-12-18 22:09:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61456 states to 61456 states and 203832 transitions. [2019-12-18 22:09:41,327 INFO L78 Accepts]: Start accepts. Automaton has 61456 states and 203832 transitions. Word has length 23 [2019-12-18 22:09:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:41,329 INFO L462 AbstractCegarLoop]: Abstraction has 61456 states and 203832 transitions. [2019-12-18 22:09:41,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 61456 states and 203832 transitions. [2019-12-18 22:09:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 22:09:41,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:41,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:41,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash -936804425, now seen corresponding path program 1 times [2019-12-18 22:09:41,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:41,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411944722] [2019-12-18 22:09:41,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:41,453 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 22:09:41,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411944722] [2019-12-18 22:09:41,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:41,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:41,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829993697] [2019-12-18 22:09:41,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:41,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:41,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:41,456 INFO L87 Difference]: Start difference. First operand 61456 states and 203832 transitions. Second operand 3 states. [2019-12-18 22:09:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:41,676 INFO L93 Difference]: Finished difference Result 57816 states and 188658 transitions. [2019-12-18 22:09:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:41,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 22:09:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:41,779 INFO L225 Difference]: With dead ends: 57816 [2019-12-18 22:09:41,780 INFO L226 Difference]: Without dead ends: 57816 [2019-12-18 22:09:41,780 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 22:09:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57816 states. [2019-12-18 22:09:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57816 to 57580. [2019-12-18 22:09:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57580 states. [2019-12-18 22:09:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57580 states to 57580 states and 187992 transitions. [2019-12-18 22:09:43,472 INFO L78 Accepts]: Start accepts. Automaton has 57580 states and 187992 transitions. Word has length 31 [2019-12-18 22:09:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:43,472 INFO L462 AbstractCegarLoop]: Abstraction has 57580 states and 187992 transitions. [2019-12-18 22:09:43,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 57580 states and 187992 transitions. [2019-12-18 22:09:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:09:43,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:43,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:43,518 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1732188204, now seen corresponding path program 1 times [2019-12-18 22:09:43,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:43,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064001764] [2019-12-18 22:09:43,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:43,664 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 22:09:43,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064001764] [2019-12-18 22:09:43,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:43,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:09:43,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782137225] [2019-12-18 22:09:43,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:09:43,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:09:43,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:09:43,666 INFO L87 Difference]: Start difference. First operand 57580 states and 187992 transitions. Second operand 7 states. [2019-12-18 22:09:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:44,642 INFO L93 Difference]: Finished difference Result 130882 states and 426538 transitions. [2019-12-18 22:09:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:09:44,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 22:09:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:44,853 INFO L225 Difference]: With dead ends: 130882 [2019-12-18 22:09:44,853 INFO L226 Difference]: Without dead ends: 107042 [2019-12-18 22:09:44,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:09:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107042 states. [2019-12-18 22:09:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107042 to 93446. [2019-12-18 22:09:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93446 states. [2019-12-18 22:09:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93446 states to 93446 states and 307728 transitions. [2019-12-18 22:09:48,287 INFO L78 Accepts]: Start accepts. Automaton has 93446 states and 307728 transitions. Word has length 32 [2019-12-18 22:09:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:48,287 INFO L462 AbstractCegarLoop]: Abstraction has 93446 states and 307728 transitions. [2019-12-18 22:09:48,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:09:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 93446 states and 307728 transitions. [2019-12-18 22:09:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:09:48,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:48,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:48,385 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash 597590804, now seen corresponding path program 2 times [2019-12-18 22:09:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:48,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885573501] [2019-12-18 22:09:48,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:48,486 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 22:09:48,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885573501] [2019-12-18 22:09:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:09:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886244474] [2019-12-18 22:09:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:09:48,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:09:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:09:48,490 INFO L87 Difference]: Start difference. First operand 93446 states and 307728 transitions. Second operand 7 states. [2019-12-18 22:09:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:50,071 INFO L93 Difference]: Finished difference Result 166163 states and 550261 transitions. [2019-12-18 22:09:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:09:50,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 22:09:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:50,385 INFO L225 Difference]: With dead ends: 166163 [2019-12-18 22:09:50,385 INFO L226 Difference]: Without dead ends: 158223 [2019-12-18 22:09:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:09:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158223 states. [2019-12-18 22:09:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158223 to 93476. [2019-12-18 22:09:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93476 states. [2019-12-18 22:09:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93476 states to 93476 states and 307847 transitions. [2019-12-18 22:09:57,132 INFO L78 Accepts]: Start accepts. Automaton has 93476 states and 307847 transitions. Word has length 32 [2019-12-18 22:09:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:57,133 INFO L462 AbstractCegarLoop]: Abstraction has 93476 states and 307847 transitions. [2019-12-18 22:09:57,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:09:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 93476 states and 307847 transitions. [2019-12-18 22:09:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:09:57,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:57,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:57,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1306987540, now seen corresponding path program 3 times [2019-12-18 22:09:57,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:57,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729384443] [2019-12-18 22:09:57,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:57,383 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 22:09:57,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729384443] [2019-12-18 22:09:57,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:57,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:09:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234107724] [2019-12-18 22:09:57,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:09:57,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:09:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:09:57,386 INFO L87 Difference]: Start difference. First operand 93476 states and 307847 transitions. Second operand 10 states. [2019-12-18 22:09:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:58,819 INFO L93 Difference]: Finished difference Result 147466 states and 485559 transitions. [2019-12-18 22:09:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:09:58,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-18 22:09:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:59,109 INFO L225 Difference]: With dead ends: 147466 [2019-12-18 22:09:59,110 INFO L226 Difference]: Without dead ends: 140266 [2019-12-18 22:09:59,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:09:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140266 states. [2019-12-18 22:10:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140266 to 94193. [2019-12-18 22:10:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94193 states. [2019-12-18 22:10:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94193 states to 94193 states and 310106 transitions. [2019-12-18 22:10:02,288 INFO L78 Accepts]: Start accepts. Automaton has 94193 states and 310106 transitions. Word has length 32 [2019-12-18 22:10:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:02,288 INFO L462 AbstractCegarLoop]: Abstraction has 94193 states and 310106 transitions. [2019-12-18 22:10:02,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:10:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 94193 states and 310106 transitions. [2019-12-18 22:10:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:10:02,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:02,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:02,377 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash -790939130, now seen corresponding path program 4 times [2019-12-18 22:10:02,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:02,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837484312] [2019-12-18 22:10:02,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:02,449 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 22:10:02,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837484312] [2019-12-18 22:10:02,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:02,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:10:02,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610059275] [2019-12-18 22:10:02,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:10:02,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:10:02,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:10:02,452 INFO L87 Difference]: Start difference. First operand 94193 states and 310106 transitions. Second operand 7 states. [2019-12-18 22:10:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:04,857 INFO L93 Difference]: Finished difference Result 151275 states and 500126 transitions. [2019-12-18 22:10:04,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:10:04,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 22:10:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:05,164 INFO L225 Difference]: With dead ends: 151275 [2019-12-18 22:10:05,165 INFO L226 Difference]: Without dead ends: 144255 [2019-12-18 22:10:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:10:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144255 states. [2019-12-18 22:10:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144255 to 93887. [2019-12-18 22:10:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93887 states. [2019-12-18 22:10:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93887 states to 93887 states and 309033 transitions. [2019-12-18 22:10:08,700 INFO L78 Accepts]: Start accepts. Automaton has 93887 states and 309033 transitions. Word has length 32 [2019-12-18 22:10:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:08,700 INFO L462 AbstractCegarLoop]: Abstraction has 93887 states and 309033 transitions. [2019-12-18 22:10:08,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:10:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 93887 states and 309033 transitions. [2019-12-18 22:10:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 22:10:08,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:08,790 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] [2019-12-18 22:10:08,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 4490691, now seen corresponding path program 1 times [2019-12-18 22:10:08,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:08,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548476090] [2019-12-18 22:10:08,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:08,850 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 22:10:08,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548476090] [2019-12-18 22:10:08,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:08,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:10:08,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744844880] [2019-12-18 22:10:08,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:10:08,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:10:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:10:08,852 INFO L87 Difference]: Start difference. First operand 93887 states and 309033 transitions. Second operand 4 states. [2019-12-18 22:10:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:08,931 INFO L93 Difference]: Finished difference Result 13178 states and 36455 transitions. [2019-12-18 22:10:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:10:08,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 22:10:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:08,942 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 22:10:08,942 INFO L226 Difference]: Without dead ends: 7848 [2019-12-18 22:10:08,943 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 22:10:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2019-12-18 22:10:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7609. [2019-12-18 22:10:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7609 states. [2019-12-18 22:10:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7609 states to 7609 states and 18012 transitions. [2019-12-18 22:10:11,182 INFO L78 Accepts]: Start accepts. Automaton has 7609 states and 18012 transitions. Word has length 33 [2019-12-18 22:10:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:11,182 INFO L462 AbstractCegarLoop]: Abstraction has 7609 states and 18012 transitions. [2019-12-18 22:10:11,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:10:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7609 states and 18012 transitions. [2019-12-18 22:10:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 22:10:11,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:11,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:11,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2021850497, now seen corresponding path program 1 times [2019-12-18 22:10:11,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:11,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024607015] [2019-12-18 22:10:11,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:11,288 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 22:10:11,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024607015] [2019-12-18 22:10:11,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:11,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:10:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313093054] [2019-12-18 22:10:11,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:10:11,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:10:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:10:11,290 INFO L87 Difference]: Start difference. First operand 7609 states and 18012 transitions. Second operand 4 states. [2019-12-18 22:10:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:11,330 INFO L93 Difference]: Finished difference Result 8621 states and 20290 transitions. [2019-12-18 22:10:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:10:11,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 22:10:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:11,338 INFO L225 Difference]: With dead ends: 8621 [2019-12-18 22:10:11,338 INFO L226 Difference]: Without dead ends: 6818 [2019-12-18 22:10:11,338 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 22:10:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2019-12-18 22:10:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6798. [2019-12-18 22:10:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2019-12-18 22:10:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 16073 transitions. [2019-12-18 22:10:11,412 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 16073 transitions. Word has length 44 [2019-12-18 22:10:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:11,413 INFO L462 AbstractCegarLoop]: Abstraction has 6798 states and 16073 transitions. [2019-12-18 22:10:11,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:10:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 16073 transitions. [2019-12-18 22:10:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 22:10:11,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:11,418 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] [2019-12-18 22:10:11,419 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1006962917, now seen corresponding path program 2 times [2019-12-18 22:10:11,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:11,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798796578] [2019-12-18 22:10:11,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:11,509 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 22:10:11,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798796578] [2019-12-18 22:10:11,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:11,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:10:11,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375260629] [2019-12-18 22:10:11,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:10:11,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:11,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:10:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:10:11,511 INFO L87 Difference]: Start difference. First operand 6798 states and 16073 transitions. Second operand 5 states. [2019-12-18 22:10:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:11,555 INFO L93 Difference]: Finished difference Result 4999 states and 12006 transitions. [2019-12-18 22:10:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:10:11,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 22:10:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:11,556 INFO L225 Difference]: With dead ends: 4999 [2019-12-18 22:10:11,556 INFO L226 Difference]: Without dead ends: 529 [2019-12-18 22:10:11,556 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 22:10:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-18 22:10:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-18 22:10:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 22:10:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1146 transitions. [2019-12-18 22:10:11,563 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1146 transitions. Word has length 44 [2019-12-18 22:10:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:11,563 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1146 transitions. [2019-12-18 22:10:11,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:10:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1146 transitions. [2019-12-18 22:10:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 22:10:11,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:11,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:11,565 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -234128232, now seen corresponding path program 1 times [2019-12-18 22:10:11,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:11,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339100355] [2019-12-18 22:10:11,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:11,668 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 22:10:11,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339100355] [2019-12-18 22:10:11,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:11,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:10:11,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817348446] [2019-12-18 22:10:11,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:10:11,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:11,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:10:11,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:10:11,674 INFO L87 Difference]: Start difference. First operand 529 states and 1146 transitions. Second operand 8 states. [2019-12-18 22:10:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:11,901 INFO L93 Difference]: Finished difference Result 1082 states and 2315 transitions. [2019-12-18 22:10:11,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:10:11,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-18 22:10:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:11,903 INFO L225 Difference]: With dead ends: 1082 [2019-12-18 22:10:11,903 INFO L226 Difference]: Without dead ends: 759 [2019-12-18 22:10:11,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:10:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-18 22:10:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 605. [2019-12-18 22:10:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 22:10:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1277 transitions. [2019-12-18 22:10:11,911 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1277 transitions. Word has length 60 [2019-12-18 22:10:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:11,911 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1277 transitions. [2019-12-18 22:10:11,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:10:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1277 transitions. [2019-12-18 22:10:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 22:10:11,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:11,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:11,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:11,912 INFO L82 PathProgramCache]: Analyzing trace with hash 663982360, now seen corresponding path program 2 times [2019-12-18 22:10:11,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:11,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36162711] [2019-12-18 22:10:11,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:10:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:10:12,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:10:12,029 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:10:12,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff1_thd2~0_36) (= 0 v_~weak$$choice0~0_10) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~main$tmp_guard0~0_12 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= v_~y$mem_tmp~0_13 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1723~0.base_21| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1723~0.base_21|) (= 0 v_~x~0_9) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1723~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1723~0.base_21|) |v_ULTIMATE.start_main_~#t1723~0.offset_17| 0)) |v_#memory_int_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_21|)) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_17|) (= 0 v_~y$flush_delayed~0_18) (= v_~y$w_buff0_used~0_130 0) (= v_~y$r_buff0_thd2~0_75 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= v_~y~0_32 0) (= 0 v_~weak$$choice2~0_35) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_21| 1) |v_#valid_41|) (= 0 v_~y$w_buff1~0_32) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~y$r_buff1_thd1~0_27) (= v_~y$w_buff1_used~0_64 0) (= v_~__unbuffered_p0_EBX~0_17 0) (= 0 v_~y$w_buff0~0_35) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_21|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_17|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1723~0.offset, ~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, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1724~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:10:12,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-18 22:10:12,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~y$w_buff0_used~0_98) (= 1 v_~y$w_buff0~0_22) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_99) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~y$w_buff0~0_23 v_~y$w_buff1~0_24) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_24, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:10:12,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1229200285 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1229200285 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1229200285| ~y$w_buff1~0_In-1229200285)) (and (= ~y$w_buff0~0_In-1229200285 |P1Thread1of1ForFork1_#t~ite28_Out-1229200285|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1229200285, ~y$w_buff1~0=~y$w_buff1~0_In-1229200285, ~y$w_buff0~0=~y$w_buff0~0_In-1229200285, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1229200285} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1229200285, ~y$w_buff1~0=~y$w_buff1~0_In-1229200285, ~y$w_buff0~0=~y$w_buff0~0_In-1229200285, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1229200285, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1229200285|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 22:10:12,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_22 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~y~0=v_~y~0_22, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 22:10:12,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 22:10:12,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1707977328 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1707977328| ~y$mem_tmp~0_In1707977328) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1707977328| ~y~0_In1707977328)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1707977328, ~y$flush_delayed~0=~y$flush_delayed~0_In1707977328, ~y~0=~y~0_In1707977328} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1707977328, ~y$flush_delayed~0=~y$flush_delayed~0_In1707977328, ~y~0=~y~0_In1707977328, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1707977328|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 22:10:12,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-245349291 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-245349291 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-245349291| ~y$w_buff0_used~0_In-245349291) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-245349291| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-245349291, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-245349291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-245349291, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-245349291|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-245349291} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 22:10:12,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1936006597 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1936006597 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1936006597 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1936006597 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out1936006597| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite52_Out1936006597| ~y$w_buff1_used~0_In1936006597) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1936006597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1936006597, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1936006597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936006597} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1936006597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1936006597, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1936006597|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1936006597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936006597} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 22:10:12,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2009801419 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2009801419 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-2009801419 ~y$r_buff0_thd2~0_In-2009801419) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd2~0_Out-2009801419 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009801419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2009801419} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2009801419|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009801419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2009801419} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:10:12,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1182918129 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1182918129 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1182918129 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1182918129 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out-1182918129| ~y$r_buff1_thd2~0_In-1182918129)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1182918129| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182918129, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1182918129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1182918129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182918129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182918129, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1182918129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1182918129, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1182918129|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182918129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 22:10:12,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:10:12,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1095584640 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1095584640| ~y$mem_tmp~0_In-1095584640)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1095584640| ~y~0_In-1095584640)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1095584640, ~y$flush_delayed~0=~y$flush_delayed~0_In-1095584640, ~y~0=~y~0_In-1095584640} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1095584640, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1095584640|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1095584640, ~y~0=~y~0_In-1095584640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 22:10:12,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L747-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:10:12,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= (mod v_~y$w_buff0_used~0_106 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:10:12,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In580083108 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In580083108 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out580083108| ~y~0_In580083108)) (and (= |ULTIMATE.start_main_#t~ite57_Out580083108| ~y$w_buff1~0_In580083108) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In580083108, ~y~0=~y~0_In580083108, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In580083108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580083108} OutVars{~y$w_buff1~0=~y$w_buff1~0_In580083108, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out580083108|, ~y~0=~y~0_In580083108, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In580083108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580083108} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 22:10:12,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_19 |v_ULTIMATE.start_main_#t~ite57_7|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_6|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_6|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-18 22:10:12,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1624489336 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1624489336 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1624489336| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1624489336| ~y$w_buff0_used~0_In1624489336)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1624489336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1624489336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1624489336, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1624489336, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1624489336|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 22:10:12,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2128078215 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2128078215 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2128078215 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2128078215 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2128078215 |ULTIMATE.start_main_#t~ite60_Out2128078215|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2128078215|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2128078215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128078215, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128078215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128078215} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2128078215|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2128078215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128078215, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128078215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128078215} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 22:10:12,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1059277408 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1059277408 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1059277408| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1059277408| ~y$r_buff0_thd0~0_In1059277408)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1059277408, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059277408} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1059277408|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1059277408, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059277408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 22:10:12,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-642946415 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-642946415 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-642946415 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-642946415 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-642946415| ~y$r_buff1_thd0~0_In-642946415) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-642946415| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-642946415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-642946415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-642946415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-642946415} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-642946415|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-642946415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-642946415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-642946415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-642946415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 22:10:12,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_13| v_~y$r_buff1_thd0~0_14) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:10:12,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:10:12 BasicIcfg [2019-12-18 22:10:12,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:10:12,193 INFO L168 Benchmark]: Toolchain (without parser) took 75404.44 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 583.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,194 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.49 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,198 INFO L168 Benchmark]: Boogie Preprocessor took 40.41 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,199 INFO L168 Benchmark]: RCFGBuilder took 839.60 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 96.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,204 INFO L168 Benchmark]: TraceAbstraction took 73657.21 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 96.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 523.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:12,212 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.49 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.41 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.60 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 96.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73657.21 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 96.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 523.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 108 ProgramPointsAfterwards, 228 TransitionsBefore, 133 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 27 ChoiceCompositions, 8765 VarBasedMoverChecksPositive, 227 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 149863 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L776] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L776] 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)) [L777] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L777] 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)) [L778] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L778] 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)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4763 SDtfs, 5554 SDslu, 9858 SDs, 0 SdLazy, 3832 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94193occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 249359 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 538 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 48836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...