/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/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:28:36,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:28:36,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:28:36,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:28:36,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:28:36,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:28:36,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:28:36,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:28:36,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:28:36,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:28:36,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:28:36,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:28:36,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:28:36,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:28:36,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:28:36,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:28:36,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:28:36,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:28:36,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:28:36,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:28:36,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:28:36,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:28:36,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:28:36,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:28:36,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:28:36,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:28:36,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:28:36,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:28:36,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:28:36,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:28:36,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:28:36,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:28:36,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:28:36,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:28:36,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:28:36,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:28:36,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:28:36,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:28:36,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:28:36,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:28:36,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:28:36,659 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-27 06:28:36,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:28:36,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:28:36,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:28:36,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:28:36,675 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:28:36,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:28:36,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:28:36,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:28:36,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:28:36,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:28:36,677 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:28:36,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:28:36,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:28:36,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:28:36,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:28:36,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:28:36,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:28:36,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:28:36,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:28:36,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:28:36,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:28:36,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:28:36,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:28:36,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:28:36,996 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:28:36,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-27 06:28:37,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7558ed91e/7b93a91e251f4a0fb4a2ebbf11174db8/FLAGa005221a1 [2019-12-27 06:28:37,611 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:28:37,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-27 06:28:37,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7558ed91e/7b93a91e251f4a0fb4a2ebbf11174db8/FLAGa005221a1 [2019-12-27 06:28:37,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7558ed91e/7b93a91e251f4a0fb4a2ebbf11174db8 [2019-12-27 06:28:37,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:28:37,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:28:37,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:37,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:28:37,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:28:37,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:37" (1/1) ... [2019-12-27 06:28:37,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b03d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:37, skipping insertion in model container [2019-12-27 06:28:37,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:37" (1/1) ... [2019-12-27 06:28:37,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:28:37,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:28:38,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:38,479 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:28:38,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:38,646 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:28:38,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38 WrapperNode [2019-12-27 06:28:38,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:38,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:38,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:28:38,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:28:38,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:38,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:28:38,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:28:38,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:28:38,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (1/1) ... [2019-12-27 06:28:38,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:28:38,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:28:38,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:28:38,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:28:38,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (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-27 06:28:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:28:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:28:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:28:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:28:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:28:38,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:28:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:28:38,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:28:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:28:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:28:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:28:38,837 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:28:39,544 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:28:39,544 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:28:39,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:39 BoogieIcfgContainer [2019-12-27 06:28:39,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:28:39,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:28:39,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:28:39,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:28:39,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:28:37" (1/3) ... [2019-12-27 06:28:39,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f6cae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:39, skipping insertion in model container [2019-12-27 06:28:39,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:38" (2/3) ... [2019-12-27 06:28:39,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f6cae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:39, skipping insertion in model container [2019-12-27 06:28:39,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:39" (3/3) ... [2019-12-27 06:28:39,554 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2019-12-27 06:28:39,565 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:28:39,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:28:39,573 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:28:39,574 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:28:39,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:39,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:28:39,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:28:39,677 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:28:39,677 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:28:39,677 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:28:39,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:28:39,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:28:39,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:28:39,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:28:39,696 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 06:28:39,698 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:39,804 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:39,804 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:39,817 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:39,835 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:39,879 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:39,880 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:39,885 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:39,898 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:28:39,899 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:28:42,913 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 06:28:43,037 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:28:43,057 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-27 06:28:43,057 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 06:28:43,061 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-27 06:28:43,540 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:28:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:28:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:28:43,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:43,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:28:43,551 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-27 06:28:43,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:43,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028390818] [2019-12-27 06:28:43,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:43,874 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-27 06:28:43,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028390818] [2019-12-27 06:28:43,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:43,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:28:43,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346440932] [2019-12-27 06:28:43,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:43,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:43,895 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:28:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:44,280 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-27 06:28:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:44,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:28:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:44,397 INFO L225 Difference]: With dead ends: 9090 [2019-12-27 06:28:44,397 INFO L226 Difference]: Without dead ends: 8908 [2019-12-27 06:28:44,399 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-27 06:28:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-27 06:28:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-27 06:28:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-27 06:28:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-27 06:28:44,868 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-27 06:28:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:44,869 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-27 06:28:44,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-27 06:28:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:28:44,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:44,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:44,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:44,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-27 06:28:44,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:44,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119859704] [2019-12-27 06:28:44,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:45,061 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-27 06:28:45,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119859704] [2019-12-27 06:28:45,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:45,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:45,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461656456] [2019-12-27 06:28:45,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:28:45,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:28:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:45,065 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 4 states. [2019-12-27 06:28:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:46,010 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-27 06:28:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:28:46,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:28:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:46,087 INFO L225 Difference]: With dead ends: 14155 [2019-12-27 06:28:46,087 INFO L226 Difference]: Without dead ends: 14148 [2019-12-27 06:28:46,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:28:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-27 06:28:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-27 06:28:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-27 06:28:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-27 06:28:46,522 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-27 06:28:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:46,522 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-27 06:28:46,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:28:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-27 06:28:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:28:46,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:46,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:46,526 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-27 06:28:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:46,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430190247] [2019-12-27 06:28:46,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:46,591 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-27 06:28:46,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430190247] [2019-12-27 06:28:46,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:46,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:46,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343181522] [2019-12-27 06:28:46,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:28:46,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:28:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:28:46,594 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-27 06:28:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:46,641 INFO L93 Difference]: Finished difference Result 2009 states and 4645 transitions. [2019-12-27 06:28:46,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:28:46,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:28:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:46,646 INFO L225 Difference]: With dead ends: 2009 [2019-12-27 06:28:46,647 INFO L226 Difference]: Without dead ends: 1723 [2019-12-27 06:28:46,647 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-27 06:28:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-12-27 06:28:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2019-12-27 06:28:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-27 06:28:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 3854 transitions. [2019-12-27 06:28:46,776 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 3854 transitions. Word has length 11 [2019-12-27 06:28:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:46,776 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 3854 transitions. [2019-12-27 06:28:46,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:28:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3854 transitions. [2019-12-27 06:28:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:28:46,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:46,780 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-27 06:28:46,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1819811138, now seen corresponding path program 1 times [2019-12-27 06:28:46,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:46,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412511270] [2019-12-27 06:28:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:46,885 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-27 06:28:46,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412511270] [2019-12-27 06:28:46,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:46,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:28:46,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975863951] [2019-12-27 06:28:46,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:28:46,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:28:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:28:46,887 INFO L87 Difference]: Start difference. First operand 1723 states and 3854 transitions. Second operand 5 states. [2019-12-27 06:28:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:46,937 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-27 06:28:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:28:46,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 06:28:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:46,938 INFO L225 Difference]: With dead ends: 403 [2019-12-27 06:28:46,939 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 06:28:46,939 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-27 06:28:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 06:28:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 06:28:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:28:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-27 06:28:46,946 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-27 06:28:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:46,946 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-27 06:28:46,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:28:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-27 06:28:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:28:46,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:46,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:46,949 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-27 06:28:46,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:46,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935933823] [2019-12-27 06:28:46,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:47,046 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-27 06:28:47,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935933823] [2019-12-27 06:28:47,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:47,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:28:47,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746268434] [2019-12-27 06:28:47,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:47,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:47,049 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-27 06:28:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:47,108 INFO L93 Difference]: Finished difference Result 333 states and 611 transitions. [2019-12-27 06:28:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:47,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:28:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:47,110 INFO L225 Difference]: With dead ends: 333 [2019-12-27 06:28:47,110 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 06:28:47,111 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-27 06:28:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 06:28:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-12-27 06:28:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:28:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 607 transitions. [2019-12-27 06:28:47,117 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 607 transitions. Word has length 52 [2019-12-27 06:28:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:47,118 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 607 transitions. [2019-12-27 06:28:47,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 607 transitions. [2019-12-27 06:28:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:28:47,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:47,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:47,120 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-27 06:28:47,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:47,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034753906] [2019-12-27 06:28:47,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:47,195 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-27 06:28:47,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034753906] [2019-12-27 06:28:47,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:47,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:47,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78377827] [2019-12-27 06:28:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:47,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:47,198 INFO L87 Difference]: Start difference. First operand 329 states and 607 transitions. Second operand 3 states. [2019-12-27 06:28:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:47,212 INFO L93 Difference]: Finished difference Result 329 states and 594 transitions. [2019-12-27 06:28:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:47,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:28:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:47,214 INFO L225 Difference]: With dead ends: 329 [2019-12-27 06:28:47,214 INFO L226 Difference]: Without dead ends: 329 [2019-12-27 06:28:47,214 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-27 06:28:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-27 06:28:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-12-27 06:28:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:28:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 594 transitions. [2019-12-27 06:28:47,221 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 594 transitions. Word has length 52 [2019-12-27 06:28:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:47,221 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 594 transitions. [2019-12-27 06:28:47,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 594 transitions. [2019-12-27 06:28:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:28:47,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:47,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:47,223 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-27 06:28:47,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:47,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57693645] [2019-12-27 06:28:47,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:47,469 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-27 06:28:47,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57693645] [2019-12-27 06:28:47,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:47,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:28:47,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189341552] [2019-12-27 06:28:47,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:28:47,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:28:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:28:47,471 INFO L87 Difference]: Start difference. First operand 329 states and 594 transitions. Second operand 9 states. [2019-12-27 06:28:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:48,119 INFO L93 Difference]: Finished difference Result 567 states and 1002 transitions. [2019-12-27 06:28:48,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:28:48,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 06:28:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:48,121 INFO L225 Difference]: With dead ends: 567 [2019-12-27 06:28:48,122 INFO L226 Difference]: Without dead ends: 567 [2019-12-27 06:28:48,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:28:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-12-27 06:28:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 374. [2019-12-27 06:28:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-27 06:28:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 676 transitions. [2019-12-27 06:28:48,131 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 676 transitions. Word has length 53 [2019-12-27 06:28:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:48,132 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 676 transitions. [2019-12-27 06:28:48,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:28:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 676 transitions. [2019-12-27 06:28:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:28:48,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:48,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:48,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 783878168, now seen corresponding path program 2 times [2019-12-27 06:28:48,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:48,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076448144] [2019-12-27 06:28:48,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:48,253 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-27 06:28:48,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076448144] [2019-12-27 06:28:48,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:48,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:28:48,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143303309] [2019-12-27 06:28:48,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:48,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:48,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:48,255 INFO L87 Difference]: Start difference. First operand 374 states and 676 transitions. Second operand 3 states. [2019-12-27 06:28:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:48,305 INFO L93 Difference]: Finished difference Result 373 states and 674 transitions. [2019-12-27 06:28:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:48,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:28:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:48,307 INFO L225 Difference]: With dead ends: 373 [2019-12-27 06:28:48,307 INFO L226 Difference]: Without dead ends: 373 [2019-12-27 06:28:48,307 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-27 06:28:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-27 06:28:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 276. [2019-12-27 06:28:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-27 06:28:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 493 transitions. [2019-12-27 06:28:48,314 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 493 transitions. Word has length 53 [2019-12-27 06:28:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:48,314 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 493 transitions. [2019-12-27 06:28:48,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 493 transitions. [2019-12-27 06:28:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:28:48,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:48,315 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] [2019-12-27 06:28:48,316 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-27 06:28:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:48,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089462418] [2019-12-27 06:28:48,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:28:48,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089462418] [2019-12-27 06:28:48,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:48,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:28:48,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687465643] [2019-12-27 06:28:48,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:28:48,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:28:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:28:48,582 INFO L87 Difference]: Start difference. First operand 276 states and 493 transitions. Second operand 7 states. [2019-12-27 06:28:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:48,699 INFO L93 Difference]: Finished difference Result 481 states and 853 transitions. [2019-12-27 06:28:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:28:48,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:28:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:48,701 INFO L225 Difference]: With dead ends: 481 [2019-12-27 06:28:48,701 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 06:28:48,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:28:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 06:28:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 06:28:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 06:28:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 341 transitions. [2019-12-27 06:28:48,707 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 341 transitions. Word has length 54 [2019-12-27 06:28:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:48,707 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 341 transitions. [2019-12-27 06:28:48,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:28:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 341 transitions. [2019-12-27 06:28:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:28:48,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:48,708 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] [2019-12-27 06:28:48,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 2 times [2019-12-27 06:28:48,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:48,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116662041] [2019-12-27 06:28:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:28:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:28:48,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:28:48,821 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:28:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20| 1)) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= (select .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20|) 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20|) |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0)) |v_#memory_int_17|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| 4) |v_#length_17|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1091~0.base_20|) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1091~0.base=|v_ULTIMATE.start_main_~#t1091~0.base_20|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_~#t1091~0.offset=|v_ULTIMATE.start_main_~#t1091~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1092~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1091~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t1091~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:28:48,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11|) |v_ULTIMATE.start_main_~#t1092~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1092~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1092~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_10|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_~#t1092~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:28:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:28:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1531644853 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1531644853| |P0Thread1of1ForFork0_#t~ite3_Out-1531644853|)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1531644853 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-1531644853| ~x~0_In-1531644853)) (and (not .cse1) .cse2 (= ~x$w_buff1~0_In-1531644853 |P0Thread1of1ForFork0_#t~ite3_Out-1531644853|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1531644853, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1531644853, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1531644853, ~x~0=~x~0_In-1531644853} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1531644853|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1531644853|, ~x$w_buff1~0=~x$w_buff1~0_In-1531644853, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1531644853, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1531644853, ~x~0=~x~0_In-1531644853} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:28:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1617419973 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1617419973 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1617419973|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1617419973 |P0Thread1of1ForFork0_#t~ite5_Out1617419973|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1617419973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1617419973} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1617419973|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1617419973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1617419973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:28:48,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-647862345 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-647862345 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-647862345 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-647862345 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-647862345|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-647862345 |P0Thread1of1ForFork0_#t~ite6_Out-647862345|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-647862345, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-647862345, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-647862345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647862345} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-647862345|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-647862345, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-647862345, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-647862345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-647862345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:28:48,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1447809297 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1447809297 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1447809297 |P0Thread1of1ForFork0_#t~ite7_Out-1447809297|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1447809297| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1447809297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1447809297} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1447809297, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1447809297|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1447809297} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:28:48,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In543346966 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In543346966 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In543346966 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In543346966 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In543346966 |P0Thread1of1ForFork0_#t~ite8_Out543346966|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out543346966|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In543346966, ~x$w_buff1_used~0=~x$w_buff1_used~0_In543346966, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In543346966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In543346966} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In543346966, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out543346966|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In543346966, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In543346966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In543346966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:28:48,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:28:48,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2125473711 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2125473711 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2125473711| ~x$w_buff0_used~0_In2125473711)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2125473711| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2125473711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2125473711} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2125473711|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2125473711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2125473711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:28:48,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In392569513 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In392569513 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In392569513 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In392569513 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out392569513| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In392569513 |P1Thread1of1ForFork1_#t~ite12_Out392569513|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In392569513, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In392569513, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In392569513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In392569513} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In392569513, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In392569513, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out392569513|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In392569513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In392569513} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:28:48,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-892770013 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-892770013 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-892770013 ~x$r_buff0_thd2~0_Out-892770013)) (and (= 0 ~x$r_buff0_thd2~0_Out-892770013) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-892770013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-892770013} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-892770013|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-892770013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-892770013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:28:48,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1700983145 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1700983145 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1700983145 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1700983145 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1700983145|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1700983145| ~x$r_buff1_thd2~0_In1700983145) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1700983145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1700983145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700983145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700983145} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1700983145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1700983145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700983145, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1700983145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700983145} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:28:48,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:28:48,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:28:48,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1364663432 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1364663432 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1364663432 |ULTIMATE.start_main_#t~ite17_Out-1364663432|)) (and (not .cse0) (= ~x$w_buff1~0_In-1364663432 |ULTIMATE.start_main_#t~ite17_Out-1364663432|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1364663432, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1364663432, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1364663432, ~x~0=~x~0_In-1364663432} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1364663432|, ~x$w_buff1~0=~x$w_buff1~0_In-1364663432, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1364663432, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1364663432, ~x~0=~x~0_In-1364663432} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 06:28:48,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 06:28:48,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1232741401 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1232741401 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1232741401| ~x$w_buff0_used~0_In-1232741401)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1232741401| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1232741401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232741401} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1232741401, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1232741401|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1232741401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:28:48,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1812925565 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1812925565 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1812925565 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1812925565 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1812925565| ~x$w_buff1_used~0_In1812925565) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1812925565|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1812925565, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1812925565, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1812925565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812925565} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1812925565, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1812925565, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1812925565|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1812925565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812925565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:28:48,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1472279980 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1472279980 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1472279980| ~x$r_buff0_thd0~0_In-1472279980) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1472279980| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1472279980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1472279980} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1472279980, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1472279980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1472279980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:28:48,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-505297099 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-505297099 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-505297099 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-505297099 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-505297099| 0)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-505297099 |ULTIMATE.start_main_#t~ite22_Out-505297099|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-505297099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-505297099, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-505297099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505297099} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-505297099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-505297099, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-505297099, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-505297099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505297099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:28:48,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In519312477 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In519312477 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In519312477 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In519312477 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In519312477 256) 0)))) (= |ULTIMATE.start_main_#t~ite31_Out519312477| ~x$w_buff1~0_In519312477) (= |ULTIMATE.start_main_#t~ite32_Out519312477| |ULTIMATE.start_main_#t~ite31_Out519312477|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite32_Out519312477| ~x$w_buff1~0_In519312477) (= |ULTIMATE.start_main_#t~ite31_In519312477| |ULTIMATE.start_main_#t~ite31_Out519312477|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In519312477, ~x$w_buff1~0=~x$w_buff1~0_In519312477, ~x$w_buff1_used~0=~x$w_buff1_used~0_In519312477, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In519312477, ~weak$$choice2~0=~weak$$choice2~0_In519312477, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In519312477|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In519312477} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In519312477, ~x$w_buff1~0=~x$w_buff1~0_In519312477, ~x$w_buff1_used~0=~x$w_buff1_used~0_In519312477, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out519312477|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In519312477, ~weak$$choice2~0=~weak$$choice2~0_In519312477, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out519312477|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In519312477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:28:48,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1602170750 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1602170750 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1602170750 256)) (and (= (mod ~x$w_buff1_used~0_In-1602170750 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd0~0_In-1602170750 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1602170750| ~x$w_buff1_used~0_In-1602170750) (= |ULTIMATE.start_main_#t~ite37_Out-1602170750| |ULTIMATE.start_main_#t~ite38_Out-1602170750|)) (and (= |ULTIMATE.start_main_#t~ite37_In-1602170750| |ULTIMATE.start_main_#t~ite37_Out-1602170750|) (not .cse1) (= ~x$w_buff1_used~0_In-1602170750 |ULTIMATE.start_main_#t~ite38_Out-1602170750|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1602170750, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1602170750, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1602170750|, ~weak$$choice2~0=~weak$$choice2~0_In-1602170750, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1602170750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1602170750} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1602170750, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1602170750, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1602170750|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1602170750|, ~weak$$choice2~0=~weak$$choice2~0_In-1602170750, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1602170750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1602170750} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:28:48,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:28:48,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:28:48,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:28:48,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:28:48 BasicIcfg [2019-12-27 06:28:48,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:28:48,939 INFO L168 Benchmark]: Toolchain (without parser) took 11065.28 ms. Allocated memory was 143.7 MB in the beginning and 509.1 MB in the end (delta: 365.4 MB). Free memory was 99.9 MB in the beginning and 329.9 MB in the end (delta: -230.0 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,940 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:28:48,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.04 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 155.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,945 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,946 INFO L168 Benchmark]: RCFGBuilder took 789.78 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 105.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,949 INFO L168 Benchmark]: TraceAbstraction took 9388.09 ms. Allocated memory was 200.8 MB in the beginning and 509.1 MB in the end (delta: 308.3 MB). Free memory was 104.5 MB in the beginning and 329.9 MB in the end (delta: -225.4 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:28:48,956 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.22 ms. Allocated memory is still 143.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.04 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 155.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.78 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 105.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9388.09 ms. Allocated memory was 200.8 MB in the beginning and 509.1 MB in the end (delta: 308.3 MB). Free memory was 104.5 MB in the beginning and 329.9 MB in the end (delta: -225.4 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 887 SDtfs, 821 SDslu, 1451 SDs, 0 SdLazy, 772 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12754occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1747 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 45307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...