/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:40:09,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:40:09,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:40:09,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:40:09,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:40:09,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:40:09,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:40:09,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:40:09,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:40:09,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:40:09,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:40:09,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:40:09,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:40:09,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:40:09,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:40:09,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:40:09,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:40:09,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:40:09,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:40:09,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:40:09,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:40:09,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:40:09,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:40:09,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:40:09,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:40:09,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:40:09,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:40:09,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:40:09,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:40:09,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:40:09,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:40:09,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:40:09,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:40:09,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:40:09,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:40:09,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:40:09,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:40:09,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:40:09,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:40:09,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:40:09,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:40:09,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:40:09,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:40:09,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:40:09,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:40:09,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:40:09,686 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:40:09,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:40:09,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:40:09,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:40:09,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:40:09,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:40:09,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:40:09,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:40:09,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:40:09,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:40:09,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:40:09,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:40:09,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:40:09,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:40:09,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:40:09,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:40:09,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:40:09,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:40:09,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:40:09,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:40:09,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:40:09,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:40:09,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:40:09,691 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:40:09,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:40:09,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:40:09,692 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:40:09,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:40:10,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:40:10,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:40:10,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:40:10,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:40:10,027 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:40:10,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 22:40:10,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bbe0a46/e5c25fff921d4010928d0a379be3e5c7/FLAG2c73e972a [2019-12-27 22:40:10,660 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:40:10,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.oepc.i [2019-12-27 22:40:10,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bbe0a46/e5c25fff921d4010928d0a379be3e5c7/FLAG2c73e972a [2019-12-27 22:40:10,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bbe0a46/e5c25fff921d4010928d0a379be3e5c7 [2019-12-27 22:40:10,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:40:10,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:40:10,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:40:10,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:40:10,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:40:10,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:40:10" (1/1) ... [2019-12-27 22:40:10,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:10, skipping insertion in model container [2019-12-27 22:40:10,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:40:10" (1/1) ... [2019-12-27 22:40:10,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:40:11,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:40:11,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:40:11,496 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:40:11,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:40:11,659 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:40:11,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11 WrapperNode [2019-12-27 22:40:11,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:40:11,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:40:11,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:40:11,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:40:11,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:40:11,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:40:11,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:40:11,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:40:11,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (1/1) ... [2019-12-27 22:40:11,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:40:11,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:40:11,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:40:11,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:40:11,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (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 22:40:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:40:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:40:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:40:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:40:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:40:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:40:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:40:11,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:40:11,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:40:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:40:11,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:40:11,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:40:11,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:40:11,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 22:40:12,558 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:40:12,558 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:40:12,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:40:12 BoogieIcfgContainer [2019-12-27 22:40:12,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:40:12,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:40:12,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:40:12,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:40:12,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:40:10" (1/3) ... [2019-12-27 22:40:12,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434f6d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:40:12, skipping insertion in model container [2019-12-27 22:40:12,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:40:11" (2/3) ... [2019-12-27 22:40:12,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434f6d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:40:12, skipping insertion in model container [2019-12-27 22:40:12,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:40:12" (3/3) ... [2019-12-27 22:40:12,569 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.oepc.i [2019-12-27 22:40:12,580 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:40:12,581 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:40:12,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:40:12,590 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:40:12,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,687 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,687 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,717 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,720 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,724 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,726 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:40:12,746 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:40:12,768 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:40:12,769 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:40:12,769 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:40:12,769 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:40:12,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:40:12,769 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:40:12,769 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:40:12,769 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:40:12,787 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:40:12,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:40:12,891 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:40:12,892 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:40:12,908 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 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:40:12,935 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:40:12,990 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:40:12,990 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:40:12,999 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 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:40:13,022 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 22:40:13,023 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:40:16,657 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:40:16,781 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:40:16,805 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 22:40:16,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 22:40:16,809 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 22:40:33,164 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 22:40:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 22:40:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:40:33,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:33,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:40:33,173 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 22:40:33,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 22:40:33,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:33,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811939983] [2019-12-27 22:40:33,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:33,409 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 22:40:33,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811939983] [2019-12-27 22:40:33,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:33,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:40:33,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743122447] [2019-12-27 22:40:33,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:33,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:33,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:40:33,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:33,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:33,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:40:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:40:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:40:33,452 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 22:40:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:37,468 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 22:40:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:40:37,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:40:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:38,101 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 22:40:38,108 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 22:40:38,112 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 22:40:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 22:40:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 22:40:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 22:40:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 22:40:44,883 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 22:40:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:40:44,883 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 22:40:44,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:40:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 22:40:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:40:44,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:40:44,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:40:44,898 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 22:40:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:40:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 22:40:44,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:40:44,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489141554] [2019-12-27 22:40:44,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:40:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:40:45,063 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 22:40:45,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489141554] [2019-12-27 22:40:45,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:40:45,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:40:45,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149042743] [2019-12-27 22:40:45,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:40:45,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:40:45,071 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:40:45,071 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:40:45,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:40:45,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:40:45,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:40:45,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:40:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:40:45,076 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 22:40:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:40:49,620 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 22:40:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:40:49,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:40:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:40:50,242 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 22:40:50,243 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 22:40:50,243 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 22:40:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 22:40:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 22:40:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 22:41:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 22:41:04,658 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 22:41:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:04,659 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 22:41:04,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:41:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 22:41:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:41:04,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:04,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:04,663 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 22:41:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 22:41:04,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:04,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808269559] [2019-12-27 22:41:04,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:04,734 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 22:41:04,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808269559] [2019-12-27 22:41:04,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:04,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:04,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887451010] [2019-12-27 22:41:04,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:04,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:04,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:41:04,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:04,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:04,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:04,746 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 22:41:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:04,886 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 22:41:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:04,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:41:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:04,938 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 22:41:04,938 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 22:41:04,938 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 22:41:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 22:41:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 22:41:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 22:41:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 22:41:05,499 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 22:41:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:05,499 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 22:41:05,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 22:41:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:41:05,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:05,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:05,502 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 22:41:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 22:41:05,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:05,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316358946] [2019-12-27 22:41:05,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:05,608 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 22:41:05,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316358946] [2019-12-27 22:41:05,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:05,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:41:05,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924002060] [2019-12-27 22:41:05,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:05,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:05,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 22:41:05,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:05,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:41:05,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:41:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:41:05,619 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 22:41:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:06,138 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 22:41:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:41:06,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 22:41:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:08,869 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 22:41:08,870 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 22:41:08,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 22:41:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 22:41:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 22:41:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 22:41:09,507 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 22:41:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:09,509 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 22:41:09,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:41:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 22:41:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:41:09,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:09,520 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 22:41:09,520 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 22:41:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 22:41:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:09,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488088676] [2019-12-27 22:41:09,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:09,637 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 22:41:09,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488088676] [2019-12-27 22:41:09,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:09,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:41:09,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295939945] [2019-12-27 22:41:09,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:09,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:09,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 22:41:09,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:09,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:09,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:09,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:09,653 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 22:41:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:10,693 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 22:41:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:41:10,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:41:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:10,782 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 22:41:10,783 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 22:41:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:41:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 22:41:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 22:41:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 22:41:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 22:41:11,871 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 22:41:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:11,872 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 22:41:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 22:41:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:41:11,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:11,888 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 22:41:11,888 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 22:41:11,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 22:41:11,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:11,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632255878] [2019-12-27 22:41:11,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:11,982 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 22:41:11,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632255878] [2019-12-27 22:41:11,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:11,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:41:11,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026238312] [2019-12-27 22:41:11,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:11,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:12,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:41:12,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:12,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:41:12,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:41:12,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:41:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:41:12,048 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 22:41:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:12,148 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 22:41:12,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:41:12,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:41:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:12,173 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 22:41:12,173 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 22:41:12,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:41:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 22:41:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 22:41:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 22:41:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 22:41:12,394 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 22:41:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:12,394 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 22:41:12,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:41:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 22:41:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:41:12,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:12,405 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 22:41:12,405 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 22:41:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 22:41:12,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:12,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446245823] [2019-12-27 22:41:12,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:12,528 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 22:41:12,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446245823] [2019-12-27 22:41:12,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:12,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:41:12,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13857543] [2019-12-27 22:41:12,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:12,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:12,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 22:41:12,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:12,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:12,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:12,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:12,542 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 22:41:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:13,171 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 22:41:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:41:13,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 22:41:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:13,213 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 22:41:13,213 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 22:41:13,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:41:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 22:41:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 22:41:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 22:41:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 22:41:13,611 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 22:41:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:13,611 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 22:41:13,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 22:41:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:41:13,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:13,639 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 22:41:13,639 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 22:41:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 22:41:13,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:13,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200430369] [2019-12-27 22:41:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:13,861 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 22:41:13,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200430369] [2019-12-27 22:41:13,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:13,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:41:13,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191492065] [2019-12-27 22:41:13,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:13,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:13,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 22:41:13,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:13,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:13,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:41:13,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:41:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:41:13,888 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 9 states. [2019-12-27 22:41:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:15,186 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-27 22:41:15,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:41:15,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 22:41:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:15,223 INFO L225 Difference]: With dead ends: 24849 [2019-12-27 22:41:15,223 INFO L226 Difference]: Without dead ends: 24849 [2019-12-27 22:41:15,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:41:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-27 22:41:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-27 22:41:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-27 22:41:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-27 22:41:15,662 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-27 22:41:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:15,663 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-27 22:41:15,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:41:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-27 22:41:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 22:41:15,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:15,684 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 22:41:15,684 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 22:41:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-27 22:41:15,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:15,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949407829] [2019-12-27 22:41:15,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:15,803 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 22:41:15,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949407829] [2019-12-27 22:41:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:15,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:41:15,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979782315] [2019-12-27 22:41:15,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:15,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:15,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 85 transitions. [2019-12-27 22:41:15,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:15,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:15,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:41:15,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:41:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:15,834 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 7 states. [2019-12-27 22:41:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:17,045 INFO L93 Difference]: Finished difference Result 24587 states and 72060 transitions. [2019-12-27 22:41:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:41:17,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 22:41:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:17,078 INFO L225 Difference]: With dead ends: 24587 [2019-12-27 22:41:17,078 INFO L226 Difference]: Without dead ends: 24587 [2019-12-27 22:41:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:41:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-27 22:41:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 16954. [2019-12-27 22:41:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 22:41:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 22:41:17,353 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 22:41:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:17,354 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 22:41:17,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:41:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 22:41:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:41:17,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:17,375 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 22:41:17,375 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 22:41:17,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 22:41:17,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:17,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263843399] [2019-12-27 22:41:17,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:17,436 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 22:41:17,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263843399] [2019-12-27 22:41:17,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:17,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:41:17,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973680561] [2019-12-27 22:41:17,437 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:17,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:17,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 22:41:17,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:17,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:17,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:17,522 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 22:41:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:17,616 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 22:41:17,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:17,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:41:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:17,652 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 22:41:17,652 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 22:41:17,652 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 22:41:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 22:41:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 22:41:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 22:41:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 22:41:17,989 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 22:41:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:17,991 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 22:41:17,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 22:41:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:41:18,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:18,020 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 22:41:18,020 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 22:41:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 22:41:18,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:18,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638330942] [2019-12-27 22:41:18,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:18,109 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 22:41:18,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638330942] [2019-12-27 22:41:18,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:18,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:18,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335792041] [2019-12-27 22:41:18,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:18,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:18,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 198 transitions. [2019-12-27 22:41:18,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:18,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:41:18,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:41:18,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:41:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:41:18,199 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 22:41:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:18,323 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 22:41:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:41:18,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:41:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:18,347 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 22:41:18,347 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 22:41:18,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 4 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 22:41:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 22:41:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 22:41:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 22:41:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 22:41:18,709 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 22:41:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:18,709 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 22:41:18,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:41:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 22:41:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:41:18,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:18,724 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 22:41:18,724 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 22:41:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 22:41:18,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:18,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698652498] [2019-12-27 22:41:18,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:18,794 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 22:41:18,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698652498] [2019-12-27 22:41:18,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:18,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:41:18,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555149430] [2019-12-27 22:41:18,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:18,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:18,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 22:41:18,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:19,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:41:19,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:41:19,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:41:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:41:19,041 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 11 states. [2019-12-27 22:41:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:20,303 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 22:41:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:41:20,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 22:41:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:20,334 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 22:41:20,334 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 22:41:20,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:41:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 22:41:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 22:41:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 22:41:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 22:41:20,625 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 22:41:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:20,625 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 22:41:20,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:41:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 22:41:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:41:20,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:20,645 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 22:41:20,645 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 22:41:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 22:41:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280378750] [2019-12-27 22:41:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:20,706 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 22:41:20,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280378750] [2019-12-27 22:41:20,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:20,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:41:20,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278273617] [2019-12-27 22:41:20,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:20,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:20,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 450 transitions. [2019-12-27 22:41:20,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:20,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:41:20,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:41:20,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:20,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:41:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:20,850 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 7 states. [2019-12-27 22:41:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:20,959 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 22:41:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:41:20,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:41:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:20,994 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 22:41:20,994 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 22:41:20,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 22:41:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 22:41:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 22:41:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 22:41:21,277 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 22:41:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:21,278 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 22:41:21,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:41:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 22:41:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:41:21,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:21,301 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] [2019-12-27 22:41:21,301 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 22:41:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 22:41:21,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:21,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585803865] [2019-12-27 22:41:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:21,344 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 22:41:21,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585803865] [2019-12-27 22:41:21,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:21,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:41:21,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [522450641] [2019-12-27 22:41:21,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:21,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:21,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:41:21,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:21,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:41:21,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:21,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:21,717 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 22:41:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:21,821 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 22:41:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:21,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:41:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:21,857 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 22:41:21,857 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 22:41:21,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 22:41:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 22:41:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 22:41:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 22:41:22,182 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 22:41:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:22,183 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 22:41:22,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 22:41:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:41:22,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:22,203 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] [2019-12-27 22:41:22,203 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 22:41:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:22,203 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 22:41:22,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:22,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038016382] [2019-12-27 22:41:22,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:22,280 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 22:41:22,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038016382] [2019-12-27 22:41:22,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:22,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:41:22,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061853209] [2019-12-27 22:41:22,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:22,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:22,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 22:41:22,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:22,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:41:22,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:41:22,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:41:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:41:22,673 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 11 states. [2019-12-27 22:41:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:23,414 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 22:41:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:41:23,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:41:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:23,474 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 22:41:23,474 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 22:41:23,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:41:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 22:41:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 22:41:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 22:41:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 22:41:24,143 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 22:41:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:24,143 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 22:41:24,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:41:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 22:41:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:41:24,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:24,171 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] [2019-12-27 22:41:24,171 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 22:41:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 22:41:24,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:24,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609600526] [2019-12-27 22:41:24,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:24,259 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 22:41:24,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609600526] [2019-12-27 22:41:24,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:24,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:41:24,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644613282] [2019-12-27 22:41:24,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:24,280 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:24,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 22:41:24,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:24,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:41:24,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:41:24,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:41:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:41:24,656 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 10 states. [2019-12-27 22:41:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:26,210 INFO L93 Difference]: Finished difference Result 132353 states and 401673 transitions. [2019-12-27 22:41:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:41:26,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 22:41:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:26,364 INFO L225 Difference]: With dead ends: 132353 [2019-12-27 22:41:26,365 INFO L226 Difference]: Without dead ends: 102599 [2019-12-27 22:41:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:41:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102599 states. [2019-12-27 22:41:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102599 to 28331. [2019-12-27 22:41:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 22:41:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 22:41:27,612 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 22:41:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:27,612 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 22:41:27,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:41:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 22:41:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:41:27,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:27,657 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] [2019-12-27 22:41:27,657 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 22:41:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 22:41:27,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:27,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806407419] [2019-12-27 22:41:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:27,749 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 22:41:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806407419] [2019-12-27 22:41:27,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:27,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:41:27,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092929605] [2019-12-27 22:41:27,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:27,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:28,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:41:28,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:28,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:41:28,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:41:28,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:28,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:41:28,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:41:28,152 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 11 states. [2019-12-27 22:41:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:29,983 INFO L93 Difference]: Finished difference Result 81245 states and 247982 transitions. [2019-12-27 22:41:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:41:29,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 22:41:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:30,086 INFO L225 Difference]: With dead ends: 81245 [2019-12-27 22:41:30,086 INFO L226 Difference]: Without dead ends: 71796 [2019-12-27 22:41:30,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:41:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71796 states. [2019-12-27 22:41:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71796 to 28639. [2019-12-27 22:41:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 22:41:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 22:41:31,072 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 22:41:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:31,073 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 22:41:31,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:41:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 22:41:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:41:31,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:31,105 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] [2019-12-27 22:41:31,105 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 22:41:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 22:41:31,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:31,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562595477] [2019-12-27 22:41:31,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:31,167 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 22:41:31,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562595477] [2019-12-27 22:41:31,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:31,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:31,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575555621] [2019-12-27 22:41:31,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:31,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:31,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 307 transitions. [2019-12-27 22:41:31,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:31,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:41:31,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:41:31,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:31,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:41:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:31,340 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 22:41:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:31,480 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 22:41:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:41:31,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 22:41:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:31,526 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 22:41:31,526 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 22:41:31,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:41:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 22:41:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 22:41:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 22:41:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 22:41:31,987 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 22:41:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:31,987 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 22:41:31,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:41:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 22:41:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:32,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:32,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:32,018 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 22:41:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 22:41:32,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:32,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815611940] [2019-12-27 22:41:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:32,078 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 22:41:32,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815611940] [2019-12-27 22:41:32,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:32,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:41:32,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671205333] [2019-12-27 22:41:32,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:32,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:32,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 22:41:32,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:32,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:41:32,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:32,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:32,567 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 6 states. [2019-12-27 22:41:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:33,244 INFO L93 Difference]: Finished difference Result 54266 states and 168301 transitions. [2019-12-27 22:41:33,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:41:33,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:41:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:33,326 INFO L225 Difference]: With dead ends: 54266 [2019-12-27 22:41:33,326 INFO L226 Difference]: Without dead ends: 54266 [2019-12-27 22:41:33,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:41:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54266 states. [2019-12-27 22:41:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54266 to 31050. [2019-12-27 22:41:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31050 states. [2019-12-27 22:41:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31050 states to 31050 states and 96522 transitions. [2019-12-27 22:41:34,043 INFO L78 Accepts]: Start accepts. Automaton has 31050 states and 96522 transitions. Word has length 65 [2019-12-27 22:41:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:34,044 INFO L462 AbstractCegarLoop]: Abstraction has 31050 states and 96522 transitions. [2019-12-27 22:41:34,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31050 states and 96522 transitions. [2019-12-27 22:41:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:34,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:34,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:34,082 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 22:41:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 2 times [2019-12-27 22:41:34,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891619289] [2019-12-27 22:41:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:34,168 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 22:41:34,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891619289] [2019-12-27 22:41:34,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:34,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:41:34,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32446229] [2019-12-27 22:41:34,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:34,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:34,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 497 transitions. [2019-12-27 22:41:34,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:35,036 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-27 22:41:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:35,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:35,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:41:35,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:41:35,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:35,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:41:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:41:35,269 INFO L87 Difference]: Start difference. First operand 31050 states and 96522 transitions. Second operand 12 states. [2019-12-27 22:41:38,067 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:41:39,020 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 22:41:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:41,803 INFO L93 Difference]: Finished difference Result 145008 states and 441349 transitions. [2019-12-27 22:41:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 22:41:41,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:41:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:41,994 INFO L225 Difference]: With dead ends: 145008 [2019-12-27 22:41:41,994 INFO L226 Difference]: Without dead ends: 119327 [2019-12-27 22:41:41,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 22:41:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-12-27 22:41:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 31635. [2019-12-27 22:41:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 22:41:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 98776 transitions. [2019-12-27 22:41:43,522 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 98776 transitions. Word has length 65 [2019-12-27 22:41:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:43,522 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 98776 transitions. [2019-12-27 22:41:43,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:41:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 98776 transitions. [2019-12-27 22:41:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:43,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:43,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:43,558 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 22:41:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 22:41:43,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:43,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582868846] [2019-12-27 22:41:43,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:43,641 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 22:41:43,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582868846] [2019-12-27 22:41:43,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:43,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:41:43,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54578376] [2019-12-27 22:41:43,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:43,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:43,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 22:41:43,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:43,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:41:43,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:41:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:41:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:41:43,839 INFO L87 Difference]: Start difference. First operand 31635 states and 98776 transitions. Second operand 5 states. [2019-12-27 22:41:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:44,480 INFO L93 Difference]: Finished difference Result 48003 states and 146796 transitions. [2019-12-27 22:41:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:41:44,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:41:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:44,548 INFO L225 Difference]: With dead ends: 48003 [2019-12-27 22:41:44,548 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 22:41:44,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:41:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 22:41:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 37821. [2019-12-27 22:41:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37821 states. [2019-12-27 22:41:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 117767 transitions. [2019-12-27 22:41:45,162 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 117767 transitions. Word has length 65 [2019-12-27 22:41:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:45,162 INFO L462 AbstractCegarLoop]: Abstraction has 37821 states and 117767 transitions. [2019-12-27 22:41:45,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:41:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 117767 transitions. [2019-12-27 22:41:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:45,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:45,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:45,203 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 22:41:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 22:41:45,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:45,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256528624] [2019-12-27 22:41:45,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:45,330 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 22:41:45,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256528624] [2019-12-27 22:41:45,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:45,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:41:45,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341081534] [2019-12-27 22:41:45,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:45,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:45,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 22:41:45,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:45,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:41:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:45,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:41:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:41:45,857 INFO L87 Difference]: Start difference. First operand 37821 states and 117767 transitions. Second operand 12 states. [2019-12-27 22:41:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:48,964 INFO L93 Difference]: Finished difference Result 72164 states and 220001 transitions. [2019-12-27 22:41:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:41:48,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:41:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:49,083 INFO L225 Difference]: With dead ends: 72164 [2019-12-27 22:41:49,083 INFO L226 Difference]: Without dead ends: 72038 [2019-12-27 22:41:49,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:41:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-12-27 22:41:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 40078. [2019-12-27 22:41:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40078 states. [2019-12-27 22:41:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40078 states to 40078 states and 124479 transitions. [2019-12-27 22:41:49,936 INFO L78 Accepts]: Start accepts. Automaton has 40078 states and 124479 transitions. Word has length 65 [2019-12-27 22:41:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:49,937 INFO L462 AbstractCegarLoop]: Abstraction has 40078 states and 124479 transitions. [2019-12-27 22:41:49,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:41:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 40078 states and 124479 transitions. [2019-12-27 22:41:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:49,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:49,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:49,979 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 22:41:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 22:41:49,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:49,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762759910] [2019-12-27 22:41:49,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:50,126 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 22:41:50,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762759910] [2019-12-27 22:41:50,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:50,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:41:50,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606249185] [2019-12-27 22:41:50,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:50,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:50,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 248 transitions. [2019-12-27 22:41:50,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:50,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:41:50,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:41:50,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:41:50,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:41:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:41:50,642 INFO L87 Difference]: Start difference. First operand 40078 states and 124479 transitions. Second operand 15 states. [2019-12-27 22:41:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:56,979 INFO L93 Difference]: Finished difference Result 72344 states and 219755 transitions. [2019-12-27 22:41:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 22:41:56,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 22:41:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:57,100 INFO L225 Difference]: With dead ends: 72344 [2019-12-27 22:41:57,100 INFO L226 Difference]: Without dead ends: 72048 [2019-12-27 22:41:57,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=631, Invalid=3029, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 22:41:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72048 states. [2019-12-27 22:41:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72048 to 41610. [2019-12-27 22:41:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41610 states. [2019-12-27 22:41:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41610 states to 41610 states and 128853 transitions. [2019-12-27 22:41:57,959 INFO L78 Accepts]: Start accepts. Automaton has 41610 states and 128853 transitions. Word has length 65 [2019-12-27 22:41:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:57,959 INFO L462 AbstractCegarLoop]: Abstraction has 41610 states and 128853 transitions. [2019-12-27 22:41:57,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:41:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41610 states and 128853 transitions. [2019-12-27 22:41:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:41:58,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:58,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:41:58,003 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 22:41:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 22:41:58,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:58,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069482711] [2019-12-27 22:41:58,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:58,060 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 22:41:58,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069482711] [2019-12-27 22:41:58,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:58,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970551543] [2019-12-27 22:41:58,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:58,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:41:58,458 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 288 transitions. [2019-12-27 22:41:58,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:41:58,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:41:58,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:41:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:41:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:41:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:41:58,510 INFO L87 Difference]: Start difference. First operand 41610 states and 128853 transitions. Second operand 6 states. [2019-12-27 22:41:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:41:58,941 INFO L93 Difference]: Finished difference Result 42552 states and 129377 transitions. [2019-12-27 22:41:58,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:41:58,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:41:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:41:58,998 INFO L225 Difference]: With dead ends: 42552 [2019-12-27 22:41:58,999 INFO L226 Difference]: Without dead ends: 42552 [2019-12-27 22:41:58,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:41:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42552 states. [2019-12-27 22:41:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42552 to 32392. [2019-12-27 22:41:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32392 states. [2019-12-27 22:41:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32392 states to 32392 states and 98676 transitions. [2019-12-27 22:41:59,517 INFO L78 Accepts]: Start accepts. Automaton has 32392 states and 98676 transitions. Word has length 65 [2019-12-27 22:41:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:41:59,517 INFO L462 AbstractCegarLoop]: Abstraction has 32392 states and 98676 transitions. [2019-12-27 22:41:59,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:41:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32392 states and 98676 transitions. [2019-12-27 22:41:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:41:59,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:41:59,549 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 22:41:59,549 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 22:41:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:41:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 22:41:59,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:41:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757308438] [2019-12-27 22:41:59,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:41:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:41:59,613 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 22:41:59,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757308438] [2019-12-27 22:41:59,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:41:59,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:41:59,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138700467] [2019-12-27 22:41:59,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:41:59,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:00,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 689 transitions. [2019-12-27 22:42:00,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:00,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:00,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:00,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:00,031 INFO L87 Difference]: Start difference. First operand 32392 states and 98676 transitions. Second operand 3 states. [2019-12-27 22:42:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:00,189 INFO L93 Difference]: Finished difference Result 32392 states and 98675 transitions. [2019-12-27 22:42:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:00,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:42:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:00,251 INFO L225 Difference]: With dead ends: 32392 [2019-12-27 22:42:00,251 INFO L226 Difference]: Without dead ends: 32392 [2019-12-27 22:42:00,252 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 22:42:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32392 states. [2019-12-27 22:42:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32392 to 26700. [2019-12-27 22:42:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 22:42:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 82663 transitions. [2019-12-27 22:42:00,730 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 82663 transitions. Word has length 66 [2019-12-27 22:42:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:00,730 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 82663 transitions. [2019-12-27 22:42:00,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 82663 transitions. [2019-12-27 22:42:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:42:00,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:00,760 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 22:42:00,760 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 22:42:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 22:42:00,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:00,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86988591] [2019-12-27 22:42:00,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:01,036 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2019-12-27 22:42:01,107 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 22:42:01,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86988591] [2019-12-27 22:42:01,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:01,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:42:01,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579060006] [2019-12-27 22:42:01,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:01,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:01,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 22:42:01,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:42:01,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:42:01,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:42:01,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:42:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:42:01,867 INFO L87 Difference]: Start difference. First operand 26700 states and 82663 transitions. Second operand 20 states. [2019-12-27 22:42:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:12,279 INFO L93 Difference]: Finished difference Result 109855 states and 337214 transitions. [2019-12-27 22:42:12,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 22:42:12,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 22:42:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:12,396 INFO L225 Difference]: With dead ends: 109855 [2019-12-27 22:42:12,396 INFO L226 Difference]: Without dead ends: 79278 [2019-12-27 22:42:12,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5125 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2343, Invalid=12177, Unknown=0, NotChecked=0, Total=14520 [2019-12-27 22:42:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79278 states. [2019-12-27 22:42:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79278 to 29933. [2019-12-27 22:42:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29933 states. [2019-12-27 22:42:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29933 states to 29933 states and 91758 transitions. [2019-12-27 22:42:13,155 INFO L78 Accepts]: Start accepts. Automaton has 29933 states and 91758 transitions. Word has length 67 [2019-12-27 22:42:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:13,156 INFO L462 AbstractCegarLoop]: Abstraction has 29933 states and 91758 transitions. [2019-12-27 22:42:13,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:42:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29933 states and 91758 transitions. [2019-12-27 22:42:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:42:13,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:13,188 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 22:42:13,188 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 22:42:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 350960738, now seen corresponding path program 1 times [2019-12-27 22:42:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:13,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89403839] [2019-12-27 22:42:13,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:13,250 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 22:42:13,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89403839] [2019-12-27 22:42:13,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:13,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:13,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198689351] [2019-12-27 22:42:13,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:13,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:13,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 559 transitions. [2019-12-27 22:42:13,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:13,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:42:13,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:13,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:13,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:13,537 INFO L87 Difference]: Start difference. First operand 29933 states and 91758 transitions. Second operand 4 states. [2019-12-27 22:42:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:13,676 INFO L93 Difference]: Finished difference Result 29933 states and 91506 transitions. [2019-12-27 22:42:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:13,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 22:42:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:13,715 INFO L225 Difference]: With dead ends: 29933 [2019-12-27 22:42:13,715 INFO L226 Difference]: Without dead ends: 29933 [2019-12-27 22:42:13,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 3 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 22:42:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29933 states. [2019-12-27 22:42:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29933 to 27021. [2019-12-27 22:42:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27021 states. [2019-12-27 22:42:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27021 states to 27021 states and 82946 transitions. [2019-12-27 22:42:14,148 INFO L78 Accepts]: Start accepts. Automaton has 27021 states and 82946 transitions. Word has length 67 [2019-12-27 22:42:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:14,148 INFO L462 AbstractCegarLoop]: Abstraction has 27021 states and 82946 transitions. [2019-12-27 22:42:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27021 states and 82946 transitions. [2019-12-27 22:42:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:42:14,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:14,181 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 22:42:14,181 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 22:42:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 22:42:14,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:14,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216829068] [2019-12-27 22:42:14,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:14,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:42:14,333 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:42:14,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2293~0.base_23|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23| 1) |v_#valid_64|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2293~0.base_23| 4) |v_#length_23|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2293~0.base_23|) |v_ULTIMATE.start_main_~#t2293~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 |v_ULTIMATE.start_main_~#t2293~0.offset_17|) (= 0 v_~z$r_buff1_thd1~0_16) (= (select .cse0 |v_ULTIMATE.start_main_~#t2293~0.base_23|) 0) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_18|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_17|, ULTIMATE.start_main_~#t2293~0.base=|v_ULTIMATE.start_main_~#t2293~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2293~0.offset=|v_ULTIMATE.start_main_~#t2293~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, ~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_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2295~0.base, ~y~0, ULTIMATE.start_main_~#t2294~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2293~0.base, ~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, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2293~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2294~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 22:42:14,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2294~0.base_9|) |v_ULTIMATE.start_main_~#t2294~0.offset_8| 1))) (= 0 |v_ULTIMATE.start_main_~#t2294~0.offset_8|) (not (= |v_ULTIMATE.start_main_~#t2294~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2294~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2294~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2294~0.base=|v_ULTIMATE.start_main_~#t2294~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2294~0.offset=|v_ULTIMATE.start_main_~#t2294~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2294~0.base, #length, ULTIMATE.start_main_~#t2294~0.offset] because there is no mapped edge [2019-12-27 22:42:14,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-635839008| 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-635839008| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-635839008) (= P0Thread1of1ForFork0_~arg.base_Out-635839008 |P0Thread1of1ForFork0_#in~arg.base_In-635839008|) (= 0 (mod ~z$w_buff1_used~0_Out-635839008 256)) (= 1 ~z$w_buff0_used~0_Out-635839008) (= |P0Thread1of1ForFork0_#in~arg.offset_In-635839008| P0Thread1of1ForFork0_~arg.offset_Out-635839008) (= ~z$w_buff1~0_Out-635839008 ~z$w_buff0~0_In-635839008) (= ~z$w_buff1_used~0_Out-635839008 ~z$w_buff0_used~0_In-635839008) (= 1 ~z$w_buff0~0_Out-635839008)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-635839008|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-635839008, ~z$w_buff0~0=~z$w_buff0~0_In-635839008, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-635839008|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-635839008|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-635839008, ~z$w_buff0~0=~z$w_buff0~0_Out-635839008, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-635839008, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-635839008, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-635839008|, ~z$w_buff1~0=~z$w_buff1~0_Out-635839008, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-635839008, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-635839008|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-635839008} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:42:14,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2295~0.base_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2295~0.base_11|) |v_ULTIMATE.start_main_~#t2295~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t2295~0.offset_9|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2295~0.base_11| 1) |v_#valid_40|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2295~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2295~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2295~0.offset=|v_ULTIMATE.start_main_~#t2295~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2295~0.base=|v_ULTIMATE.start_main_~#t2295~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2295~0.base] because there is no mapped edge [2019-12-27 22:42:14,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2026504644 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out-2026504644| |P1Thread1of1ForFork1_#t~ite9_Out-2026504644|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2026504644 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-2026504644 |P1Thread1of1ForFork1_#t~ite9_Out-2026504644|) .cse2) (and (not .cse0) .cse2 (= ~z$w_buff1~0_In-2026504644 |P1Thread1of1ForFork1_#t~ite9_Out-2026504644|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2026504644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2026504644, ~z$w_buff1~0=~z$w_buff1~0_In-2026504644, ~z~0=~z~0_In-2026504644} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2026504644|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2026504644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2026504644, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-2026504644|, ~z$w_buff1~0=~z$w_buff1~0_In-2026504644, ~z~0=~z~0_In-2026504644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 22:42:14,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1514184354 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1514184354 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1514184354|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1514184354| ~z$w_buff0_used~0_In1514184354)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1514184354, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1514184354} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1514184354, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1514184354|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1514184354} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:42:14,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-956419072 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-956419072 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-956419072 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-956419072 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-956419072|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-956419072 |P1Thread1of1ForFork1_#t~ite12_Out-956419072|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-956419072, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-956419072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-956419072, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-956419072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-956419072, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-956419072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-956419072, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-956419072|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-956419072} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:42:14,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1254092638 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1254092638 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1254092638| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1254092638 |P1Thread1of1ForFork1_#t~ite13_Out1254092638|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1254092638, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1254092638} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1254092638, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1254092638|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1254092638} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:42:14,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-569473029 256)))) (or (and (= ~z$w_buff1~0_In-569473029 |P2Thread1of1ForFork2_#t~ite24_Out-569473029|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-569473029| |P2Thread1of1ForFork2_#t~ite23_Out-569473029|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-569473029 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-569473029 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-569473029 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-569473029 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out-569473029| |P2Thread1of1ForFork2_#t~ite24_Out-569473029|) (= ~z$w_buff1~0_In-569473029 |P2Thread1of1ForFork2_#t~ite23_Out-569473029|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-569473029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569473029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, ~z$w_buff1~0=~z$w_buff1~0_In-569473029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-569473029, ~weak$$choice2~0=~weak$$choice2~0_In-569473029} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-569473029|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-569473029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-569473029, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, ~z$w_buff1~0=~z$w_buff1~0_In-569473029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-569473029, ~weak$$choice2~0=~weak$$choice2~0_In-569473029} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 22:42:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1248837731 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In-1248837731| |P2Thread1of1ForFork2_#t~ite26_Out-1248837731|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-1248837731| ~z$w_buff0_used~0_In-1248837731)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1248837731 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1248837731 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1248837731 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1248837731 256))))) (= ~z$w_buff0_used~0_In-1248837731 |P2Thread1of1ForFork2_#t~ite26_Out-1248837731|) (= |P2Thread1of1ForFork2_#t~ite27_Out-1248837731| |P2Thread1of1ForFork2_#t~ite26_Out-1248837731|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1248837731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1248837731, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1248837731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1248837731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1248837731, ~weak$$choice2~0=~weak$$choice2~0_In-1248837731} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1248837731|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1248837731, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1248837731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1248837731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1248837731, ~weak$$choice2~0=~weak$$choice2~0_In-1248837731, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1248837731|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 22:42:14,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In855560773 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In855560773 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In855560773 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In855560773 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In855560773 |P1Thread1of1ForFork1_#t~ite14_Out855560773|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out855560773|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855560773, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In855560773, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855560773, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In855560773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In855560773, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In855560773, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855560773, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out855560773|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In855560773} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:42:14,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:42:14,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In715836979 256)))) (or (and (= ~z$w_buff1_used~0_In715836979 |P2Thread1of1ForFork2_#t~ite30_Out715836979|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In715836979| |P2Thread1of1ForFork2_#t~ite29_Out715836979|)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out715836979| ~z$w_buff1_used~0_In715836979) (= |P2Thread1of1ForFork2_#t~ite29_Out715836979| |P2Thread1of1ForFork2_#t~ite30_Out715836979|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In715836979 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In715836979 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In715836979 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In715836979 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In715836979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715836979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715836979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715836979, ~weak$$choice2~0=~weak$$choice2~0_In715836979, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In715836979|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out715836979|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In715836979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715836979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715836979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715836979, ~weak$$choice2~0=~weak$$choice2~0_In715836979, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out715836979|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 22:42:14,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} 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 22:42:14,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 22:42:14,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1645016635 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1645016635 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1645016635| ~z$w_buff0_used~0_In1645016635) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1645016635|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1645016635, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1645016635} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1645016635|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645016635, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1645016635} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:42:14,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1567669930 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1567669930 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1567669930 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1567669930 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1567669930|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1567669930 |P0Thread1of1ForFork0_#t~ite6_Out-1567669930|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1567669930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1567669930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1567669930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1567669930} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1567669930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1567669930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1567669930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1567669930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1567669930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:42:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1004103431 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1004103431 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1004103431)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1004103431 ~z$r_buff0_thd1~0_Out-1004103431)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1004103431} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1004103431|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1004103431} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:42:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In432206974 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In432206974 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In432206974 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In432206974 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out432206974| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In432206974 |P0Thread1of1ForFork0_#t~ite8_Out432206974|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In432206974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432206974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In432206974} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out432206974|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In432206974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In432206974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In432206974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:42:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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 22:42:14,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1834009036 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1834009036| |P2Thread1of1ForFork2_#t~ite38_Out-1834009036|)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1834009036 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-1834009036| ~z~0_In-1834009036)) (and (not .cse1) .cse2 (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-1834009036| ~z$w_buff1~0_In-1834009036)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834009036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834009036, ~z$w_buff1~0=~z$w_buff1~0_In-1834009036, ~z~0=~z~0_In-1834009036} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834009036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834009036, ~z$w_buff1~0=~z$w_buff1~0_In-1834009036, ~z~0=~z~0_In-1834009036, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1834009036|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1834009036|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 22:42:14,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1333537956 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1333537956 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1333537956|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1333537956 |P2Thread1of1ForFork2_#t~ite40_Out1333537956|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333537956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333537956, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1333537956|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 22:42:14,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-475568087 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-475568087 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-475568087 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-475568087 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-475568087 |P2Thread1of1ForFork2_#t~ite41_Out-475568087|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-475568087|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-475568087, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-475568087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475568087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475568087} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-475568087|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475568087, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-475568087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475568087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475568087} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 22:42:14,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-522290786 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-522290786 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-522290786|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-522290786 |P2Thread1of1ForFork2_#t~ite42_Out-522290786|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-522290786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-522290786} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-522290786|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-522290786, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-522290786} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 22:42:14,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1050771076 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1050771076 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1050771076 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1050771076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1050771076| 0)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out-1050771076| ~z$r_buff1_thd3~0_In-1050771076) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1050771076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050771076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1050771076} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1050771076, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1050771076|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1050771076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1050771076} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 22:42:14,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 22:42:14,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:42:14,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1442716858 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1442716858 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1442716858| |ULTIMATE.start_main_#t~ite47_Out-1442716858|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In-1442716858 |ULTIMATE.start_main_#t~ite47_Out-1442716858|)) (and (or .cse1 .cse0) .cse2 (= ~z~0_In-1442716858 |ULTIMATE.start_main_#t~ite47_Out-1442716858|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442716858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442716858, ~z$w_buff1~0=~z$w_buff1~0_In-1442716858, ~z~0=~z~0_In-1442716858} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1442716858, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1442716858|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1442716858, ~z$w_buff1~0=~z$w_buff1~0_In-1442716858, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1442716858|, ~z~0=~z~0_In-1442716858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:42:14,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1544997169 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1544997169 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1544997169|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1544997169 |ULTIMATE.start_main_#t~ite49_Out1544997169|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1544997169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1544997169} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1544997169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1544997169, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1544997169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 22:42:14,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-884367973 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-884367973 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-884367973 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-884367973 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-884367973 |ULTIMATE.start_main_#t~ite50_Out-884367973|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-884367973|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-884367973|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 22:42:14,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1108306445 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1108306445 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1108306445|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1108306445 |ULTIMATE.start_main_#t~ite51_Out1108306445|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1108306445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1108306445, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1108306445|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 22:42:14,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-207890885 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-207890885 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-207890885 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-207890885 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-207890885|)) (and (= ~z$r_buff1_thd0~0_In-207890885 |ULTIMATE.start_main_#t~ite52_Out-207890885|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-207890885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-207890885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207890885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207890885} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-207890885|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-207890885, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-207890885, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207890885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207890885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 22:42:14,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 22:42:14,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:42:14 BasicIcfg [2019-12-27 22:42:14,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:42:14,725 INFO L168 Benchmark]: Toolchain (without parser) took 123793.17 ms. Allocated memory was 136.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.5 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,726 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.01 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 100.1 MB in the beginning and 151.2 MB in the end (delta: -51.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.23 ms. Allocated memory is still 199.8 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,732 INFO L168 Benchmark]: Boogie Preprocessor took 39.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 146.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,732 INFO L168 Benchmark]: RCFGBuilder took 777.99 ms. Allocated memory is still 199.8 MB. Free memory was 146.3 MB in the beginning and 95.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,736 INFO L168 Benchmark]: TraceAbstraction took 122161.79 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:42:14,738 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.16 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.01 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 100.1 MB in the beginning and 151.2 MB in the end (delta: -51.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.23 ms. Allocated memory is still 199.8 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 146.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.99 ms. Allocated memory is still 199.8 MB. Free memory was 146.3 MB in the beginning and 95.9 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122161.79 ms. Allocated memory was 199.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2293, ((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] [L822] FCALL, FORK 0 pthread_create(&t2294, ((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] [L824] FCALL, FORK 0 pthread_create(&t2295, ((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] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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 = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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] [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 [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] 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=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, 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] [L830] 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) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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: 121.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 53.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6761 SDtfs, 11016 SDslu, 27234 SDs, 0 SdLazy, 23367 SolverSat, 655 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 155 SyntacticMatches, 88 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8284 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 36.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 459083 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 225121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...