/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:12:04,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:12:04,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:12:04,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:12:04,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:12:04,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:12:04,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:12:04,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:12:04,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:12:04,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:12:04,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:12:04,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:12:04,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:12:04,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:12:04,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:12:04,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:12:04,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:12:04,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:12:04,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:12:04,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:12:04,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:12:04,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:12:04,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:12:04,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:12:04,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:12:04,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:12:04,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:12:04,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:12:04,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:12:04,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:12:04,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:12:04,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:12:04,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:12:04,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:12:04,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:12:04,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:12:04,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:12:04,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:12:04,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:12:04,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:12:04,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:12:04,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:12:04,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:12:04,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:12:04,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:12:04,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:12:04,669 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:12:04,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:12:04,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:12:04,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:12:04,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:12:04,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:12:04,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:12:04,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:12:04,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:12:04,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:12:04,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:12:04,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:12:04,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:12:04,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:12:04,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:12:04,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:12:04,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:12:04,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:12:04,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:12:04,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:12:04,959 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:12:04,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-26 21:12:05,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c88b2de/19bba27c920940e389da639fbfa817f0/FLAG683304fef [2019-12-26 21:12:05,574 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:12:05,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_tso.oepc.i [2019-12-26 21:12:05,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c88b2de/19bba27c920940e389da639fbfa817f0/FLAG683304fef [2019-12-26 21:12:05,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c88b2de/19bba27c920940e389da639fbfa817f0 [2019-12-26 21:12:05,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:12:05,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:12:05,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:12:05,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:12:05,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:12:05,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:12:05" (1/1) ... [2019-12-26 21:12:05,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390492a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:05, skipping insertion in model container [2019-12-26 21:12:05,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:12:05" (1/1) ... [2019-12-26 21:12:05,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:12:05,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:12:06,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:12:06,424 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:12:06,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:12:06,570 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:12:06,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06 WrapperNode [2019-12-26 21:12:06,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:12:06,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:12:06,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:12:06,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:12:06,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:12:06,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:12:06,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:12:06,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:12:06,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (1/1) ... [2019-12-26 21:12:06,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:12:06,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:12:06,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:12:06,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:12:06,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (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-26 21:12:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:12:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:12:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:12:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:12:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:12:06,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:12:06,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:12:06,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:12:06,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:12:06,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:12:06,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:12:06,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:12:06,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:12:06,751 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:12:07,539 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:12:07,539 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:12:07,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:12:07 BoogieIcfgContainer [2019-12-26 21:12:07,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:12:07,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:12:07,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:12:07,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:12:07,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:12:05" (1/3) ... [2019-12-26 21:12:07,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca2fafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:12:07, skipping insertion in model container [2019-12-26 21:12:07,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:12:06" (2/3) ... [2019-12-26 21:12:07,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca2fafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:12:07, skipping insertion in model container [2019-12-26 21:12:07,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:12:07" (3/3) ... [2019-12-26 21:12:07,555 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_tso.oepc.i [2019-12-26 21:12:07,566 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:12:07,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:12:07,579 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:12:07,580 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:12:07,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,722 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,724 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,735 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:12:07,760 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:12:07,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:12:07,782 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:12:07,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:12:07,782 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:12:07,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:12:07,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:12:07,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:12:07,783 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:12:07,803 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:12:07,806 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:12:07,917 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:12:07,918 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:12:07,934 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:12:07,958 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:12:08,015 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:12:08,016 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:12:08,024 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:12:08,047 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:12:08,048 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:12:13,346 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:12:13,492 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:12:13,835 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-26 21:12:13,835 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:12:13,839 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 21:12:34,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:12:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:12:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:12:34,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:34,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:12:34,313 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-26 21:12:34,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:34,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255333313] [2019-12-26 21:12:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:34,569 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-26 21:12:34,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255333313] [2019-12-26 21:12:34,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:34,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:12:34,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859476762] [2019-12-26 21:12:34,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:34,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:34,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:34,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:34,591 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:12:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:38,369 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-26 21:12:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:38,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:12:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:39,100 INFO L225 Difference]: With dead ends: 119613 [2019-12-26 21:12:39,100 INFO L226 Difference]: Without dead ends: 105755 [2019-12-26 21:12:39,102 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-26 21:12:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-26 21:12:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-26 21:12:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-26 21:12:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-26 21:12:49,490 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-26 21:12:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:49,491 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-26 21:12:49,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-26 21:12:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:12:49,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:49,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:49,496 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:49,496 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-26 21:12:49,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:49,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357204958] [2019-12-26 21:12:49,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:49,602 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-26 21:12:49,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357204958] [2019-12-26 21:12:49,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:49,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:49,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737896459] [2019-12-26 21:12:49,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:49,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:49,605 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-26 21:12:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:55,767 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-26 21:12:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:12:55,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:12:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:56,517 INFO L225 Difference]: With dead ends: 168845 [2019-12-26 21:12:56,517 INFO L226 Difference]: Without dead ends: 168747 [2019-12-26 21:12:56,518 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-26 21:13:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-26 21:13:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-26 21:13:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-26 21:13:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-26 21:13:11,436 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-26 21:13:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:11,436 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-26 21:13:11,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:13:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-26 21:13:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:13:11,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:11,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:11,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-26 21:13:11,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:11,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852695127] [2019-12-26 21:13:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:11,517 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-26 21:13:11,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852695127] [2019-12-26 21:13:11,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:11,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:11,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679867519] [2019-12-26 21:13:11,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:11,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:11,520 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-26 21:13:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:11,652 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-26 21:13:11,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:11,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:13:11,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:11,709 INFO L225 Difference]: With dead ends: 33476 [2019-12-26 21:13:11,709 INFO L226 Difference]: Without dead ends: 33476 [2019-12-26 21:13:11,709 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-26 21:13:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-26 21:13:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-26 21:13:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-26 21:13:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-26 21:13:12,398 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-26 21:13:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-26 21:13:12,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-26 21:13:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:13:12,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:12,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:12,402 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-26 21:13:12,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:12,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701804386] [2019-12-26 21:13:12,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:12,520 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-26 21:13:12,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701804386] [2019-12-26 21:13:12,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:12,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:12,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163266600] [2019-12-26 21:13:12,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:13:12,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:13:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:13:12,524 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-26 21:13:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:12,879 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-26 21:13:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:13:12,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:13:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:12,973 INFO L225 Difference]: With dead ends: 41508 [2019-12-26 21:13:12,973 INFO L226 Difference]: Without dead ends: 41508 [2019-12-26 21:13:12,974 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-26 21:13:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-26 21:13:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-26 21:13:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-26 21:13:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-26 21:13:14,938 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-26 21:13:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:14,939 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-26 21:13:14,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:13:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-26 21:13:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:13:14,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:14,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:14,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-26 21:13:14,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:14,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33855350] [2019-12-26 21:13:14,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:14,991 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-26 21:13:14,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33855350] [2019-12-26 21:13:14,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:14,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:14,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88114469] [2019-12-26 21:13:14,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:14,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:14,993 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-26 21:13:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:15,188 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-26 21:13:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:15,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:13:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:15,283 INFO L225 Difference]: With dead ends: 54855 [2019-12-26 21:13:15,284 INFO L226 Difference]: Without dead ends: 54855 [2019-12-26 21:13:15,284 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-26 21:13:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-26 21:13:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-26 21:13:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-26 21:13:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-26 21:13:16,112 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-26 21:13:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:16,112 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-26 21:13:16,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-26 21:13:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:13:16,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:16,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:16,116 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-26 21:13:16,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:16,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551004309] [2019-12-26 21:13:16,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:16,184 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-26 21:13:16,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551004309] [2019-12-26 21:13:16,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:16,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079928210] [2019-12-26 21:13:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:13:16,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:13:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:13:16,186 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-26 21:13:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:16,554 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-26 21:13:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:13:16,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:13:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:16,638 INFO L225 Difference]: With dead ends: 49903 [2019-12-26 21:13:16,638 INFO L226 Difference]: Without dead ends: 49903 [2019-12-26 21:13:16,638 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-26 21:13:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-26 21:13:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-26 21:13:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-26 21:13:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-26 21:13:18,117 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-26 21:13:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:18,118 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-26 21:13:18,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:13:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-26 21:13:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:13:18,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:18,127 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] [2019-12-26 21:13:18,127 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-26 21:13:18,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:18,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471257401] [2019-12-26 21:13:18,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:18,217 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-26 21:13:18,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471257401] [2019-12-26 21:13:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:18,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323917106] [2019-12-26 21:13:18,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:18,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:18,219 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-26 21:13:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:18,888 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-26 21:13:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:13:18,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:13:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:18,989 INFO L225 Difference]: With dead ends: 59763 [2019-12-26 21:13:18,990 INFO L226 Difference]: Without dead ends: 59749 [2019-12-26 21:13:18,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:13:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-26 21:13:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-26 21:13:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-26 21:13:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-26 21:13:20,795 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-26 21:13:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:20,795 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-26 21:13:20,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-26 21:13:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:13:20,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:20,805 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] [2019-12-26 21:13:20,806 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-26 21:13:20,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:20,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870725445] [2019-12-26 21:13:20,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:20,871 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-26 21:13:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870725445] [2019-12-26 21:13:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:20,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:20,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934386038] [2019-12-26 21:13:20,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:20,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:20,873 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-26 21:13:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:21,560 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-26 21:13:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:13:21,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:13:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:21,674 INFO L225 Difference]: With dead ends: 62779 [2019-12-26 21:13:21,674 INFO L226 Difference]: Without dead ends: 62765 [2019-12-26 21:13:21,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:13:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-26 21:13:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-26 21:13:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-26 21:13:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-26 21:13:22,545 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-26 21:13:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:22,546 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-26 21:13:22,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-26 21:13:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:13:22,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:22,557 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-26 21:13:22,557 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-26 21:13:22,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:22,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182827632] [2019-12-26 21:13:22,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:22,610 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-26 21:13:22,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182827632] [2019-12-26 21:13:22,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:22,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:22,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213646385] [2019-12-26 21:13:22,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:13:22,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:22,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:13:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:13:22,613 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-26 21:13:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:22,698 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-26 21:13:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:13:22,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:13:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:22,724 INFO L225 Difference]: With dead ends: 17503 [2019-12-26 21:13:22,725 INFO L226 Difference]: Without dead ends: 17503 [2019-12-26 21:13:22,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:13:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-26 21:13:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-26 21:13:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:13:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-26 21:13:23,601 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-26 21:13:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:23,601 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-26 21:13:23,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:13:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-26 21:13:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:13:23,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:23,617 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-26 21:13:23,618 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-26 21:13:23,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:23,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228639784] [2019-12-26 21:13:23,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:23,671 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-26 21:13:23,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228639784] [2019-12-26 21:13:23,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:23,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:23,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892509765] [2019-12-26 21:13:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:23,673 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-26 21:13:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:23,795 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-26 21:13:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:23,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:13:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:23,827 INFO L225 Difference]: With dead ends: 22571 [2019-12-26 21:13:23,828 INFO L226 Difference]: Without dead ends: 22571 [2019-12-26 21:13:23,828 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-26 21:13:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-26 21:13:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-26 21:13:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:13:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-26 21:13:24,127 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-26 21:13:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:24,127 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-26 21:13:24,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-26 21:13:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:13:24,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:24,139 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-26 21:13:24,140 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-26 21:13:24,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:24,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134125692] [2019-12-26 21:13:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:24,201 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-26 21:13:24,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134125692] [2019-12-26 21:13:24,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:24,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:24,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116533243] [2019-12-26 21:13:24,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:24,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:24,204 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-26 21:13:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:24,538 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-26 21:13:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:13:24,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:13:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:24,577 INFO L225 Difference]: With dead ends: 21146 [2019-12-26 21:13:24,577 INFO L226 Difference]: Without dead ends: 21146 [2019-12-26 21:13:24,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-26 21:13:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-26 21:13:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-26 21:13:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-26 21:13:24,908 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-26 21:13:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:24,908 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-26 21:13:24,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-26 21:13:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:13:24,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:24,923 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-26 21:13:24,923 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-26 21:13:24,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:24,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067024649] [2019-12-26 21:13:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:24,994 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-26 21:13:24,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067024649] [2019-12-26 21:13:24,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:24,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:24,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677533612] [2019-12-26 21:13:24,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:24,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:24,996 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-26 21:13:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:25,381 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-26 21:13:25,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:13:25,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:13:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:25,410 INFO L225 Difference]: With dead ends: 23192 [2019-12-26 21:13:25,410 INFO L226 Difference]: Without dead ends: 23192 [2019-12-26 21:13:25,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-26 21:13:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-26 21:13:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-26 21:13:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-26 21:13:27,377 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-26 21:13:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:27,377 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-26 21:13:27,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-26 21:13:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:13:27,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:27,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:27,398 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-26 21:13:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:27,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452936980] [2019-12-26 21:13:27,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:27,468 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-26 21:13:27,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452936980] [2019-12-26 21:13:27,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:27,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:13:27,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128091093] [2019-12-26 21:13:27,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:13:27,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:13:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:13:27,470 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-26 21:13:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:28,223 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-26 21:13:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:13:28,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 21:13:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:28,260 INFO L225 Difference]: With dead ends: 26785 [2019-12-26 21:13:28,261 INFO L226 Difference]: Without dead ends: 26785 [2019-12-26 21:13:28,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:13:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-26 21:13:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-26 21:13:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-26 21:13:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-26 21:13:28,641 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-26 21:13:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:28,642 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-26 21:13:28,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:13:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-26 21:13:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:13:28,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:28,663 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] [2019-12-26 21:13:28,663 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-26 21:13:28,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:28,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634909641] [2019-12-26 21:13:28,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:28,758 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-26 21:13:28,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634909641] [2019-12-26 21:13:28,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:28,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:13:28,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290265668] [2019-12-26 21:13:28,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:13:28,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:13:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:13:28,760 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-26 21:13:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:29,522 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-26 21:13:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:13:29,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 21:13:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:29,559 INFO L225 Difference]: With dead ends: 25915 [2019-12-26 21:13:29,559 INFO L226 Difference]: Without dead ends: 25915 [2019-12-26 21:13:29,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:13:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-26 21:13:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-26 21:13:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-26 21:13:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-26 21:13:29,907 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-26 21:13:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:29,907 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-26 21:13:29,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:13:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-26 21:13:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:13:29,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:29,926 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] [2019-12-26 21:13:29,926 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-26 21:13:29,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:29,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753023003] [2019-12-26 21:13:29,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:29,997 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-26 21:13:29,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753023003] [2019-12-26 21:13:29,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:29,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:13:29,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950920742] [2019-12-26 21:13:29,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:29,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:29,999 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-26 21:13:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:30,068 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-26 21:13:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:30,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:13:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:30,104 INFO L225 Difference]: With dead ends: 17953 [2019-12-26 21:13:30,104 INFO L226 Difference]: Without dead ends: 17953 [2019-12-26 21:13:30,106 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-26 21:13:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-26 21:13:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-26 21:13:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-26 21:13:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-26 21:13:30,593 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-26 21:13:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:30,593 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-26 21:13:30,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-26 21:13:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:13:30,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:30,611 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] [2019-12-26 21:13:30,611 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-26 21:13:30,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:30,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998866932] [2019-12-26 21:13:30,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:30,730 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-26 21:13:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998866932] [2019-12-26 21:13:30,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:30,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:30,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606510884] [2019-12-26 21:13:30,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:30,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:30,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:30,734 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 3 states. [2019-12-26 21:13:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:30,821 INFO L93 Difference]: Finished difference Result 17953 states and 53342 transitions. [2019-12-26 21:13:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:30,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:13:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:30,854 INFO L225 Difference]: With dead ends: 17953 [2019-12-26 21:13:30,854 INFO L226 Difference]: Without dead ends: 17953 [2019-12-26 21:13:30,855 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-26 21:13:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-26 21:13:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 16037. [2019-12-26 21:13:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16037 states. [2019-12-26 21:13:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16037 states to 16037 states and 48092 transitions. [2019-12-26 21:13:31,368 INFO L78 Accepts]: Start accepts. Automaton has 16037 states and 48092 transitions. Word has length 40 [2019-12-26 21:13:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:31,369 INFO L462 AbstractCegarLoop]: Abstraction has 16037 states and 48092 transitions. [2019-12-26 21:13:31,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16037 states and 48092 transitions. [2019-12-26 21:13:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:13:31,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:31,391 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] [2019-12-26 21:13:31,391 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash -935567252, now seen corresponding path program 1 times [2019-12-26 21:13:31,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:31,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493882070] [2019-12-26 21:13:31,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:31,465 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-26 21:13:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493882070] [2019-12-26 21:13:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:13:31,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470789312] [2019-12-26 21:13:31,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:31,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:31,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:31,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:31,467 INFO L87 Difference]: Start difference. First operand 16037 states and 48092 transitions. Second operand 5 states. [2019-12-26 21:13:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:31,546 INFO L93 Difference]: Finished difference Result 14868 states and 45573 transitions. [2019-12-26 21:13:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:13:31,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:13:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:31,571 INFO L225 Difference]: With dead ends: 14868 [2019-12-26 21:13:31,571 INFO L226 Difference]: Without dead ends: 14868 [2019-12-26 21:13:31,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14868 states. [2019-12-26 21:13:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14868 to 14868. [2019-12-26 21:13:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14868 states. [2019-12-26 21:13:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14868 states to 14868 states and 45573 transitions. [2019-12-26 21:13:31,879 INFO L78 Accepts]: Start accepts. Automaton has 14868 states and 45573 transitions. Word has length 41 [2019-12-26 21:13:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:31,879 INFO L462 AbstractCegarLoop]: Abstraction has 14868 states and 45573 transitions. [2019-12-26 21:13:31,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 14868 states and 45573 transitions. [2019-12-26 21:13:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:13:31,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:31,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:31,900 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash -344664589, now seen corresponding path program 1 times [2019-12-26 21:13:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:31,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630938249] [2019-12-26 21:13:31,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:31,987 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-26 21:13:31,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630938249] [2019-12-26 21:13:31,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:31,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:13:31,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880003982] [2019-12-26 21:13:31,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:13:31,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:13:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:31,993 INFO L87 Difference]: Start difference. First operand 14868 states and 45573 transitions. Second operand 7 states. [2019-12-26 21:13:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:32,493 INFO L93 Difference]: Finished difference Result 43451 states and 132340 transitions. [2019-12-26 21:13:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:13:32,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:13:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:32,537 INFO L225 Difference]: With dead ends: 43451 [2019-12-26 21:13:32,538 INFO L226 Difference]: Without dead ends: 33731 [2019-12-26 21:13:32,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:13:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33731 states. [2019-12-26 21:13:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33731 to 18516. [2019-12-26 21:13:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18516 states. [2019-12-26 21:13:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 56848 transitions. [2019-12-26 21:13:32,946 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 56848 transitions. Word has length 65 [2019-12-26 21:13:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:32,946 INFO L462 AbstractCegarLoop]: Abstraction has 18516 states and 56848 transitions. [2019-12-26 21:13:32,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:13:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 56848 transitions. [2019-12-26 21:13:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:13:32,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:32,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:32,971 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1662753005, now seen corresponding path program 2 times [2019-12-26 21:13:32,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:32,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641034967] [2019-12-26 21:13:32,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:33,237 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-26 21:13:33,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641034967] [2019-12-26 21:13:33,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:33,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:13:33,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916636150] [2019-12-26 21:13:33,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:13:33,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:13:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:33,240 INFO L87 Difference]: Start difference. First operand 18516 states and 56848 transitions. Second operand 7 states. [2019-12-26 21:13:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:33,730 INFO L93 Difference]: Finished difference Result 49218 states and 148223 transitions. [2019-12-26 21:13:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:13:33,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:13:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:33,778 INFO L225 Difference]: With dead ends: 49218 [2019-12-26 21:13:33,778 INFO L226 Difference]: Without dead ends: 35999 [2019-12-26 21:13:33,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:13:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35999 states. [2019-12-26 21:13:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35999 to 21947. [2019-12-26 21:13:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21947 states. [2019-12-26 21:13:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21947 states to 21947 states and 66970 transitions. [2019-12-26 21:13:34,217 INFO L78 Accepts]: Start accepts. Automaton has 21947 states and 66970 transitions. Word has length 65 [2019-12-26 21:13:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:34,218 INFO L462 AbstractCegarLoop]: Abstraction has 21947 states and 66970 transitions. [2019-12-26 21:13:34,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:13:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21947 states and 66970 transitions. [2019-12-26 21:13:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:13:34,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:34,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:34,239 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1251052155, now seen corresponding path program 3 times [2019-12-26 21:13:34,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:34,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084012598] [2019-12-26 21:13:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:34,335 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-26 21:13:34,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084012598] [2019-12-26 21:13:34,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:34,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:13:34,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397629002] [2019-12-26 21:13:34,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:13:34,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:34,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:13:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:34,338 INFO L87 Difference]: Start difference. First operand 21947 states and 66970 transitions. Second operand 7 states. [2019-12-26 21:13:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:34,762 INFO L93 Difference]: Finished difference Result 42421 states and 127518 transitions. [2019-12-26 21:13:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:13:34,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:13:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:34,822 INFO L225 Difference]: With dead ends: 42421 [2019-12-26 21:13:34,822 INFO L226 Difference]: Without dead ends: 39710 [2019-12-26 21:13:34,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:13:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2019-12-26 21:13:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 22043. [2019-12-26 21:13:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22043 states. [2019-12-26 21:13:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22043 states to 22043 states and 67314 transitions. [2019-12-26 21:13:35,329 INFO L78 Accepts]: Start accepts. Automaton has 22043 states and 67314 transitions. Word has length 65 [2019-12-26 21:13:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:35,329 INFO L462 AbstractCegarLoop]: Abstraction has 22043 states and 67314 transitions. [2019-12-26 21:13:35,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:13:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22043 states and 67314 transitions. [2019-12-26 21:13:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:13:35,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:35,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:35,355 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 4 times [2019-12-26 21:13:35,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875735336] [2019-12-26 21:13:35,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:35,411 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-26 21:13:35,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875735336] [2019-12-26 21:13:35,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:35,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555475522] [2019-12-26 21:13:35,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:35,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:35,413 INFO L87 Difference]: Start difference. First operand 22043 states and 67314 transitions. Second operand 3 states. [2019-12-26 21:13:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:35,737 INFO L93 Difference]: Finished difference Result 25110 states and 76797 transitions. [2019-12-26 21:13:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:35,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:13:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:35,783 INFO L225 Difference]: With dead ends: 25110 [2019-12-26 21:13:35,783 INFO L226 Difference]: Without dead ends: 25110 [2019-12-26 21:13:35,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 21:13:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25110 states. [2019-12-26 21:13:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25110 to 20735. [2019-12-26 21:13:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-26 21:13:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 64104 transitions. [2019-12-26 21:13:36,135 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 64104 transitions. Word has length 65 [2019-12-26 21:13:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:36,135 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 64104 transitions. [2019-12-26 21:13:36,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 64104 transitions. [2019-12-26 21:13:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:13:36,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:36,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:13:36,166 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1928104461, now seen corresponding path program 1 times [2019-12-26 21:13:36,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:36,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440056622] [2019-12-26 21:13:36,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:36,245 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-26 21:13:36,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440056622] [2019-12-26 21:13:36,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:36,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:13:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159874557] [2019-12-26 21:13:36,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:13:36,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:13:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:13:36,247 INFO L87 Difference]: Start difference. First operand 20735 states and 64104 transitions. Second operand 7 states. [2019-12-26 21:13:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:36,745 INFO L93 Difference]: Finished difference Result 43564 states and 133585 transitions. [2019-12-26 21:13:36,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:13:36,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 21:13:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:36,806 INFO L225 Difference]: With dead ends: 43564 [2019-12-26 21:13:36,806 INFO L226 Difference]: Without dead ends: 40319 [2019-12-26 21:13:36,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:13:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40319 states. [2019-12-26 21:13:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40319 to 20867. [2019-12-26 21:13:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2019-12-26 21:13:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 64616 transitions. [2019-12-26 21:13:37,311 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 64616 transitions. Word has length 66 [2019-12-26 21:13:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:37,311 INFO L462 AbstractCegarLoop]: Abstraction has 20867 states and 64616 transitions. [2019-12-26 21:13:37,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:13:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 64616 transitions. [2019-12-26 21:13:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:13:37,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:37,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:37,335 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash 104538735, now seen corresponding path program 2 times [2019-12-26 21:13:37,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:37,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749496842] [2019-12-26 21:13:37,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:37,403 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-26 21:13:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749496842] [2019-12-26 21:13:37,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:37,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:13:37,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542215478] [2019-12-26 21:13:37,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:13:37,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:13:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:13:37,405 INFO L87 Difference]: Start difference. First operand 20867 states and 64616 transitions. Second operand 4 states. [2019-12-26 21:13:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:37,552 INFO L93 Difference]: Finished difference Result 20682 states and 63880 transitions. [2019-12-26 21:13:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:13:37,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:13:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:37,579 INFO L225 Difference]: With dead ends: 20682 [2019-12-26 21:13:37,580 INFO L226 Difference]: Without dead ends: 20682 [2019-12-26 21:13:37,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20682 states. [2019-12-26 21:13:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20682 to 19455. [2019-12-26 21:13:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-12-26 21:13:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 60082 transitions. [2019-12-26 21:13:38,085 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 60082 transitions. Word has length 66 [2019-12-26 21:13:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:38,085 INFO L462 AbstractCegarLoop]: Abstraction has 19455 states and 60082 transitions. [2019-12-26 21:13:38,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:13:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 60082 transitions. [2019-12-26 21:13:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:13:38,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:38,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:38,106 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1162997979, now seen corresponding path program 1 times [2019-12-26 21:13:38,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:38,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974818542] [2019-12-26 21:13:38,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:38,196 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-26 21:13:38,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974818542] [2019-12-26 21:13:38,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:38,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:13:38,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878841777] [2019-12-26 21:13:38,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:13:38,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:13:38,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:13:38,199 INFO L87 Difference]: Start difference. First operand 19455 states and 60082 transitions. Second operand 3 states. [2019-12-26 21:13:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:38,272 INFO L93 Difference]: Finished difference Result 16709 states and 50483 transitions. [2019-12-26 21:13:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:13:38,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:13:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:38,298 INFO L225 Difference]: With dead ends: 16709 [2019-12-26 21:13:38,298 INFO L226 Difference]: Without dead ends: 16709 [2019-12-26 21:13:38,298 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-26 21:13:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16709 states. [2019-12-26 21:13:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16709 to 15085. [2019-12-26 21:13:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15085 states. [2019-12-26 21:13:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 45535 transitions. [2019-12-26 21:13:38,547 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 45535 transitions. Word has length 66 [2019-12-26 21:13:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:38,547 INFO L462 AbstractCegarLoop]: Abstraction has 15085 states and 45535 transitions. [2019-12-26 21:13:38,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:13:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 45535 transitions. [2019-12-26 21:13:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:38,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:38,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:38,563 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash -543525966, now seen corresponding path program 1 times [2019-12-26 21:13:38,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:38,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237802489] [2019-12-26 21:13:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:38,796 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-26 21:13:38,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237802489] [2019-12-26 21:13:38,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:38,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:13:38,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86517782] [2019-12-26 21:13:38,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:13:38,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:38,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:13:38,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:13:38,799 INFO L87 Difference]: Start difference. First operand 15085 states and 45535 transitions. Second operand 10 states. [2019-12-26 21:13:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:40,246 INFO L93 Difference]: Finished difference Result 22528 states and 67687 transitions. [2019-12-26 21:13:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:13:40,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:13:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:40,287 INFO L225 Difference]: With dead ends: 22528 [2019-12-26 21:13:40,288 INFO L226 Difference]: Without dead ends: 18655 [2019-12-26 21:13:40,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:13:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18655 states. [2019-12-26 21:13:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18655 to 15486. [2019-12-26 21:13:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-26 21:13:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46650 transitions. [2019-12-26 21:13:40,721 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46650 transitions. Word has length 67 [2019-12-26 21:13:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:40,722 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46650 transitions. [2019-12-26 21:13:40,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:13:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46650 transitions. [2019-12-26 21:13:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:40,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:40,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:40,737 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1737332378, now seen corresponding path program 2 times [2019-12-26 21:13:40,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:40,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786892277] [2019-12-26 21:13:40,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:40,925 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-26 21:13:40,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786892277] [2019-12-26 21:13:40,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:40,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:13:40,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288006142] [2019-12-26 21:13:40,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:13:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:13:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:13:40,927 INFO L87 Difference]: Start difference. First operand 15486 states and 46650 transitions. Second operand 11 states. [2019-12-26 21:13:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:42,241 INFO L93 Difference]: Finished difference Result 20850 states and 62350 transitions. [2019-12-26 21:13:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:13:42,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:13:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:42,266 INFO L225 Difference]: With dead ends: 20850 [2019-12-26 21:13:42,266 INFO L226 Difference]: Without dead ends: 18415 [2019-12-26 21:13:42,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:13:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18415 states. [2019-12-26 21:13:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18415 to 15406. [2019-12-26 21:13:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-26 21:13:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 46410 transitions. [2019-12-26 21:13:42,675 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 46410 transitions. Word has length 67 [2019-12-26 21:13:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:42,675 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 46410 transitions. [2019-12-26 21:13:42,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:13:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 46410 transitions. [2019-12-26 21:13:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:42,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:42,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:42,691 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 202288426, now seen corresponding path program 3 times [2019-12-26 21:13:42,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:42,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795036392] [2019-12-26 21:13:42,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:42,827 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-26 21:13:42,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795036392] [2019-12-26 21:13:42,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:42,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:13:42,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911289195] [2019-12-26 21:13:42,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:13:42,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:13:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:13:42,829 INFO L87 Difference]: Start difference. First operand 15406 states and 46410 transitions. Second operand 10 states. [2019-12-26 21:13:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:44,115 INFO L93 Difference]: Finished difference Result 23323 states and 69368 transitions. [2019-12-26 21:13:44,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:13:44,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:13:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:44,142 INFO L225 Difference]: With dead ends: 23323 [2019-12-26 21:13:44,142 INFO L226 Difference]: Without dead ends: 19998 [2019-12-26 21:13:44,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:13:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-12-26 21:13:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 15790. [2019-12-26 21:13:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-26 21:13:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 47396 transitions. [2019-12-26 21:13:44,424 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 47396 transitions. Word has length 67 [2019-12-26 21:13:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:44,424 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 47396 transitions. [2019-12-26 21:13:44,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:13:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 47396 transitions. [2019-12-26 21:13:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:44,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:44,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:44,441 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 4 times [2019-12-26 21:13:44,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:44,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408308140] [2019-12-26 21:13:44,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:44,618 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-26 21:13:44,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408308140] [2019-12-26 21:13:44,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:44,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:13:44,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852707808] [2019-12-26 21:13:44,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:13:44,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:44,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:13:44,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:13:44,621 INFO L87 Difference]: Start difference. First operand 15790 states and 47396 transitions. Second operand 11 states. [2019-12-26 21:13:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:46,057 INFO L93 Difference]: Finished difference Result 22253 states and 66116 transitions. [2019-12-26 21:13:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:13:46,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:13:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:46,084 INFO L225 Difference]: With dead ends: 22253 [2019-12-26 21:13:46,084 INFO L226 Difference]: Without dead ends: 19642 [2019-12-26 21:13:46,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:13:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2019-12-26 21:13:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 15486. [2019-12-26 21:13:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-26 21:13:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 46480 transitions. [2019-12-26 21:13:46,363 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 46480 transitions. Word has length 67 [2019-12-26 21:13:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:46,364 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 46480 transitions. [2019-12-26 21:13:46,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:13:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 46480 transitions. [2019-12-26 21:13:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:46,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:46,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:46,380 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 668274002, now seen corresponding path program 5 times [2019-12-26 21:13:46,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:46,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354811398] [2019-12-26 21:13:46,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:46,881 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-26 21:13:46,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354811398] [2019-12-26 21:13:46,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:46,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:13:46,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557930669] [2019-12-26 21:13:46,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:13:46,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:13:46,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:13:46,883 INFO L87 Difference]: Start difference. First operand 15486 states and 46480 transitions. Second operand 16 states. [2019-12-26 21:13:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:50,679 INFO L93 Difference]: Finished difference Result 25947 states and 75967 transitions. [2019-12-26 21:13:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 21:13:50,680 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 21:13:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:50,710 INFO L225 Difference]: With dead ends: 25947 [2019-12-26 21:13:50,710 INFO L226 Difference]: Without dead ends: 23012 [2019-12-26 21:13:50,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 21:13:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23012 states. [2019-12-26 21:13:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23012 to 16953. [2019-12-26 21:13:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-26 21:13:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50422 transitions. [2019-12-26 21:13:51,002 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50422 transitions. Word has length 67 [2019-12-26 21:13:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:51,002 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50422 transitions. [2019-12-26 21:13:51,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:13:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50422 transitions. [2019-12-26 21:13:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:51,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:51,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:51,019 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1241758622, now seen corresponding path program 6 times [2019-12-26 21:13:51,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:51,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751026268] [2019-12-26 21:13:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:51,189 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-26 21:13:51,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751026268] [2019-12-26 21:13:51,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:51,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:13:51,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428203549] [2019-12-26 21:13:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:13:51,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:13:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:13:51,191 INFO L87 Difference]: Start difference. First operand 16953 states and 50422 transitions. Second operand 11 states. [2019-12-26 21:13:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:52,362 INFO L93 Difference]: Finished difference Result 33804 states and 100025 transitions. [2019-12-26 21:13:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:13:52,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:13:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:52,403 INFO L225 Difference]: With dead ends: 33804 [2019-12-26 21:13:52,403 INFO L226 Difference]: Without dead ends: 31889 [2019-12-26 21:13:52,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:13:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31889 states. [2019-12-26 21:13:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31889 to 19047. [2019-12-26 21:13:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19047 states. [2019-12-26 21:13:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19047 states to 19047 states and 56499 transitions. [2019-12-26 21:13:52,791 INFO L78 Accepts]: Start accepts. Automaton has 19047 states and 56499 transitions. Word has length 67 [2019-12-26 21:13:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:52,791 INFO L462 AbstractCegarLoop]: Abstraction has 19047 states and 56499 transitions. [2019-12-26 21:13:52,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:13:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 19047 states and 56499 transitions. [2019-12-26 21:13:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:52,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:52,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:52,811 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1213952882, now seen corresponding path program 7 times [2019-12-26 21:13:52,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:52,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163594597] [2019-12-26 21:13:52,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:52,974 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-26 21:13:52,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163594597] [2019-12-26 21:13:52,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:52,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:13:52,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248256660] [2019-12-26 21:13:52,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:13:52,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:13:52,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:13:52,976 INFO L87 Difference]: Start difference. First operand 19047 states and 56499 transitions. Second operand 11 states. [2019-12-26 21:13:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:54,123 INFO L93 Difference]: Finished difference Result 32421 states and 95287 transitions. [2019-12-26 21:13:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:13:54,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:13:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:54,160 INFO L225 Difference]: With dead ends: 32421 [2019-12-26 21:13:54,160 INFO L226 Difference]: Without dead ends: 27133 [2019-12-26 21:13:54,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:13:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27133 states. [2019-12-26 21:13:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27133 to 15645. [2019-12-26 21:13:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15645 states. [2019-12-26 21:13:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15645 states to 15645 states and 46703 transitions. [2019-12-26 21:13:54,481 INFO L78 Accepts]: Start accepts. Automaton has 15645 states and 46703 transitions. Word has length 67 [2019-12-26 21:13:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:54,481 INFO L462 AbstractCegarLoop]: Abstraction has 15645 states and 46703 transitions. [2019-12-26 21:13:54,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:13:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 15645 states and 46703 transitions. [2019-12-26 21:13:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:54,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:54,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:54,497 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 8 times [2019-12-26 21:13:54,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:54,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041092512] [2019-12-26 21:13:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:54,708 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-26 21:13:54,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041092512] [2019-12-26 21:13:54,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:54,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:13:54,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158170238] [2019-12-26 21:13:54,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:13:54,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:13:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:13:54,711 INFO L87 Difference]: Start difference. First operand 15645 states and 46703 transitions. Second operand 12 states. [2019-12-26 21:13:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:55,937 INFO L93 Difference]: Finished difference Result 27175 states and 80455 transitions. [2019-12-26 21:13:55,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:13:55,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:13:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:55,973 INFO L225 Difference]: With dead ends: 27175 [2019-12-26 21:13:55,973 INFO L226 Difference]: Without dead ends: 26960 [2019-12-26 21:13:55,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:13:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26960 states. [2019-12-26 21:13:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26960 to 15469. [2019-12-26 21:13:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-26 21:13:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 46231 transitions. [2019-12-26 21:13:56,296 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 46231 transitions. Word has length 67 [2019-12-26 21:13:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:56,297 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 46231 transitions. [2019-12-26 21:13:56,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:13:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 46231 transitions. [2019-12-26 21:13:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:56,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:56,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:56,313 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 9 times [2019-12-26 21:13:56,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:56,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861773636] [2019-12-26 21:13:56,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:13:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:13:56,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:13:56,437 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:13:56,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t83~0.offset_23|) (= v_~z$r_buff0_thd2~0_185 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t83~0.base_32|) |v_ULTIMATE.start_main_~#t83~0.offset_23| 0)) |v_#memory_int_21|) (= 0 v_~x~0_134) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t83~0.base_32|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32| 1)) (= v_~z~0_178 0) (= v_~z$r_buff1_thd0~0_195 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t83~0.base_32| 4) |v_#length_23|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t83~0.base_32|)) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t83~0.base=|v_ULTIMATE.start_main_~#t83~0.base_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_29|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_22|, ~y~0=v_~y~0_24, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t83~0.offset=|v_ULTIMATE.start_main_~#t83~0.offset_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t83~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t85~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t84~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t85~0.base, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t83~0.offset, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:56,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~x~0_In-1711995762 ~__unbuffered_p0_EAX~0_Out-1711995762) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1711995762 0)) (= 1 ~z$r_buff0_thd1~0_Out-1711995762) (= ~z$r_buff1_thd2~0_Out-1711995762 ~z$r_buff0_thd2~0_In-1711995762) (= ~z$r_buff0_thd1~0_In-1711995762 ~z$r_buff1_thd1~0_Out-1711995762) (= ~z$r_buff0_thd0~0_In-1711995762 ~z$r_buff1_thd0~0_Out-1711995762) (= ~z$r_buff1_thd3~0_Out-1711995762 ~z$r_buff0_thd3~0_In-1711995762)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1711995762, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1711995762, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1711995762, ~x~0=~x~0_In-1711995762, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1711995762} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1711995762, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1711995762, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1711995762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1711995762, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1711995762, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1711995762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1711995762, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1711995762, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1711995762, ~x~0=~x~0_In-1711995762, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1711995762} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:56,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t84~0.offset_10| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t84~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t84~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t84~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t84~0.base_11| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t84~0.base_11|) |v_ULTIMATE.start_main_~#t84~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t84~0.base=|v_ULTIMATE.start_main_~#t84~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t84~0.offset=|v_ULTIMATE.start_main_~#t84~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t84~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t84~0.offset] because there is no mapped edge [2019-12-26 21:13:56,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1523200072 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1523200072 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1523200072| |P1Thread1of1ForFork2_#t~ite10_Out1523200072|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1523200072| ~z$w_buff1~0_In1523200072) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1523200072| ~z~0_In1523200072)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1523200072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523200072, ~z$w_buff1~0=~z$w_buff1~0_In1523200072, ~z~0=~z~0_In1523200072} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1523200072|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1523200072, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1523200072|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523200072, ~z$w_buff1~0=~z$w_buff1~0_In1523200072, ~z~0=~z~0_In1523200072} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:13:56,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-321020768 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-321020768 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-321020768|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-321020768| ~z$w_buff0_used~0_In-321020768)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-321020768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-321020768|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-321020768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:13:56,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t85~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t85~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t85~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t85~0.base_11|) |v_ULTIMATE.start_main_~#t85~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t85~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t85~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t85~0.base=|v_ULTIMATE.start_main_~#t85~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t85~0.offset=|v_ULTIMATE.start_main_~#t85~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t85~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t85~0.offset] because there is no mapped edge [2019-12-26 21:13:56,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In181044970 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In181044970 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In181044970 |P0Thread1of1ForFork1_#t~ite5_Out181044970|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out181044970| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In181044970, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In181044970} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out181044970|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In181044970, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In181044970} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:13:56,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1505521307 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1505521307 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1505521307 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1505521307 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1505521307| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out1505521307| ~z$w_buff1_used~0_In1505521307) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1505521307, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1505521307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505521307, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1505521307} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1505521307, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1505521307|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1505521307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1505521307, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1505521307} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:13:56,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1180033965 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1180033965 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1180033965) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1180033965 ~z$r_buff0_thd1~0_In1180033965)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1180033965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1180033965, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1180033965|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1180033965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:56,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In2140922327 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2140922327 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2140922327 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In2140922327 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out2140922327| ~z$r_buff1_thd1~0_In2140922327)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out2140922327| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2140922327, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2140922327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2140922327, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2140922327} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2140922327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2140922327, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2140922327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2140922327, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2140922327} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:13:56,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:13:56,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In711003256 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In711003256 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In711003256 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In711003256 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out711003256| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out711003256| ~z$w_buff1_used~0_In711003256) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In711003256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In711003256, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In711003256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In711003256, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In711003256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In711003256, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out711003256|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In711003256} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:13:56,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-987362241 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-987362241 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-987362241| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-987362241 |P1Thread1of1ForFork2_#t~ite13_Out-987362241|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-987362241, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-987362241} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-987362241, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-987362241|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-987362241} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:13:56,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1432752775 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1432752775 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1432752775 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1432752775 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1432752775 |P1Thread1of1ForFork2_#t~ite14_Out1432752775|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1432752775|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1432752775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432752775, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1432752775} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1432752775, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1432752775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432752775, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1432752775|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1432752775} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:13:56,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:13:56,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In319565252 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In319565252 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In319565252 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In319565252 256))) (= 0 (mod ~z$w_buff0_used~0_In319565252 256)))) .cse1 (= ~z$w_buff1_used~0_In319565252 |P2Thread1of1ForFork0_#t~ite29_Out319565252|) (= |P2Thread1of1ForFork0_#t~ite29_Out319565252| |P2Thread1of1ForFork0_#t~ite30_Out319565252|)) (and (= ~z$w_buff1_used~0_In319565252 |P2Thread1of1ForFork0_#t~ite30_Out319565252|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In319565252| |P2Thread1of1ForFork0_#t~ite29_Out319565252|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In319565252, ~weak$$choice2~0=~weak$$choice2~0_In319565252, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In319565252|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In319565252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In319565252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319565252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In319565252, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out319565252|, ~weak$$choice2~0=~weak$$choice2~0_In319565252, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out319565252|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:13:56,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:13:56,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:13:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2015679079 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-2015679079 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-2015679079| ~z~0_In-2015679079) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-2015679079| ~z$w_buff1~0_In-2015679079) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2015679079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015679079, ~z$w_buff1~0=~z$w_buff1~0_In-2015679079, ~z~0=~z~0_In-2015679079} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2015679079|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2015679079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015679079, ~z$w_buff1~0=~z$w_buff1~0_In-2015679079, ~z~0=~z~0_In-2015679079} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:13:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:13:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1217325246 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1217325246 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1217325246| ~z$w_buff0_used~0_In-1217325246)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1217325246| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217325246} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217325246, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1217325246|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217325246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:13:56,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-90118885 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-90118885 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-90118885 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-90118885 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-90118885 |P2Thread1of1ForFork0_#t~ite41_Out-90118885|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-90118885|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-90118885, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-90118885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-90118885, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-90118885} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-90118885, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-90118885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-90118885, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-90118885, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-90118885|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:13:56,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1852812777 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852812777 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1852812777| ~z$r_buff0_thd3~0_In-1852812777)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1852812777| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852812777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1852812777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852812777, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1852812777, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1852812777|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:13:56,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1714178568 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1714178568 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1714178568 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1714178568 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1714178568 |P2Thread1of1ForFork0_#t~ite43_Out-1714178568|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1714178568| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1714178568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1714178568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1714178568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:13:56,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:13:56,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:13:56,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out2077026156| |ULTIMATE.start_main_#t~ite47_Out2077026156|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2077026156 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2077026156 256)))) (or (and .cse0 (= ~z~0_In2077026156 |ULTIMATE.start_main_#t~ite47_Out2077026156|) (or .cse1 .cse2)) (and .cse0 (= ~z$w_buff1~0_In2077026156 |ULTIMATE.start_main_#t~ite47_Out2077026156|) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077026156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077026156, ~z$w_buff1~0=~z$w_buff1~0_In2077026156, ~z~0=~z~0_In2077026156} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077026156, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2077026156|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077026156, ~z$w_buff1~0=~z$w_buff1~0_In2077026156, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2077026156|, ~z~0=~z~0_In2077026156} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:13:56,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1922287713 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1922287713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1922287713|)) (and (= ~z$w_buff0_used~0_In-1922287713 |ULTIMATE.start_main_#t~ite49_Out-1922287713|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922287713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922287713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1922287713|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:13:56,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-849178472 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-849178472 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-849178472 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-849178472 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-849178472| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-849178472 |ULTIMATE.start_main_#t~ite50_Out-849178472|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-849178472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-849178472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-849178472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849178472} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-849178472|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-849178472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-849178472, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-849178472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-849178472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:13:56,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1983509200 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1983509200 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1983509200 |ULTIMATE.start_main_#t~ite51_Out1983509200|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1983509200| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1983509200, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1983509200} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1983509200, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1983509200|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1983509200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:13:56,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1282287731 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1282287731 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1282287731 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1282287731 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1282287731|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In1282287731 |ULTIMATE.start_main_#t~ite52_Out1282287731|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1282287731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282287731} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1282287731|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1282287731, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1282287731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282287731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:13:56,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:13:56,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:13:56 BasicIcfg [2019-12-26 21:13:56,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:13:56,579 INFO L168 Benchmark]: Toolchain (without parser) took 110746.56 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,579 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.80 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,581 INFO L168 Benchmark]: Boogie Preprocessor took 51.47 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,581 INFO L168 Benchmark]: RCFGBuilder took 843.23 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 99.6 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,582 INFO L168 Benchmark]: TraceAbstraction took 109033.74 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 21:13:56,584 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.80 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 155.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.47 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.23 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 99.6 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109033.74 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t83, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t84, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t85, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7983 SDtfs, 8581 SDslu, 29368 SDs, 0 SdLazy, 15068 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 230299 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1474 NumberOfCodeBlocks, 1474 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 291667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...