/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:48:46,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:48:46,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:48:46,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:48:46,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:48:46,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:48:46,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:48:46,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:48:46,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:48:46,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:48:46,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:48:46,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:48:46,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:48:46,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:48:46,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:48:46,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:48:46,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:48:46,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:48:46,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:48:46,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:48:46,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:48:46,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:48:46,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:48:46,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:48:46,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:48:46,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:48:46,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:48:46,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:48:46,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:48:46,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:48:46,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:48:46,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:48:46,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:48:46,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:48:46,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:48:46,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:48:46,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:48:46,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:48:46,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:48:46,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:48:46,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:48:46,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:48:46,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:48:46,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:48:46,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:48:46,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:48:46,678 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:48:46,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:48:46,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:48:46,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:48:46,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:48:46,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:48:46,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:48:46,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:48:46,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:48:46,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:48:46,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:48:46,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:48:46,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:48:46,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:48:46,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:48:46,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:48:46,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:48:46,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:46,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:48:46,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:48:46,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:48:46,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:48:46,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:48:46,683 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:48:46,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:48:46,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:48:46,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:48:46,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:48:46,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:48:46,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:48:46,962 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:48:46,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-18 21:48:47,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6cbac01/9b35547be52f409b9f8d27824cf48661/FLAGda5eb1fef [2019-12-18 21:48:47,596 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:48:47,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-18 21:48:47,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6cbac01/9b35547be52f409b9f8d27824cf48661/FLAGda5eb1fef [2019-12-18 21:48:47,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6cbac01/9b35547be52f409b9f8d27824cf48661 [2019-12-18 21:48:47,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:48:47,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:48:47,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:47,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:48:47,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:48:47,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:47" (1/1) ... [2019-12-18 21:48:47,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120a9bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:47, skipping insertion in model container [2019-12-18 21:48:47,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:48:47" (1/1) ... [2019-12-18 21:48:47,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:48:47,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:48:48,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:48,577 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:48:48,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:48:48,746 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:48:48,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48 WrapperNode [2019-12-18 21:48:48,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:48:48,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:48,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:48:48,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:48:48,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:48:48,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:48:48,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:48:48,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:48:48,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... [2019-12-18 21:48:48,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:48:48,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:48:48,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:48:48,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:48:48,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:48:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:48:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:48:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:48:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:48:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:48:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:48:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:48:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:48:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:48:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:48:48,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:48:48,943 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:48:49,621 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:48:49,622 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:48:49,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:49 BoogieIcfgContainer [2019-12-18 21:48:49,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:48:49,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:48:49,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:48:49,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:48:49,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:48:47" (1/3) ... [2019-12-18 21:48:49,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f2872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:49, skipping insertion in model container [2019-12-18 21:48:49,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:48:48" (2/3) ... [2019-12-18 21:48:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f2872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:48:49, skipping insertion in model container [2019-12-18 21:48:49,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:48:49" (3/3) ... [2019-12-18 21:48:49,637 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-12-18 21:48:49,648 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:48:49,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:48:49,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:48:49,670 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:48:49,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,736 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,751 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:48:49,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:48:49,883 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:48:49,883 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:48:49,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:48:49,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:48:49,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:48:49,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:48:49,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:48:49,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:48:49,906 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 21:48:49,908 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:48:50,009 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:48:50,009 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:50,027 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:48:50,048 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:48:50,097 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:48:50,097 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:48:50,106 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:48:50,120 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:48:50,122 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:48:53,304 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 21:48:53,427 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-18 21:48:53,427 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 21:48:53,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-18 21:48:53,939 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-18 21:48:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-18 21:48:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:48:53,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:53,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:48:53,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-18 21:48:53,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:53,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49369984] [2019-12-18 21:48:53,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:54,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49369984] [2019-12-18 21:48:54,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:54,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:48:54,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122028145] [2019-12-18 21:48:54,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:54,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:54,264 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-18 21:48:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:54,520 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-18 21:48:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:54,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:48:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:54,615 INFO L225 Difference]: With dead ends: 8310 [2019-12-18 21:48:54,615 INFO L226 Difference]: Without dead ends: 7790 [2019-12-18 21:48:54,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-18 21:48:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-18 21:48:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-18 21:48:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-18 21:48:55,198 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-18 21:48:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:55,198 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-18 21:48:55,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-18 21:48:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:48:55,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:55,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:55,202 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-18 21:48:55,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:55,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364684251] [2019-12-18 21:48:55,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:55,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364684251] [2019-12-18 21:48:55,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:55,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:55,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308603424] [2019-12-18 21:48:55,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:55,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:55,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:55,337 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-18 21:48:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:55,790 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-18 21:48:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:48:55,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:48:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:55,898 INFO L225 Difference]: With dead ends: 12240 [2019-12-18 21:48:55,899 INFO L226 Difference]: Without dead ends: 12233 [2019-12-18 21:48:55,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-18 21:48:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-18 21:48:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-18 21:48:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-18 21:48:56,424 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-18 21:48:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:56,424 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-18 21:48:56,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-18 21:48:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:48:56,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:56,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:56,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-18 21:48:56,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:56,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563230807] [2019-12-18 21:48:56,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:56,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563230807] [2019-12-18 21:48:56,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:56,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:56,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631601561] [2019-12-18 21:48:56,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:48:56,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:48:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:56,569 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-18 21:48:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:57,119 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-18 21:48:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:48:57,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:48:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:57,816 INFO L225 Difference]: With dead ends: 15483 [2019-12-18 21:48:57,816 INFO L226 Difference]: Without dead ends: 15483 [2019-12-18 21:48:57,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:48:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-18 21:48:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-18 21:48:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-18 21:48:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-18 21:48:58,248 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-18 21:48:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:58,249 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-18 21:48:58,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:48:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-18 21:48:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:48:58,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:58,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:58,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-18 21:48:58,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:58,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652275618] [2019-12-18 21:48:58,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:58,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652275618] [2019-12-18 21:48:58,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:58,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:48:58,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415105409] [2019-12-18 21:48:58,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,347 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-18 21:48:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:58,414 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-18 21:48:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:58,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:48:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:58,467 INFO L225 Difference]: With dead ends: 12387 [2019-12-18 21:48:58,467 INFO L226 Difference]: Without dead ends: 12387 [2019-12-18 21:48:58,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-18 21:48:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-18 21:48:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-18 21:48:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-18 21:48:58,905 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-18 21:48:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:58,905 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-18 21:48:58,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-18 21:48:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:58,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:58,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:58,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-18 21:48:58,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:58,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165019525] [2019-12-18 21:48:58,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:58,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165019525] [2019-12-18 21:48:58,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:58,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:48:58,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288228309] [2019-12-18 21:48:58,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:48:58,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:48:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:58,954 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 3 states. [2019-12-18 21:48:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:59,031 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-18 21:48:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:48:59,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 21:48:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:59,068 INFO L225 Difference]: With dead ends: 20943 [2019-12-18 21:48:59,068 INFO L226 Difference]: Without dead ends: 11612 [2019-12-18 21:48:59,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:48:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-18 21:48:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-18 21:48:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-18 21:48:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-18 21:48:59,517 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-18 21:48:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,517 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-18 21:48:59,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:48:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-18 21:48:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:48:59,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:59,523 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-18 21:48:59,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208274588] [2019-12-18 21:48:59,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208274588] [2019-12-18 21:48:59,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:48:59,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930304542] [2019-12-18 21:48:59,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:48:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:48:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:48:59,608 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 4 states. [2019-12-18 21:48:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:48:59,656 INFO L93 Difference]: Finished difference Result 1835 states and 4564 transitions. [2019-12-18 21:48:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:48:59,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 21:48:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:48:59,662 INFO L225 Difference]: With dead ends: 1835 [2019-12-18 21:48:59,662 INFO L226 Difference]: Without dead ends: 1299 [2019-12-18 21:48:59,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:48:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-12-18 21:48:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1295. [2019-12-18 21:48:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-18 21:48:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2878 transitions. [2019-12-18 21:48:59,698 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2878 transitions. Word has length 17 [2019-12-18 21:48:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:48:59,699 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2878 transitions. [2019-12-18 21:48:59,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:48:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2878 transitions. [2019-12-18 21:48:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:48:59,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:48:59,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:48:59,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:48:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:48:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-18 21:48:59,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:48:59,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197460123] [2019-12-18 21:48:59,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:48:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:48:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:48:59,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197460123] [2019-12-18 21:48:59,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:48:59,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:48:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827586170] [2019-12-18 21:48:59,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:48:59,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:48:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:48:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:48:59,807 INFO L87 Difference]: Start difference. First operand 1295 states and 2878 transitions. Second operand 6 states. [2019-12-18 21:49:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,085 INFO L93 Difference]: Finished difference Result 1351 states and 2946 transitions. [2019-12-18 21:49:00,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:49:00,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:49:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,088 INFO L225 Difference]: With dead ends: 1351 [2019-12-18 21:49:00,088 INFO L226 Difference]: Without dead ends: 1300 [2019-12-18 21:49:00,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:49:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-18 21:49:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1253. [2019-12-18 21:49:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-12-18 21:49:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2773 transitions. [2019-12-18 21:49:00,112 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2773 transitions. Word has length 25 [2019-12-18 21:49:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:00,113 INFO L462 AbstractCegarLoop]: Abstraction has 1253 states and 2773 transitions. [2019-12-18 21:49:00,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:49:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2773 transitions. [2019-12-18 21:49:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:49:00,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:00,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:00,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1615008956, now seen corresponding path program 1 times [2019-12-18 21:49:00,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:00,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154780609] [2019-12-18 21:49:00,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:00,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154780609] [2019-12-18 21:49:00,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:00,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:00,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65534352] [2019-12-18 21:49:00,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:00,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:00,237 INFO L87 Difference]: Start difference. First operand 1253 states and 2773 transitions. Second operand 5 states. [2019-12-18 21:49:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,697 INFO L93 Difference]: Finished difference Result 1954 states and 4236 transitions. [2019-12-18 21:49:00,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:49:00,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:49:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,702 INFO L225 Difference]: With dead ends: 1954 [2019-12-18 21:49:00,702 INFO L226 Difference]: Without dead ends: 1954 [2019-12-18 21:49:00,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:49:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-12-18 21:49:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1770. [2019-12-18 21:49:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2019-12-18 21:49:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 3881 transitions. [2019-12-18 21:49:00,757 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 3881 transitions. Word has length 27 [2019-12-18 21:49:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:00,758 INFO L462 AbstractCegarLoop]: Abstraction has 1770 states and 3881 transitions. [2019-12-18 21:49:00,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3881 transitions. [2019-12-18 21:49:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:49:00,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:00,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:00,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-18 21:49:00,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:00,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143133219] [2019-12-18 21:49:00,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:00,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143133219] [2019-12-18 21:49:00,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:00,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:49:00,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873426648] [2019-12-18 21:49:00,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:00,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:00,846 INFO L87 Difference]: Start difference. First operand 1770 states and 3881 transitions. Second operand 5 states. [2019-12-18 21:49:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,889 INFO L93 Difference]: Finished difference Result 1084 states and 2256 transitions. [2019-12-18 21:49:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:00,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:49:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,892 INFO L225 Difference]: With dead ends: 1084 [2019-12-18 21:49:00,892 INFO L226 Difference]: Without dead ends: 886 [2019-12-18 21:49:00,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-18 21:49:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 850. [2019-12-18 21:49:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-18 21:49:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1827 transitions. [2019-12-18 21:49:00,907 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1827 transitions. Word has length 28 [2019-12-18 21:49:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:00,908 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1827 transitions. [2019-12-18 21:49:00,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1827 transitions. [2019-12-18 21:49:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:49:00,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:00,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:00,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1467449375, now seen corresponding path program 1 times [2019-12-18 21:49:00,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:00,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408855195] [2019-12-18 21:49:00,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:00,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408855195] [2019-12-18 21:49:00,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:00,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:00,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005205832] [2019-12-18 21:49:00,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:00,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:00,955 INFO L87 Difference]: Start difference. First operand 850 states and 1827 transitions. Second operand 3 states. [2019-12-18 21:49:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:00,995 INFO L93 Difference]: Finished difference Result 1251 states and 2618 transitions. [2019-12-18 21:49:00,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:00,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:49:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:00,998 INFO L225 Difference]: With dead ends: 1251 [2019-12-18 21:49:00,999 INFO L226 Difference]: Without dead ends: 1251 [2019-12-18 21:49:00,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-18 21:49:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 929. [2019-12-18 21:49:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-12-18 21:49:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1984 transitions. [2019-12-18 21:49:01,018 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1984 transitions. Word has length 51 [2019-12-18 21:49:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,018 INFO L462 AbstractCegarLoop]: Abstraction has 929 states and 1984 transitions. [2019-12-18 21:49:01,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1984 transitions. [2019-12-18 21:49:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:49:01,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:01,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1315298730, now seen corresponding path program 1 times [2019-12-18 21:49:01,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323693110] [2019-12-18 21:49:01,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:01,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323693110] [2019-12-18 21:49:01,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:01,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:01,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436617654] [2019-12-18 21:49:01,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:01,116 INFO L87 Difference]: Start difference. First operand 929 states and 1984 transitions. Second operand 7 states. [2019-12-18 21:49:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:01,315 INFO L93 Difference]: Finished difference Result 1587 states and 3308 transitions. [2019-12-18 21:49:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:49:01,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:49:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:01,318 INFO L225 Difference]: With dead ends: 1587 [2019-12-18 21:49:01,318 INFO L226 Difference]: Without dead ends: 1057 [2019-12-18 21:49:01,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:49:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-18 21:49:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 928. [2019-12-18 21:49:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-18 21:49:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1962 transitions. [2019-12-18 21:49:01,338 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1962 transitions. Word has length 51 [2019-12-18 21:49:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,339 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1962 transitions. [2019-12-18 21:49:01,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1962 transitions. [2019-12-18 21:49:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:49:01,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:01,342 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash 619071112, now seen corresponding path program 2 times [2019-12-18 21:49:01,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779637154] [2019-12-18 21:49:01,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:01,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779637154] [2019-12-18 21:49:01,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:01,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:01,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072767119] [2019-12-18 21:49:01,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,442 INFO L87 Difference]: Start difference. First operand 928 states and 1962 transitions. Second operand 3 states. [2019-12-18 21:49:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:01,498 INFO L93 Difference]: Finished difference Result 1163 states and 2443 transitions. [2019-12-18 21:49:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:01,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:49:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:01,501 INFO L225 Difference]: With dead ends: 1163 [2019-12-18 21:49:01,501 INFO L226 Difference]: Without dead ends: 1163 [2019-12-18 21:49:01,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-12-18 21:49:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 941. [2019-12-18 21:49:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-18 21:49:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2004 transitions. [2019-12-18 21:49:01,520 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2004 transitions. Word has length 51 [2019-12-18 21:49:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,520 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 2004 transitions. [2019-12-18 21:49:01,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2004 transitions. [2019-12-18 21:49:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:01,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:01,523 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 471151996, now seen corresponding path program 1 times [2019-12-18 21:49:01,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691979773] [2019-12-18 21:49:01,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:01,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691979773] [2019-12-18 21:49:01,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:01,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:01,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991745633] [2019-12-18 21:49:01,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:01,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,601 INFO L87 Difference]: Start difference. First operand 941 states and 2004 transitions. Second operand 3 states. [2019-12-18 21:49:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:01,616 INFO L93 Difference]: Finished difference Result 941 states and 2003 transitions. [2019-12-18 21:49:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:01,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:01,618 INFO L225 Difference]: With dead ends: 941 [2019-12-18 21:49:01,618 INFO L226 Difference]: Without dead ends: 941 [2019-12-18 21:49:01,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-18 21:49:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 835. [2019-12-18 21:49:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-12-18 21:49:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1804 transitions. [2019-12-18 21:49:01,631 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1804 transitions. Word has length 52 [2019-12-18 21:49:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:01,632 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1804 transitions. [2019-12-18 21:49:01,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1804 transitions. [2019-12-18 21:49:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:49:01,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:01,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:01,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-18 21:49:01,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:01,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960486477] [2019-12-18 21:49:01,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:01,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:49:01,759 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:49:01,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1443~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1443~0.base_22|) |v_ULTIMATE.start_main_~#t1443~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_22| 1)) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (= 0 v_~y$flush_delayed~0_13) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1443~0.base_22| 4)) (= v_~y$r_buff0_thd1~0_29 0) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (= |v_ULTIMATE.start_main_~#t1443~0.offset_17| 0) (= 0 |v_#NULL.base_3|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1443~0.base_22|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_22|)) (= v_~y$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start_main_~#t1443~0.offset=|v_ULTIMATE.start_main_~#t1443~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_18|, ~y~0=v_~y~0_25, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t1443~0.base=|v_ULTIMATE.start_main_~#t1443~0.base_22|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t1444~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1443~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1444~0.base, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1443~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:49:01,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t1444~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1444~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) |v_ULTIMATE.start_main_~#t1444~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1444~0.offset, #length, ULTIMATE.start_main_~#t1444~0.base] because there is no mapped edge [2019-12-18 21:49:01,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= ~y$r_buff1_thd2~0_Out-215996121 ~y$r_buff0_thd2~0_In-215996121) (= ~x~0_Out-215996121 1) (= ~y$r_buff1_thd1~0_Out-215996121 ~y$r_buff0_thd1~0_In-215996121) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215996121)) (= 1 ~y$r_buff0_thd1~0_Out-215996121) (= ~y$r_buff1_thd0~0_Out-215996121 ~y$r_buff0_thd0~0_In-215996121)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215996121, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-215996121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215996121, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215996121} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-215996121, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-215996121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215996121, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-215996121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215996121, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215996121, ~x~0=~x~0_Out-215996121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-215996121} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:49:01,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1711575614 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1711575614 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1711575614| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1711575614| ~y$w_buff0_used~0_In1711575614)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1711575614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1711575614} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1711575614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1711575614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1711575614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:49:01,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In225341721 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out225341721| ~y$w_buff0~0_In225341721) (= |P1Thread1of1ForFork1_#t~ite15_Out225341721| |P1Thread1of1ForFork1_#t~ite14_Out225341721|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In225341721 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In225341721 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In225341721 256)) (and (= (mod ~y$r_buff1_thd2~0_In225341721 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite14_In225341721| |P1Thread1of1ForFork1_#t~ite14_Out225341721|) (= |P1Thread1of1ForFork1_#t~ite15_Out225341721| ~y$w_buff0~0_In225341721) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In225341721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In225341721, ~y$w_buff0~0=~y$w_buff0~0_In225341721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In225341721, ~weak$$choice2~0=~weak$$choice2~0_In225341721, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In225341721|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225341721} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In225341721, ~y$w_buff0_used~0=~y$w_buff0_used~0_In225341721, ~y$w_buff0~0=~y$w_buff0~0_In225341721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In225341721, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out225341721|, ~weak$$choice2~0=~weak$$choice2~0_In225341721, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out225341721|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In225341721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:49:01,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-557367955 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-557367955| ~y$w_buff0_used~0_In-557367955) (= |P1Thread1of1ForFork1_#t~ite20_In-557367955| |P1Thread1of1ForFork1_#t~ite20_Out-557367955|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-557367955 |P1Thread1of1ForFork1_#t~ite20_Out-557367955|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-557367955 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-557367955 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-557367955 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-557367955 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-557367955| |P1Thread1of1ForFork1_#t~ite20_Out-557367955|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-557367955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-557367955, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-557367955|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-557367955, ~weak$$choice2~0=~weak$$choice2~0_In-557367955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-557367955} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-557367955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-557367955, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-557367955|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-557367955, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-557367955|, ~weak$$choice2~0=~weak$$choice2~0_In-557367955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-557367955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:49:01,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:49:01,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In713117505 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out713117505| ~y$r_buff1_thd2~0_In713117505) (= |P1Thread1of1ForFork1_#t~ite29_Out713117505| |P1Thread1of1ForFork1_#t~ite30_Out713117505|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In713117505 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In713117505 256))) (= (mod ~y$w_buff0_used~0_In713117505 256) 0) (and (= (mod ~y$w_buff1_used~0_In713117505 256) 0) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In713117505| |P1Thread1of1ForFork1_#t~ite29_Out713117505|) (= |P1Thread1of1ForFork1_#t~ite30_Out713117505| ~y$r_buff1_thd2~0_In713117505)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In713117505, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In713117505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In713117505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In713117505, ~weak$$choice2~0=~weak$$choice2~0_In713117505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In713117505} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In713117505, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out713117505|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out713117505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In713117505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In713117505, ~weak$$choice2~0=~weak$$choice2~0_In713117505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In713117505} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:49:01,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:49:01,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1995155941 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1995155941 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1995155941| |P1Thread1of1ForFork1_#t~ite33_Out1995155941|))) (or (and (or .cse0 .cse1) (= ~y~0_In1995155941 |P1Thread1of1ForFork1_#t~ite32_Out1995155941|) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In1995155941 |P1Thread1of1ForFork1_#t~ite32_Out1995155941|) (not .cse1) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1995155941, ~y$w_buff1~0=~y$w_buff1~0_In1995155941, ~y~0=~y~0_In1995155941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995155941} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1995155941, ~y$w_buff1~0=~y$w_buff1~0_In1995155941, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1995155941|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1995155941|, ~y~0=~y~0_In1995155941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995155941} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 21:49:01,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In957363474 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In957363474 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out957363474|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out957363474| ~y$w_buff0_used~0_In957363474) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In957363474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In957363474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In957363474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In957363474, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out957363474|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:49:01,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2031045772 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2031045772 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2031045772 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2031045772 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2031045772| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-2031045772| ~y$w_buff1_used~0_In-2031045772) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2031045772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2031045772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2031045772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031045772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2031045772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2031045772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2031045772, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2031045772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031045772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:49:01,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-554930754 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-554930754 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-554930754| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-554930754| ~y$r_buff0_thd2~0_In-554930754) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-554930754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-554930754} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-554930754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-554930754, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-554930754|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:49:01,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2088620128 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2088620128 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2088620128 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-2088620128 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2088620128|)) (and (= ~y$r_buff1_thd2~0_In-2088620128 |P1Thread1of1ForFork1_#t~ite37_Out-2088620128|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2088620128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2088620128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2088620128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2088620128} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2088620128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2088620128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2088620128, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2088620128|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2088620128} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:49:01,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:49:01,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1247633138 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1247633138 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1247633138 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1247633138 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1247633138| ~y$w_buff1_used~0_In1247633138) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1247633138| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1247633138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247633138, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1247633138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1247633138} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1247633138|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1247633138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247633138, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1247633138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1247633138} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:49:01,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1300752854 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1300752854 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1300752854) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1300752854 ~y$r_buff0_thd1~0_Out-1300752854) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1300752854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1300752854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1300752854, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1300752854|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1300752854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:49:01,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In42848136 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In42848136 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In42848136 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In42848136 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out42848136|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In42848136 |P0Thread1of1ForFork0_#t~ite8_Out42848136|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In42848136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In42848136, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In42848136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42848136} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In42848136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In42848136, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out42848136|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In42848136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42848136} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:49:01,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:49:01,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:49:01,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out856670672| |ULTIMATE.start_main_#t~ite40_Out856670672|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In856670672 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In856670672 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out856670672| ~y~0_In856670672) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite40_Out856670672| ~y$w_buff1~0_In856670672) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In856670672, ~y~0=~y~0_In856670672, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In856670672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In856670672} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out856670672|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out856670672|, ~y$w_buff1~0=~y$w_buff1~0_In856670672, ~y~0=~y~0_In856670672, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In856670672, ~y$w_buff1_used~0=~y$w_buff1_used~0_In856670672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:49:01,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1016758246 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1016758246 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1016758246|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1016758246 |ULTIMATE.start_main_#t~ite42_Out1016758246|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1016758246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1016758246} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1016758246, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1016758246, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1016758246|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:49:01,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In825246873 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In825246873 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In825246873 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In825246873 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out825246873|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In825246873 |ULTIMATE.start_main_#t~ite43_Out825246873|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In825246873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825246873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In825246873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825246873} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In825246873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825246873, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out825246873|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In825246873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In825246873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:49:01,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In373956860 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In373956860 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In373956860 |ULTIMATE.start_main_#t~ite44_Out373956860|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out373956860| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In373956860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373956860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In373956860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373956860, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out373956860|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:49:01,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In282080704 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In282080704 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In282080704 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In282080704 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out282080704|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In282080704 |ULTIMATE.start_main_#t~ite45_Out282080704|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In282080704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282080704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In282080704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282080704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In282080704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In282080704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In282080704, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out282080704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In282080704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:49:01,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:49:01,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:49:01 BasicIcfg [2019-12-18 21:49:01,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:49:01,868 INFO L168 Benchmark]: Toolchain (without parser) took 13950.07 ms. Allocated memory was 146.8 MB in the beginning and 577.8 MB in the end (delta: 431.0 MB). Free memory was 102.7 MB in the beginning and 268.3 MB in the end (delta: -165.6 MB). Peak memory consumption was 265.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,868 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.00 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 158.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,871 INFO L168 Benchmark]: Boogie Preprocessor took 37.20 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,876 INFO L168 Benchmark]: RCFGBuilder took 774.27 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 110.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,877 INFO L168 Benchmark]: TraceAbstraction took 12237.13 ms. Allocated memory was 204.5 MB in the beginning and 577.8 MB in the end (delta: 373.3 MB). Free memory was 109.4 MB in the beginning and 268.3 MB in the end (delta: -158.9 MB). Peak memory consumption was 214.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:01,884 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.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 831.00 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 158.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.20 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.27 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 110.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12237.13 ms. Allocated memory was 204.5 MB in the beginning and 577.8 MB in the end (delta: 373.3 MB). Free memory was 109.4 MB in the beginning and 268.3 MB in the end (delta: -158.9 MB). Peak memory consumption was 214.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1479 SDtfs, 1344 SDslu, 2283 SDs, 0 SdLazy, 1226 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 6051 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 32356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...