/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:05:00,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:05:00,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:05:00,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:05:00,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:05:00,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:05:00,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:05:00,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:05:00,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:05:00,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:05:00,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:05:00,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:05:00,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:05:00,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:05:00,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:05:00,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:05:00,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:05:00,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:05:00,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:05:00,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:05:00,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:05:00,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:05:00,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:05:00,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:05:00,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:05:00,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:05:00,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:05:00,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:05:00,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:05:00,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:05:00,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:05:00,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:05:00,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:05:00,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:05:00,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:05:00,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:05:00,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:05:00,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:05:00,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:05:00,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:05:00,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:05:00,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:05:00,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:05:00,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:05:00,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:05:00,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:05:00,693 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:05:00,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:05:00,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:05:00,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:05:00,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:05:00,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:05:00,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:05:00,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:05:00,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:05:00,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:05:00,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:05:00,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:05:00,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:05:00,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:05:00,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:05:00,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:05:00,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:05:00,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:05:00,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:05:00,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:05:00,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:05:00,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:05:00,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:05:00,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:05:00,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:05:00,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:05:01,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:05:01,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:05:01,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:05:01,016 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:05:01,016 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-27 02:05:01,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b607acad/bc90a6fd3da84a6f86d12782c543da09/FLAGce508950f [2019-12-27 02:05:01,631 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:05:01,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-27 02:05:01,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b607acad/bc90a6fd3da84a6f86d12782c543da09/FLAGce508950f [2019-12-27 02:05:01,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b607acad/bc90a6fd3da84a6f86d12782c543da09 [2019-12-27 02:05:01,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:05:01,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:05:01,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:05:01,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:05:01,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:05:01,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:05:01" (1/1) ... [2019-12-27 02:05:01,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc7b548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:01, skipping insertion in model container [2019-12-27 02:05:01,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:05:01" (1/1) ... [2019-12-27 02:05:01,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:05:02,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:05:02,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:05:02,503 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:05:02,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:05:02,667 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:05:02,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02 WrapperNode [2019-12-27 02:05:02,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:05:02,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:05:02,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:05:02,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:05:02,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:05:02,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:05:02,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:05:02,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:05:02,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... [2019-12-27 02:05:02,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:05:02,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:05:02,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:05:02,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:05:02,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:05:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:05:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:05:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:05:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:05:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:05:02,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:05:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:05:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:05:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:05:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:05:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:05:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:05:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:05:02,850 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:05:03,653 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:05:03,653 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:05:03,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:05:03 BoogieIcfgContainer [2019-12-27 02:05:03,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:05:03,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:05:03,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:05:03,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:05:03,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:05:01" (1/3) ... [2019-12-27 02:05:03,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fd00d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:05:03, skipping insertion in model container [2019-12-27 02:05:03,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:05:02" (2/3) ... [2019-12-27 02:05:03,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fd00d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:05:03, skipping insertion in model container [2019-12-27 02:05:03,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:05:03" (3/3) ... [2019-12-27 02:05:03,664 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc.i [2019-12-27 02:05:03,675 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:05:03,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:05:03,683 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:05:03,684 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:05:03,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,776 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:05:03,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:05:03,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:05:03,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:05:03,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:05:03,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:05:03,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:05:03,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:05:03,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:05:03,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:05:03,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 02:05:03,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:05:04,001 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:05:04,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:05:04,017 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:05:04,040 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:05:04,096 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:05:04,096 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:05:04,105 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:05:04,126 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:05:04,127 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:05:10,156 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:05:10,275 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:05:10,305 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-27 02:05:10,305 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 02:05:10,308 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 02:05:28,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 02:05:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 02:05:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:05:28,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:05:28,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:05:28,277 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-27 02:05:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:05:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-27 02:05:28,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:05:28,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524115819] [2019-12-27 02:05:28,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:05:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:05:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:05:28,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524115819] [2019-12-27 02:05:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:05:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:05:28,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547334985] [2019-12-27 02:05:28,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:05:28,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:05:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:05:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:05:28,602 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 02:05:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:05:32,636 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-27 02:05:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:05:32,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:05:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:05:33,269 INFO L225 Difference]: With dead ends: 114158 [2019-12-27 02:05:33,269 INFO L226 Difference]: Without dead ends: 107060 [2019-12-27 02:05:33,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:05:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-27 02:05:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-27 02:05:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-27 02:05:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-27 02:05:44,090 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-27 02:05:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:05:44,090 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-27 02:05:44,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:05:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-27 02:05:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:05:44,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:05:44,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:05:44,096 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-27 02:05:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:05:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-27 02:05:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:05:44,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000161007] [2019-12-27 02:05:44,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:05:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:05:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:05:44,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000161007] [2019-12-27 02:05:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:05:44,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:05:44,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877633996] [2019-12-27 02:05:44,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:05:44,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:05:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:05:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:05:44,218 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-27 02:05:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:05:49,391 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-27 02:05:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:05:49,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:05:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:05:49,971 INFO L225 Difference]: With dead ends: 166396 [2019-12-27 02:05:49,972 INFO L226 Difference]: Without dead ends: 166347 [2019-12-27 02:05:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:05:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-27 02:05:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-27 02:05:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-27 02:06:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-27 02:06:06,621 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-27 02:06:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:06,622 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-27 02:06:06,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:06:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-27 02:06:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:06:06,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:06,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:06:06,629 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-27 02:06:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-27 02:06:06,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:06,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432831669] [2019-12-27 02:06:06,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:06,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432831669] [2019-12-27 02:06:06,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:06,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:06:06,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196867774] [2019-12-27 02:06:06,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:06,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:06,712 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-27 02:06:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:06,837 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-27 02:06:06,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:06,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:06:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:06,930 INFO L225 Difference]: With dead ends: 33114 [2019-12-27 02:06:06,930 INFO L226 Difference]: Without dead ends: 33114 [2019-12-27 02:06:06,931 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-27 02:06:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-27 02:06:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-27 02:06:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-27 02:06:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-27 02:06:07,685 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-27 02:06:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:07,685 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-27 02:06:07,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-27 02:06:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:06:07,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:07,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:06:07,690 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-27 02:06:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-27 02:06:07,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:07,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081504268] [2019-12-27 02:06:07,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:07,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-27 02:06:07,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081504268] [2019-12-27 02:06:07,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:07,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:06:07,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979479383] [2019-12-27 02:06:07,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:06:07,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:06:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:06:07,799 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-27 02:06:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:08,202 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-27 02:06:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:06:08,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:06:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:08,283 INFO L225 Difference]: With dead ends: 41561 [2019-12-27 02:06:08,283 INFO L226 Difference]: Without dead ends: 41561 [2019-12-27 02:06:08,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-27 02:06:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-27 02:06:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-27 02:06:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-27 02:06:09,962 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-27 02:06:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:09,963 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-27 02:06:09,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:06:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-27 02:06:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:06:09,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:09,974 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-27 02:06:09,975 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-27 02:06:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-27 02:06:09,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:09,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926585372] [2019-12-27 02:06:09,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:10,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926585372] [2019-12-27 02:06:10,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:10,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:06:10,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919199352] [2019-12-27 02:06:10,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:06:10,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:06:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:10,109 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-27 02:06:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:10,774 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-27 02:06:10,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:06:10,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:06:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:10,850 INFO L225 Difference]: With dead ends: 47941 [2019-12-27 02:06:10,850 INFO L226 Difference]: Without dead ends: 47934 [2019-12-27 02:06:10,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-27 02:06:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-27 02:06:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-27 02:06:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-27 02:06:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-27 02:06:12,036 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-27 02:06:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:12,037 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-27 02:06:12,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:06:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-27 02:06:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:06:12,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:12,051 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-27 02:06:12,051 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-27 02:06:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-27 02:06:12,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:12,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941846382] [2019-12-27 02:06:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:12,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941846382] [2019-12-27 02:06:12,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:12,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:06:12,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150414151] [2019-12-27 02:06:12,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:06:12,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:06:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:06:12,113 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-27 02:06:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:12,187 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-27 02:06:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:06:12,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:06:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:12,209 INFO L225 Difference]: With dead ends: 15264 [2019-12-27 02:06:12,210 INFO L226 Difference]: Without dead ends: 15264 [2019-12-27 02:06:12,210 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-27 02:06:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-27 02:06:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-27 02:06:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-27 02:06:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-27 02:06:12,440 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-27 02:06:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:12,440 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-27 02:06:12,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:06:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-27 02:06:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:06:12,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:12,451 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-27 02:06:12,451 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-27 02:06:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-27 02:06:12,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:12,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559036604] [2019-12-27 02:06:12,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:12,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559036604] [2019-12-27 02:06:12,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:12,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:06:12,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332161382] [2019-12-27 02:06:12,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:12,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:12,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:12,511 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-27 02:06:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:12,619 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-27 02:06:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:12,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:06:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:12,651 INFO L225 Difference]: With dead ends: 21267 [2019-12-27 02:06:12,651 INFO L226 Difference]: Without dead ends: 21267 [2019-12-27 02:06:12,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-27 02:06:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-27 02:06:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-27 02:06:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-27 02:06:13,316 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-27 02:06:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:13,317 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-27 02:06:13,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-27 02:06:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:06:13,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:13,327 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-27 02:06:13,328 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-27 02:06:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-27 02:06:13,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:13,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118815848] [2019-12-27 02:06:13,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:13,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118815848] [2019-12-27 02:06:13,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:13,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:06:13,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948230117] [2019-12-27 02:06:13,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:06:13,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:06:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:06:13,462 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-27 02:06:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:14,242 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-27 02:06:14,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:06:14,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:06:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:14,301 INFO L225 Difference]: With dead ends: 40724 [2019-12-27 02:06:14,302 INFO L226 Difference]: Without dead ends: 40724 [2019-12-27 02:06:14,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:06:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-27 02:06:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-27 02:06:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-27 02:06:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-27 02:06:14,788 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-27 02:06:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:14,788 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-27 02:06:14,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:06:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-27 02:06:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:06:14,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:14,806 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-27 02:06:14,806 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-27 02:06:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-27 02:06:14,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:14,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873881570] [2019-12-27 02:06:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:14,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873881570] [2019-12-27 02:06:14,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:14,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:06:14,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27127225] [2019-12-27 02:06:14,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:06:14,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:06:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:14,915 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 5 states. [2019-12-27 02:06:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:15,037 INFO L93 Difference]: Finished difference Result 23708 states and 71203 transitions. [2019-12-27 02:06:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:06:15,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:06:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:15,069 INFO L225 Difference]: With dead ends: 23708 [2019-12-27 02:06:15,069 INFO L226 Difference]: Without dead ends: 23708 [2019-12-27 02:06:15,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23708 states. [2019-12-27 02:06:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23708 to 20875. [2019-12-27 02:06:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20875 states. [2019-12-27 02:06:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20875 states to 20875 states and 62374 transitions. [2019-12-27 02:06:15,866 INFO L78 Accepts]: Start accepts. Automaton has 20875 states and 62374 transitions. Word has length 28 [2019-12-27 02:06:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:15,867 INFO L462 AbstractCegarLoop]: Abstraction has 20875 states and 62374 transitions. [2019-12-27 02:06:15,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:06:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 20875 states and 62374 transitions. [2019-12-27 02:06:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:06:15,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:15,883 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] [2019-12-27 02:06:15,884 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-27 02:06:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 443754453, now seen corresponding path program 1 times [2019-12-27 02:06:15,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:15,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371180241] [2019-12-27 02:06:15,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371180241] [2019-12-27 02:06:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:06:16,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260462413] [2019-12-27 02:06:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:06:16,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:06:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:06:16,034 INFO L87 Difference]: Start difference. First operand 20875 states and 62374 transitions. Second operand 6 states. [2019-12-27 02:06:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:16,758 INFO L93 Difference]: Finished difference Result 31783 states and 93408 transitions. [2019-12-27 02:06:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:06:16,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:06:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:16,817 INFO L225 Difference]: With dead ends: 31783 [2019-12-27 02:06:16,818 INFO L226 Difference]: Without dead ends: 31783 [2019-12-27 02:06:16,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:06:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31783 states. [2019-12-27 02:06:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31783 to 20735. [2019-12-27 02:06:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 02:06:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61934 transitions. [2019-12-27 02:06:17,221 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61934 transitions. Word has length 29 [2019-12-27 02:06:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:17,222 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61934 transitions. [2019-12-27 02:06:17,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:06:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61934 transitions. [2019-12-27 02:06:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:06:17,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:17,245 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-27 02:06:17,245 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-27 02:06:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-27 02:06:17,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:17,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536637288] [2019-12-27 02:06:17,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:17,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536637288] [2019-12-27 02:06:17,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:17,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:06:17,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264963212] [2019-12-27 02:06:17,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:06:17,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:06:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:06:17,371 INFO L87 Difference]: Start difference. First operand 20735 states and 61934 transitions. Second operand 7 states. [2019-12-27 02:06:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:18,706 INFO L93 Difference]: Finished difference Result 41886 states and 122219 transitions. [2019-12-27 02:06:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:06:18,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:06:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:18,765 INFO L225 Difference]: With dead ends: 41886 [2019-12-27 02:06:18,765 INFO L226 Difference]: Without dead ends: 41886 [2019-12-27 02:06:18,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:06:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41886 states. [2019-12-27 02:06:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41886 to 22758. [2019-12-27 02:06:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22758 states. [2019-12-27 02:06:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22758 states to 22758 states and 67949 transitions. [2019-12-27 02:06:19,639 INFO L78 Accepts]: Start accepts. Automaton has 22758 states and 67949 transitions. Word has length 33 [2019-12-27 02:06:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:19,640 INFO L462 AbstractCegarLoop]: Abstraction has 22758 states and 67949 transitions. [2019-12-27 02:06:19,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:06:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22758 states and 67949 transitions. [2019-12-27 02:06:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:06:19,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:19,661 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-27 02:06:19,661 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-27 02:06:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-27 02:06:19,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:19,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826824126] [2019-12-27 02:06:19,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:19,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826824126] [2019-12-27 02:06:19,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:19,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:06:19,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023621663] [2019-12-27 02:06:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:06:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:06:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:06:19,852 INFO L87 Difference]: Start difference. First operand 22758 states and 67949 transitions. Second operand 8 states. [2019-12-27 02:06:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:21,603 INFO L93 Difference]: Finished difference Result 49099 states and 142073 transitions. [2019-12-27 02:06:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:06:21,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 02:06:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:21,674 INFO L225 Difference]: With dead ends: 49099 [2019-12-27 02:06:21,674 INFO L226 Difference]: Without dead ends: 49099 [2019-12-27 02:06:21,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:06:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49099 states. [2019-12-27 02:06:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49099 to 22029. [2019-12-27 02:06:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22029 states. [2019-12-27 02:06:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22029 states to 22029 states and 65668 transitions. [2019-12-27 02:06:22,186 INFO L78 Accepts]: Start accepts. Automaton has 22029 states and 65668 transitions. Word has length 33 [2019-12-27 02:06:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:22,186 INFO L462 AbstractCegarLoop]: Abstraction has 22029 states and 65668 transitions. [2019-12-27 02:06:22,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:06:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22029 states and 65668 transitions. [2019-12-27 02:06:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:06:22,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:22,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:06:22,204 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-27 02:06:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1352546088, now seen corresponding path program 1 times [2019-12-27 02:06:22,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:22,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165730681] [2019-12-27 02:06:22,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:22,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165730681] [2019-12-27 02:06:22,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:22,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:06:22,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214026547] [2019-12-27 02:06:22,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:06:22,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:06:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:06:22,336 INFO L87 Difference]: Start difference. First operand 22029 states and 65668 transitions. Second operand 7 states. [2019-12-27 02:06:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:24,035 INFO L93 Difference]: Finished difference Result 37994 states and 110936 transitions. [2019-12-27 02:06:24,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:06:24,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 02:06:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:24,087 INFO L225 Difference]: With dead ends: 37994 [2019-12-27 02:06:24,087 INFO L226 Difference]: Without dead ends: 37994 [2019-12-27 02:06:24,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:06:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37994 states. [2019-12-27 02:06:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37994 to 20751. [2019-12-27 02:06:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20751 states. [2019-12-27 02:06:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20751 states to 20751 states and 62011 transitions. [2019-12-27 02:06:24,529 INFO L78 Accepts]: Start accepts. Automaton has 20751 states and 62011 transitions. Word has length 35 [2019-12-27 02:06:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:24,530 INFO L462 AbstractCegarLoop]: Abstraction has 20751 states and 62011 transitions. [2019-12-27 02:06:24,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:06:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 20751 states and 62011 transitions. [2019-12-27 02:06:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:06:24,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:24,551 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] [2019-12-27 02:06:24,551 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-27 02:06:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1641645214, now seen corresponding path program 2 times [2019-12-27 02:06:24,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:24,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589188832] [2019-12-27 02:06:24,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:24,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589188832] [2019-12-27 02:06:24,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:24,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:06:24,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500612337] [2019-12-27 02:06:24,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:06:24,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:06:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:06:24,715 INFO L87 Difference]: Start difference. First operand 20751 states and 62011 transitions. Second operand 7 states. [2019-12-27 02:06:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:26,129 INFO L93 Difference]: Finished difference Result 46732 states and 134807 transitions. [2019-12-27 02:06:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:06:26,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 02:06:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:26,192 INFO L225 Difference]: With dead ends: 46732 [2019-12-27 02:06:26,192 INFO L226 Difference]: Without dead ends: 46732 [2019-12-27 02:06:26,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:06:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46732 states. [2019-12-27 02:06:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46732 to 20164. [2019-12-27 02:06:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2019-12-27 02:06:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 60276 transitions. [2019-12-27 02:06:27,148 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 60276 transitions. Word has length 35 [2019-12-27 02:06:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:27,148 INFO L462 AbstractCegarLoop]: Abstraction has 20164 states and 60276 transitions. [2019-12-27 02:06:27,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:06:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 60276 transitions. [2019-12-27 02:06:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:06:27,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:27,172 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] [2019-12-27 02:06:27,172 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-27 02:06:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1975616128, now seen corresponding path program 3 times [2019-12-27 02:06:27,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:27,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259806479] [2019-12-27 02:06:27,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259806479] [2019-12-27 02:06:27,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:27,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:06:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140187973] [2019-12-27 02:06:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:06:27,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:06:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:06:27,408 INFO L87 Difference]: Start difference. First operand 20164 states and 60276 transitions. Second operand 9 states. [2019-12-27 02:06:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:29,333 INFO L93 Difference]: Finished difference Result 41366 states and 120395 transitions. [2019-12-27 02:06:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:06:29,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-27 02:06:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:29,409 INFO L225 Difference]: With dead ends: 41366 [2019-12-27 02:06:29,410 INFO L226 Difference]: Without dead ends: 41366 [2019-12-27 02:06:29,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:06:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41366 states. [2019-12-27 02:06:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41366 to 19840. [2019-12-27 02:06:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19840 states. [2019-12-27 02:06:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19840 states to 19840 states and 59352 transitions. [2019-12-27 02:06:29,851 INFO L78 Accepts]: Start accepts. Automaton has 19840 states and 59352 transitions. Word has length 35 [2019-12-27 02:06:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:29,851 INFO L462 AbstractCegarLoop]: Abstraction has 19840 states and 59352 transitions. [2019-12-27 02:06:29,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:06:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19840 states and 59352 transitions. [2019-12-27 02:06:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:06:29,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:29,867 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-27 02:06:29,870 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-27 02:06:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-27 02:06:29,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:29,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959018442] [2019-12-27 02:06:29,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:29,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959018442] [2019-12-27 02:06:29,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:29,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:06:29,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104944658] [2019-12-27 02:06:29,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:29,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:29,924 INFO L87 Difference]: Start difference. First operand 19840 states and 59352 transitions. Second operand 3 states. [2019-12-27 02:06:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:30,000 INFO L93 Difference]: Finished difference Result 19839 states and 59350 transitions. [2019-12-27 02:06:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:30,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:06:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:30,035 INFO L225 Difference]: With dead ends: 19839 [2019-12-27 02:06:30,035 INFO L226 Difference]: Without dead ends: 19839 [2019-12-27 02:06:30,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19839 states. [2019-12-27 02:06:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19839 to 19839. [2019-12-27 02:06:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19839 states. [2019-12-27 02:06:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19839 states to 19839 states and 59350 transitions. [2019-12-27 02:06:30,349 INFO L78 Accepts]: Start accepts. Automaton has 19839 states and 59350 transitions. Word has length 39 [2019-12-27 02:06:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:30,349 INFO L462 AbstractCegarLoop]: Abstraction has 19839 states and 59350 transitions. [2019-12-27 02:06:30,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19839 states and 59350 transitions. [2019-12-27 02:06:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:06:30,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:30,366 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-27 02:06:30,367 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-27 02:06:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-27 02:06:30,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:30,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118773544] [2019-12-27 02:06:30,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:30,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118773544] [2019-12-27 02:06:30,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:30,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:06:30,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160538915] [2019-12-27 02:06:30,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:30,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:30,404 INFO L87 Difference]: Start difference. First operand 19839 states and 59350 transitions. Second operand 3 states. [2019-12-27 02:06:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:30,910 INFO L93 Difference]: Finished difference Result 37646 states and 112659 transitions. [2019-12-27 02:06:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:30,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 02:06:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:30,950 INFO L225 Difference]: With dead ends: 37646 [2019-12-27 02:06:30,950 INFO L226 Difference]: Without dead ends: 20268 [2019-12-27 02:06:30,951 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-27 02:06:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2019-12-27 02:06:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 20202. [2019-12-27 02:06:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20202 states. [2019-12-27 02:06:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20202 states to 20202 states and 59077 transitions. [2019-12-27 02:06:31,343 INFO L78 Accepts]: Start accepts. Automaton has 20202 states and 59077 transitions. Word has length 40 [2019-12-27 02:06:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:31,344 INFO L462 AbstractCegarLoop]: Abstraction has 20202 states and 59077 transitions. [2019-12-27 02:06:31,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20202 states and 59077 transitions. [2019-12-27 02:06:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:06:31,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:31,360 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-27 02:06:31,361 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-27 02:06:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-27 02:06:31,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:31,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936635440] [2019-12-27 02:06:31,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:31,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936635440] [2019-12-27 02:06:31,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:31,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:06:31,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661010570] [2019-12-27 02:06:31,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:06:31,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:06:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:31,423 INFO L87 Difference]: Start difference. First operand 20202 states and 59077 transitions. Second operand 5 states. [2019-12-27 02:06:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:32,159 INFO L93 Difference]: Finished difference Result 28761 states and 83307 transitions. [2019-12-27 02:06:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:06:32,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:06:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:32,202 INFO L225 Difference]: With dead ends: 28761 [2019-12-27 02:06:32,202 INFO L226 Difference]: Without dead ends: 28761 [2019-12-27 02:06:32,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:06:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28761 states. [2019-12-27 02:06:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28761 to 26308. [2019-12-27 02:06:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26308 states. [2019-12-27 02:06:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26308 states to 26308 states and 76766 transitions. [2019-12-27 02:06:32,630 INFO L78 Accepts]: Start accepts. Automaton has 26308 states and 76766 transitions. Word has length 40 [2019-12-27 02:06:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:32,630 INFO L462 AbstractCegarLoop]: Abstraction has 26308 states and 76766 transitions. [2019-12-27 02:06:32,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:06:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26308 states and 76766 transitions. [2019-12-27 02:06:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:06:32,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:32,664 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-27 02:06:32,664 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-27 02:06:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-27 02:06:32,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:32,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521234233] [2019-12-27 02:06:32,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:32,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521234233] [2019-12-27 02:06:32,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:32,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:06:32,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730147614] [2019-12-27 02:06:32,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:32,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:32,730 INFO L87 Difference]: Start difference. First operand 26308 states and 76766 transitions. Second operand 3 states. [2019-12-27 02:06:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:32,808 INFO L93 Difference]: Finished difference Result 24884 states and 71578 transitions. [2019-12-27 02:06:32,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:32,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 02:06:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:32,839 INFO L225 Difference]: With dead ends: 24884 [2019-12-27 02:06:32,840 INFO L226 Difference]: Without dead ends: 24884 [2019-12-27 02:06:32,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24884 states. [2019-12-27 02:06:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24884 to 24820. [2019-12-27 02:06:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24820 states. [2019-12-27 02:06:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24820 states to 24820 states and 71400 transitions. [2019-12-27 02:06:33,189 INFO L78 Accepts]: Start accepts. Automaton has 24820 states and 71400 transitions. Word has length 40 [2019-12-27 02:06:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:33,189 INFO L462 AbstractCegarLoop]: Abstraction has 24820 states and 71400 transitions. [2019-12-27 02:06:33,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 24820 states and 71400 transitions. [2019-12-27 02:06:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:06:33,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:33,212 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-27 02:06:33,212 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-27 02:06:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-27 02:06:33,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:33,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315501037] [2019-12-27 02:06:33,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:33,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315501037] [2019-12-27 02:06:33,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:06:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998065424] [2019-12-27 02:06:33,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:06:33,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:06:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:33,280 INFO L87 Difference]: Start difference. First operand 24820 states and 71400 transitions. Second operand 3 states. [2019-12-27 02:06:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:33,712 INFO L93 Difference]: Finished difference Result 24820 states and 71321 transitions. [2019-12-27 02:06:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:06:33,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 02:06:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:33,743 INFO L225 Difference]: With dead ends: 24820 [2019-12-27 02:06:33,744 INFO L226 Difference]: Without dead ends: 24820 [2019-12-27 02:06:33,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:06:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2019-12-27 02:06:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 20310. [2019-12-27 02:06:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20310 states. [2019-12-27 02:06:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20310 states to 20310 states and 58866 transitions. [2019-12-27 02:06:34,069 INFO L78 Accepts]: Start accepts. Automaton has 20310 states and 58866 transitions. Word has length 41 [2019-12-27 02:06:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 20310 states and 58866 transitions. [2019-12-27 02:06:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:06:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 20310 states and 58866 transitions. [2019-12-27 02:06:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 02:06:34,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:34,090 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] [2019-12-27 02:06:34,090 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-27 02:06:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-27 02:06:34,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:34,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93961274] [2019-12-27 02:06:34,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:34,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93961274] [2019-12-27 02:06:34,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:34,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:06:34,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218826168] [2019-12-27 02:06:34,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:06:34,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:06:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:06:34,143 INFO L87 Difference]: Start difference. First operand 20310 states and 58866 transitions. Second operand 5 states. [2019-12-27 02:06:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:34,231 INFO L93 Difference]: Finished difference Result 19037 states and 56139 transitions. [2019-12-27 02:06:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:06:34,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 02:06:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:34,260 INFO L225 Difference]: With dead ends: 19037 [2019-12-27 02:06:34,261 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 02:06:34,261 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-27 02:06:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 02:06:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 17565. [2019-12-27 02:06:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17565 states. [2019-12-27 02:06:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17565 states to 17565 states and 53008 transitions. [2019-12-27 02:06:34,525 INFO L78 Accepts]: Start accepts. Automaton has 17565 states and 53008 transitions. Word has length 42 [2019-12-27 02:06:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:34,525 INFO L462 AbstractCegarLoop]: Abstraction has 17565 states and 53008 transitions. [2019-12-27 02:06:34,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:06:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17565 states and 53008 transitions. [2019-12-27 02:06:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:34,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:34,543 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-27 02:06:34,543 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-27 02:06:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1215626616, now seen corresponding path program 1 times [2019-12-27 02:06:34,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:34,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068462325] [2019-12-27 02:06:34,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:34,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068462325] [2019-12-27 02:06:34,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:34,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:06:34,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655644590] [2019-12-27 02:06:34,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:06:34,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:06:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:06:34,616 INFO L87 Difference]: Start difference. First operand 17565 states and 53008 transitions. Second operand 7 states. [2019-12-27 02:06:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:35,023 INFO L93 Difference]: Finished difference Result 50071 states and 149353 transitions. [2019-12-27 02:06:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:06:35,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 02:06:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:35,071 INFO L225 Difference]: With dead ends: 50071 [2019-12-27 02:06:35,071 INFO L226 Difference]: Without dead ends: 34987 [2019-12-27 02:06:35,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-27 02:06:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34987 states. [2019-12-27 02:06:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34987 to 20428. [2019-12-27 02:06:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20428 states. [2019-12-27 02:06:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20428 states to 20428 states and 61079 transitions. [2019-12-27 02:06:35,502 INFO L78 Accepts]: Start accepts. Automaton has 20428 states and 61079 transitions. Word has length 66 [2019-12-27 02:06:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:35,503 INFO L462 AbstractCegarLoop]: Abstraction has 20428 states and 61079 transitions. [2019-12-27 02:06:35,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:06:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 20428 states and 61079 transitions. [2019-12-27 02:06:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:35,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:35,524 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-27 02:06:35,524 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-27 02:06:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 2 times [2019-12-27 02:06:35,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:35,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390156727] [2019-12-27 02:06:35,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:35,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390156727] [2019-12-27 02:06:35,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:35,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:06:35,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135653724] [2019-12-27 02:06:35,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:06:35,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:06:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:06:35,627 INFO L87 Difference]: Start difference. First operand 20428 states and 61079 transitions. Second operand 8 states. [2019-12-27 02:06:36,504 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 02:06:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:38,691 INFO L93 Difference]: Finished difference Result 42581 states and 125164 transitions. [2019-12-27 02:06:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 02:06:38,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:06:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:38,749 INFO L225 Difference]: With dead ends: 42581 [2019-12-27 02:06:38,749 INFO L226 Difference]: Without dead ends: 42309 [2019-12-27 02:06:38,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 02:06:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42309 states. [2019-12-27 02:06:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42309 to 21452. [2019-12-27 02:06:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21452 states. [2019-12-27 02:06:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21452 states to 21452 states and 64164 transitions. [2019-12-27 02:06:39,248 INFO L78 Accepts]: Start accepts. Automaton has 21452 states and 64164 transitions. Word has length 66 [2019-12-27 02:06:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:39,248 INFO L462 AbstractCegarLoop]: Abstraction has 21452 states and 64164 transitions. [2019-12-27 02:06:39,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:06:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21452 states and 64164 transitions. [2019-12-27 02:06:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:39,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:39,268 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-27 02:06:39,268 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-27 02:06:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255542, now seen corresponding path program 3 times [2019-12-27 02:06:39,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:39,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464843332] [2019-12-27 02:06:39,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:39,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464843332] [2019-12-27 02:06:39,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:39,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:06:39,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499223312] [2019-12-27 02:06:39,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:06:39,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:06:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:06:39,397 INFO L87 Difference]: Start difference. First operand 21452 states and 64164 transitions. Second operand 9 states. [2019-12-27 02:06:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:43,571 INFO L93 Difference]: Finished difference Result 47208 states and 138258 transitions. [2019-12-27 02:06:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 02:06:43,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:06:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:43,629 INFO L225 Difference]: With dead ends: 47208 [2019-12-27 02:06:43,629 INFO L226 Difference]: Without dead ends: 47208 [2019-12-27 02:06:43,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 02:06:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47208 states. [2019-12-27 02:06:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47208 to 21128. [2019-12-27 02:06:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21128 states. [2019-12-27 02:06:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21128 states to 21128 states and 63173 transitions. [2019-12-27 02:06:44,153 INFO L78 Accepts]: Start accepts. Automaton has 21128 states and 63173 transitions. Word has length 66 [2019-12-27 02:06:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:44,153 INFO L462 AbstractCegarLoop]: Abstraction has 21128 states and 63173 transitions. [2019-12-27 02:06:44,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:06:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21128 states and 63173 transitions. [2019-12-27 02:06:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:44,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:44,176 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-27 02:06:44,176 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-27 02:06:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 4 times [2019-12-27 02:06:44,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:44,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920441426] [2019-12-27 02:06:44,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:44,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920441426] [2019-12-27 02:06:44,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:06:44,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539368077] [2019-12-27 02:06:44,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:06:44,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:06:44,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:06:44,298 INFO L87 Difference]: Start difference. First operand 21128 states and 63173 transitions. Second operand 8 states. [2019-12-27 02:06:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:45,642 INFO L93 Difference]: Finished difference Result 40992 states and 122473 transitions. [2019-12-27 02:06:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:06:45,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:06:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:45,686 INFO L225 Difference]: With dead ends: 40992 [2019-12-27 02:06:45,686 INFO L226 Difference]: Without dead ends: 33100 [2019-12-27 02:06:45,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:06:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33100 states. [2019-12-27 02:06:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33100 to 21829. [2019-12-27 02:06:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21829 states. [2019-12-27 02:06:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21829 states to 21829 states and 64833 transitions. [2019-12-27 02:06:46,117 INFO L78 Accepts]: Start accepts. Automaton has 21829 states and 64833 transitions. Word has length 66 [2019-12-27 02:06:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 21829 states and 64833 transitions. [2019-12-27 02:06:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:06:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21829 states and 64833 transitions. [2019-12-27 02:06:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:46,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:46,141 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-27 02:06:46,141 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-27 02:06:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 5 times [2019-12-27 02:06:46,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:46,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113639245] [2019-12-27 02:06:46,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:46,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113639245] [2019-12-27 02:06:46,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:46,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:06:46,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511272622] [2019-12-27 02:06:46,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:06:46,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:06:46,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:06:46,266 INFO L87 Difference]: Start difference. First operand 21829 states and 64833 transitions. Second operand 9 states. [2019-12-27 02:06:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:47,915 INFO L93 Difference]: Finished difference Result 38446 states and 114045 transitions. [2019-12-27 02:06:47,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:06:47,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:06:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:47,958 INFO L225 Difference]: With dead ends: 38446 [2019-12-27 02:06:47,958 INFO L226 Difference]: Without dead ends: 32452 [2019-12-27 02:06:47,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:06:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-12-27 02:06:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 21613. [2019-12-27 02:06:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21613 states. [2019-12-27 02:06:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21613 states to 21613 states and 64145 transitions. [2019-12-27 02:06:48,355 INFO L78 Accepts]: Start accepts. Automaton has 21613 states and 64145 transitions. Word has length 66 [2019-12-27 02:06:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:48,355 INFO L462 AbstractCegarLoop]: Abstraction has 21613 states and 64145 transitions. [2019-12-27 02:06:48,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:06:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21613 states and 64145 transitions. [2019-12-27 02:06:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:48,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:48,377 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-27 02:06:48,377 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-27 02:06:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 6 times [2019-12-27 02:06:48,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:48,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769015879] [2019-12-27 02:06:48,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:49,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769015879] [2019-12-27 02:06:49,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:49,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 02:06:49,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977648799] [2019-12-27 02:06:49,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 02:06:49,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 02:06:49,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:06:49,157 INFO L87 Difference]: Start difference. First operand 21613 states and 64145 transitions. Second operand 16 states. [2019-12-27 02:06:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:06:55,184 INFO L93 Difference]: Finished difference Result 51457 states and 151358 transitions. [2019-12-27 02:06:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 02:06:55,185 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 02:06:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:06:55,245 INFO L225 Difference]: With dead ends: 51457 [2019-12-27 02:06:55,246 INFO L226 Difference]: Without dead ends: 48282 [2019-12-27 02:06:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=628, Invalid=3794, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 02:06:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48282 states. [2019-12-27 02:06:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48282 to 24896. [2019-12-27 02:06:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24896 states. [2019-12-27 02:06:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24896 states to 24896 states and 73195 transitions. [2019-12-27 02:06:55,772 INFO L78 Accepts]: Start accepts. Automaton has 24896 states and 73195 transitions. Word has length 66 [2019-12-27 02:06:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:06:55,772 INFO L462 AbstractCegarLoop]: Abstraction has 24896 states and 73195 transitions. [2019-12-27 02:06:55,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 02:06:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24896 states and 73195 transitions. [2019-12-27 02:06:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:06:55,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:06:55,799 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-27 02:06:55,800 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-27 02:06:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:06:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2025639272, now seen corresponding path program 7 times [2019-12-27 02:06:55,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:06:55,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093991448] [2019-12-27 02:06:55,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:06:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:06:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:06:56,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093991448] [2019-12-27 02:06:56,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:06:56,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 02:06:56,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622221452] [2019-12-27 02:06:56,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 02:06:56,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:06:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 02:06:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:06:56,312 INFO L87 Difference]: Start difference. First operand 24896 states and 73195 transitions. Second operand 17 states. [2019-12-27 02:07:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:00,599 INFO L93 Difference]: Finished difference Result 35429 states and 102946 transitions. [2019-12-27 02:07:00,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 02:07:00,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 02:07:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:00,643 INFO L225 Difference]: With dead ends: 35429 [2019-12-27 02:07:00,643 INFO L226 Difference]: Without dead ends: 32511 [2019-12-27 02:07:00,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 02:07:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32511 states. [2019-12-27 02:07:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32511 to 24430. [2019-12-27 02:07:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24430 states. [2019-12-27 02:07:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24430 states to 24430 states and 71771 transitions. [2019-12-27 02:07:01,459 INFO L78 Accepts]: Start accepts. Automaton has 24430 states and 71771 transitions. Word has length 66 [2019-12-27 02:07:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:01,459 INFO L462 AbstractCegarLoop]: Abstraction has 24430 states and 71771 transitions. [2019-12-27 02:07:01,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 02:07:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 24430 states and 71771 transitions. [2019-12-27 02:07:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:07:01,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:01,485 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-27 02:07:01,485 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-27 02:07:01,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1827102788, now seen corresponding path program 8 times [2019-12-27 02:07:01,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:01,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706922525] [2019-12-27 02:07:01,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:02,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706922525] [2019-12-27 02:07:02,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:02,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:07:02,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139345440] [2019-12-27 02:07:02,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:07:02,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:07:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:07:02,041 INFO L87 Difference]: Start difference. First operand 24430 states and 71771 transitions. Second operand 15 states. [2019-12-27 02:07:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:06,586 INFO L93 Difference]: Finished difference Result 46967 states and 136806 transitions. [2019-12-27 02:07:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 02:07:06,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 02:07:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:06,646 INFO L225 Difference]: With dead ends: 46967 [2019-12-27 02:07:06,646 INFO L226 Difference]: Without dead ends: 40775 [2019-12-27 02:07:06,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=476, Invalid=2176, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 02:07:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40775 states. [2019-12-27 02:07:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40775 to 21451. [2019-12-27 02:07:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21451 states. [2019-12-27 02:07:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21451 states to 21451 states and 63618 transitions. [2019-12-27 02:07:07,106 INFO L78 Accepts]: Start accepts. Automaton has 21451 states and 63618 transitions. Word has length 66 [2019-12-27 02:07:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:07,106 INFO L462 AbstractCegarLoop]: Abstraction has 21451 states and 63618 transitions. [2019-12-27 02:07:07,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:07:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21451 states and 63618 transitions. [2019-12-27 02:07:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:07:07,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:07,126 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-27 02:07:07,126 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-27 02:07:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 155513098, now seen corresponding path program 9 times [2019-12-27 02:07:07,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:07,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344044046] [2019-12-27 02:07:07,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:07,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344044046] [2019-12-27 02:07:07,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:07,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:07:07,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320317305] [2019-12-27 02:07:07,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:07:07,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:07:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:07:07,448 INFO L87 Difference]: Start difference. First operand 21451 states and 63618 transitions. Second operand 11 states. [2019-12-27 02:07:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:09,026 INFO L93 Difference]: Finished difference Result 43008 states and 128120 transitions. [2019-12-27 02:07:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:07:09,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:07:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:09,081 INFO L225 Difference]: With dead ends: 43008 [2019-12-27 02:07:09,081 INFO L226 Difference]: Without dead ends: 40344 [2019-12-27 02:07:09,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-27 02:07:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40344 states. [2019-12-27 02:07:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40344 to 23975. [2019-12-27 02:07:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23975 states. [2019-12-27 02:07:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23975 states to 23975 states and 70579 transitions. [2019-12-27 02:07:09,565 INFO L78 Accepts]: Start accepts. Automaton has 23975 states and 70579 transitions. Word has length 66 [2019-12-27 02:07:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:09,566 INFO L462 AbstractCegarLoop]: Abstraction has 23975 states and 70579 transitions. [2019-12-27 02:07:09,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:07:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23975 states and 70579 transitions. [2019-12-27 02:07:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:07:09,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:09,592 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-27 02:07:09,592 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-27 02:07:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2061833110, now seen corresponding path program 10 times [2019-12-27 02:07:09,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:09,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765882133] [2019-12-27 02:07:09,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:09,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765882133] [2019-12-27 02:07:09,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:09,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:07:09,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692321478] [2019-12-27 02:07:09,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:07:09,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:07:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:07:09,862 INFO L87 Difference]: Start difference. First operand 23975 states and 70579 transitions. Second operand 11 states. [2019-12-27 02:07:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:11,008 INFO L93 Difference]: Finished difference Result 40970 states and 120755 transitions. [2019-12-27 02:07:11,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:07:11,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:07:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:11,057 INFO L225 Difference]: With dead ends: 40970 [2019-12-27 02:07:11,057 INFO L226 Difference]: Without dead ends: 35952 [2019-12-27 02:07:11,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 02:07:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35952 states. [2019-12-27 02:07:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35952 to 20875. [2019-12-27 02:07:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20875 states. [2019-12-27 02:07:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20875 states to 20875 states and 61958 transitions. [2019-12-27 02:07:11,485 INFO L78 Accepts]: Start accepts. Automaton has 20875 states and 61958 transitions. Word has length 66 [2019-12-27 02:07:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:11,485 INFO L462 AbstractCegarLoop]: Abstraction has 20875 states and 61958 transitions. [2019-12-27 02:07:11,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:07:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20875 states and 61958 transitions. [2019-12-27 02:07:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:07:11,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:11,507 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-27 02:07:11,507 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-27 02:07:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1594558236, now seen corresponding path program 11 times [2019-12-27 02:07:11,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:11,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690316243] [2019-12-27 02:07:11,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:11,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690316243] [2019-12-27 02:07:11,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:11,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:07:11,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206558477] [2019-12-27 02:07:11,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:07:11,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:07:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:07:11,600 INFO L87 Difference]: Start difference. First operand 20875 states and 61958 transitions. Second operand 4 states. [2019-12-27 02:07:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:11,749 INFO L93 Difference]: Finished difference Result 23201 states and 68737 transitions. [2019-12-27 02:07:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:07:11,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:07:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:11,778 INFO L225 Difference]: With dead ends: 23201 [2019-12-27 02:07:11,778 INFO L226 Difference]: Without dead ends: 23201 [2019-12-27 02:07:11,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:07:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23201 states. [2019-12-27 02:07:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23201 to 19563. [2019-12-27 02:07:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19563 states. [2019-12-27 02:07:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19563 states to 19563 states and 58095 transitions. [2019-12-27 02:07:12,255 INFO L78 Accepts]: Start accepts. Automaton has 19563 states and 58095 transitions. Word has length 66 [2019-12-27 02:07:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:12,256 INFO L462 AbstractCegarLoop]: Abstraction has 19563 states and 58095 transitions. [2019-12-27 02:07:12,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:07:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 19563 states and 58095 transitions. [2019-12-27 02:07:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:07:12,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:12,276 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-27 02:07:12,276 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-27 02:07:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 765672949, now seen corresponding path program 1 times [2019-12-27 02:07:12,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:12,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19938062] [2019-12-27 02:07:12,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:07:12,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19938062] [2019-12-27 02:07:12,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:12,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 02:07:12,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35774165] [2019-12-27 02:07:12,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 02:07:12,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:12,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 02:07:12,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:07:12,921 INFO L87 Difference]: Start difference. First operand 19563 states and 58095 transitions. Second operand 16 states. [2019-12-27 02:07:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:17,294 INFO L93 Difference]: Finished difference Result 36046 states and 106044 transitions. [2019-12-27 02:07:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 02:07:17,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 02:07:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:17,342 INFO L225 Difference]: With dead ends: 36046 [2019-12-27 02:07:17,342 INFO L226 Difference]: Without dead ends: 35513 [2019-12-27 02:07:17,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 02:07:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35513 states. [2019-12-27 02:07:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35513 to 19309. [2019-12-27 02:07:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19309 states. [2019-12-27 02:07:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19309 states to 19309 states and 57451 transitions. [2019-12-27 02:07:17,746 INFO L78 Accepts]: Start accepts. Automaton has 19309 states and 57451 transitions. Word has length 67 [2019-12-27 02:07:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:17,746 INFO L462 AbstractCegarLoop]: Abstraction has 19309 states and 57451 transitions. [2019-12-27 02:07:17,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 02:07:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19309 states and 57451 transitions. [2019-12-27 02:07:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:07:17,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:17,765 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-27 02:07:17,765 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:07:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 2 times [2019-12-27 02:07:17,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:17,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831358995] [2019-12-27 02:07:17,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:07:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:07:17,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:07:17,894 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:07:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= v_~__unbuffered_p2_EBX~0_70 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43| 1) |v_#valid_80|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t745~0.base_43|) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= v_~z$w_buff1_used~0_670 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t745~0.base_43|) |v_ULTIMATE.start_main_~#t745~0.offset_29| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t745~0.base_43|) 0) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t745~0.base_43| 4)) (= 0 |v_ULTIMATE.start_main_~#t745~0.offset_29|) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t745~0.base=|v_ULTIMATE.start_main_~#t745~0.base_43|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_21|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t745~0.offset=|v_ULTIMATE.start_main_~#t745~0.offset_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t746~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t745~0.base, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t745~0.offset, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t747~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t746~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, ULTIMATE.start_main_~#t747~0.offset, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:07:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t746~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11|) |v_ULTIMATE.start_main_~#t746~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t746~0.offset_10| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t746~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t746~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t746~0.offset, #length, ULTIMATE.start_main_~#t746~0.base] because there is no mapped edge [2019-12-27 02:07:17,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:07:17,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t747~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10|) |v_ULTIMATE.start_main_~#t747~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t747~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t747~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t747~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t747~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t747~0.offset, #length] because there is no mapped edge [2019-12-27 02:07:17,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In126284925 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In126284925 256) 0))) (or (and (= ~z~0_In126284925 |P1Thread1of1ForFork1_#t~ite9_Out126284925|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In126284925 |P1Thread1of1ForFork1_#t~ite9_Out126284925|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In126284925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In126284925, ~z$w_buff1~0=~z$w_buff1~0_In126284925, ~z~0=~z~0_In126284925} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out126284925|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In126284925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In126284925, ~z$w_buff1~0=~z$w_buff1~0_In126284925, ~z~0=~z~0_In126284925} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 02:07:17,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-117241727 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite21_Out-117241727| ~z$w_buff0~0_In-117241727) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In-117241727| |P2Thread1of1ForFork2_#t~ite20_Out-117241727|)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-117241727| ~z$w_buff0~0_In-117241727) (= |P2Thread1of1ForFork2_#t~ite21_Out-117241727| |P2Thread1of1ForFork2_#t~ite20_Out-117241727|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-117241727 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-117241727 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-117241727 256) 0)) (= (mod ~z$w_buff0_used~0_In-117241727 256) 0))) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-117241727, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-117241727, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-117241727|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-117241727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-117241727, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-117241727, ~weak$$choice2~0=~weak$$choice2~0_In-117241727} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-117241727, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-117241727|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-117241727, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-117241727|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-117241727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-117241727, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-117241727, ~weak$$choice2~0=~weak$$choice2~0_In-117241727} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 02:07:17,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In531252357 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In531252357 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out531252357| ~z$w_buff0_used~0_In531252357)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out531252357| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In531252357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In531252357} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out531252357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In531252357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In531252357} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:07:17,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1209557605 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1209557605 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1209557605 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1209557605 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1209557605| ~z$w_buff1_used~0_In-1209557605) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1209557605| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1209557605, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1209557605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1209557605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1209557605} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1209557605|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1209557605, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1209557605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1209557605, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1209557605} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:07:17,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1800774551 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1800774551 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1800774551 ~z$r_buff0_thd1~0_In1800774551) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1800774551 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1800774551, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1800774551} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1800774551, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1800774551|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1800774551} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:07:17,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In2123344273 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2123344273 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In2123344273 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2123344273 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In2123344273 |P0Thread1of1ForFork0_#t~ite8_Out2123344273|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2123344273|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2123344273, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2123344273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123344273, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2123344273} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2123344273, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2123344273|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2123344273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123344273, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2123344273} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:07:17,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:07:17,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-507217010 256) 0))) (or (and (= ~z$w_buff1~0_In-507217010 |P2Thread1of1ForFork2_#t~ite23_Out-507217010|) (= |P2Thread1of1ForFork2_#t~ite24_Out-507217010| |P2Thread1of1ForFork2_#t~ite23_Out-507217010|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-507217010 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-507217010 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-507217010 256) 0)) (= (mod ~z$w_buff0_used~0_In-507217010 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out-507217010| ~z$w_buff1~0_In-507217010) (= |P2Thread1of1ForFork2_#t~ite23_In-507217010| |P2Thread1of1ForFork2_#t~ite23_Out-507217010|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-507217010|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-507217010, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-507217010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507217010, ~z$w_buff1~0=~z$w_buff1~0_In-507217010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-507217010, ~weak$$choice2~0=~weak$$choice2~0_In-507217010} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-507217010|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-507217010|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-507217010, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-507217010, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507217010, ~z$w_buff1~0=~z$w_buff1~0_In-507217010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-507217010, ~weak$$choice2~0=~weak$$choice2~0_In-507217010} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 02:07:17,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In240855680 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out240855680| |P2Thread1of1ForFork2_#t~ite27_Out240855680|) (= ~z$w_buff0_used~0_In240855680 |P2Thread1of1ForFork2_#t~ite26_Out240855680|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In240855680 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In240855680 256))) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In240855680 256))) (= (mod ~z$w_buff0_used~0_In240855680 256) 0))) .cse1) (and (not .cse1) (= ~z$w_buff0_used~0_In240855680 |P2Thread1of1ForFork2_#t~ite27_Out240855680|) (= |P2Thread1of1ForFork2_#t~ite26_In240855680| |P2Thread1of1ForFork2_#t~ite26_Out240855680|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In240855680|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In240855680, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In240855680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240855680, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In240855680, ~weak$$choice2~0=~weak$$choice2~0_In240855680} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out240855680|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In240855680, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In240855680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240855680, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In240855680, ~weak$$choice2~0=~weak$$choice2~0_In240855680, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out240855680|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 02:07:17,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:07:17,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 02:07:17,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1705665380 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1705665380 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1705665380| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1705665380| ~z$w_buff0_used~0_In-1705665380) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705665380, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1705665380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705665380, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1705665380|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1705665380} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:07:17,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In108992898 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In108992898 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In108992898 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In108992898 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out108992898|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In108992898 |P1Thread1of1ForFork1_#t~ite12_Out108992898|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In108992898, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In108992898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108992898, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In108992898} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In108992898, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In108992898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108992898, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out108992898|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In108992898} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:07:17,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1047436860 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1047436860 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1047436860|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-1047436860 |P1Thread1of1ForFork1_#t~ite13_Out-1047436860|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047436860, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1047436860} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047436860, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1047436860|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1047436860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 02:07:17,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:07:17,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-327341289 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-327341289 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-327341289| |P2Thread1of1ForFork2_#t~ite39_Out-327341289|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-327341289| ~z$w_buff1~0_In-327341289)) (and (or .cse1 .cse0) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-327341289| ~z~0_In-327341289)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-327341289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-327341289, ~z$w_buff1~0=~z$w_buff1~0_In-327341289, ~z~0=~z~0_In-327341289} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-327341289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-327341289, ~z$w_buff1~0=~z$w_buff1~0_In-327341289, ~z~0=~z~0_In-327341289, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-327341289|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-327341289|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 02:07:17,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1697265281 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1697265281 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1697265281 |P2Thread1of1ForFork2_#t~ite40_Out1697265281|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1697265281|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1697265281, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1697265281} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1697265281, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1697265281, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1697265281|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 02:07:17,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In681400082 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In681400082 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In681400082 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In681400082 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out681400082| 0)) (and (= ~z$w_buff1_used~0_In681400082 |P2Thread1of1ForFork2_#t~ite41_Out681400082|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In681400082, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In681400082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In681400082, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In681400082} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out681400082|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In681400082, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In681400082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In681400082, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In681400082} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 02:07:17,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In2046172050 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2046172050 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2046172050 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In2046172050 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out2046172050| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out2046172050| ~z$r_buff1_thd2~0_In2046172050) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2046172050, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2046172050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2046172050, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2046172050} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2046172050, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2046172050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2046172050, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2046172050|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2046172050} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:07:17,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:07:17,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2126746288 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2126746288 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-2126746288|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-2126746288| ~z$r_buff0_thd3~0_In-2126746288)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126746288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2126746288} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-2126746288|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126746288, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2126746288} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 02:07:17,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1538659182 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1538659182 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1538659182 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1538659182 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1538659182|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1538659182 |P2Thread1of1ForFork2_#t~ite43_Out1538659182|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1538659182, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538659182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538659182, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538659182} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1538659182, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1538659182, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1538659182|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1538659182, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1538659182} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 02:07:17,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:07:17,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:07:17,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-489928605| |ULTIMATE.start_main_#t~ite48_Out-489928605|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-489928605 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-489928605 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-489928605| ~z$w_buff1~0_In-489928605)) (and .cse1 (= |ULTIMATE.start_main_#t~ite47_Out-489928605| ~z~0_In-489928605) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-489928605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489928605, ~z$w_buff1~0=~z$w_buff1~0_In-489928605, ~z~0=~z~0_In-489928605} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-489928605, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-489928605|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489928605, ~z$w_buff1~0=~z$w_buff1~0_In-489928605, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-489928605|, ~z~0=~z~0_In-489928605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:07:17,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2144013920 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2144013920 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-2144013920| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-2144013920| ~z$w_buff0_used~0_In-2144013920)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144013920, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144013920} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144013920, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144013920, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2144013920|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:07:17,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1067507685 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1067507685 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1067507685 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1067507685 256) 0))) (or (and (= ~z$w_buff1_used~0_In1067507685 |ULTIMATE.start_main_#t~ite50_Out1067507685|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1067507685|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1067507685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1067507685, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1067507685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1067507685} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1067507685|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1067507685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1067507685, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1067507685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1067507685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:07:17,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In789147109 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In789147109 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out789147109|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In789147109 |ULTIMATE.start_main_#t~ite51_Out789147109|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In789147109, ~z$w_buff0_used~0=~z$w_buff0_used~0_In789147109} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In789147109, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out789147109|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In789147109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:07:17,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1318577742 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1318577742 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1318577742 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1318577742 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1318577742| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-1318577742| ~z$r_buff1_thd0~0_In-1318577742) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318577742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318577742, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1318577742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1318577742} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1318577742|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1318577742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318577742, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1318577742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1318577742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:07:17,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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-27 02:07:18,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:07:18 BasicIcfg [2019-12-27 02:07:18,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:07:18,037 INFO L168 Benchmark]: Toolchain (without parser) took 136100.68 ms. Allocated memory was 145.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 102.3 MB in the beginning and 765.7 MB in the end (delta: -663.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,037 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.36 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,039 INFO L168 Benchmark]: Boogie Preprocessor took 40.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,039 INFO L168 Benchmark]: RCFGBuilder took 881.57 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 101.9 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,039 INFO L168 Benchmark]: TraceAbstraction took 134378.86 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.9 MB in the beginning and 765.7 MB in the end (delta: -663.8 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 02:07:18,042 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.36 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.57 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 101.9 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134378.86 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.9 MB in the beginning and 765.7 MB in the end (delta: -663.8 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L744] 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_p2_EAX=0, __unbuffered_p2_EBX=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] [L825] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L827] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=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=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 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_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=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, 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] [L788] 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_p2_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, 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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 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) [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L789] 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)) [L790] 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)) [L791] 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)) [L792] EXPR 3 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)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, weak$$choice2=1, 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))=0, x=2, y=2, z=1, 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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 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)) [L794] 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 [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, 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=2, y=2, z=1, 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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 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)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 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 [L800] EXPR 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 [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, 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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 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 [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 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_p2_EAX=2, __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=2, weak$$choice2=1, x=2, y=2, 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] [L833] 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) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.0s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 57.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9407 SDtfs, 13460 SDslu, 36489 SDs, 0 SdLazy, 27799 SolverSat, 735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 71 SyntacticMatches, 33 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5147 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred 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.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 372011 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1474 NumberOfCodeBlocks, 1474 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1374 ConstructedInterpolants, 0 QuantifiedInterpolants, 463032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...