/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:32,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:32,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:32,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:32,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:32,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:32,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:32,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:32,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:32,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:32,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:32,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:32,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:32,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:32,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:32,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:32,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:32,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:32,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:32,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:32,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:32,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:32,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:32,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:32,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:32,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:32,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:32,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:32,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:32,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:32,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:32,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:32,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:32,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:32,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:32,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:32,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:32,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:32,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:32,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:32,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:32,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:45:32,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:32,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:32,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:32,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:32,625 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:32,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:32,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:32,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:32,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:32,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:32,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:32,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:32,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:32,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:32,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:32,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:32,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:32,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:32,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:32,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:32,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:32,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:32,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:32,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:32,631 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:32,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:32,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:32,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:32,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:32,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:32,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:32,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 16:45:32,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067000884/cf181ef9f6ad4a4685a7e91b379fa31c/FLAG6281fdefb [2019-12-27 16:45:33,562 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:33,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 16:45:33,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067000884/cf181ef9f6ad4a4685a7e91b379fa31c/FLAG6281fdefb [2019-12-27 16:45:33,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067000884/cf181ef9f6ad4a4685a7e91b379fa31c [2019-12-27 16:45:33,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:33,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:33,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:33,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:33,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:33,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:33" (1/1) ... [2019-12-27 16:45:33,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:33, skipping insertion in model container [2019-12-27 16:45:33,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:33" (1/1) ... [2019-12-27 16:45:33,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:33,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:34,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:34,483 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:45:34,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:34,643 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:45:34,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34 WrapperNode [2019-12-27 16:45:34,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:34,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:34,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:45:34,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:45:34,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:34,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:45:34,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:45:34,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:45:34,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (1/1) ... [2019-12-27 16:45:34,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:45:34,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:45:34,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:45:34,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:45:34,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (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 16:45:34,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:45:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:45:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:45:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:45:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:45:34,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:45:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:45:34,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:45:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:45:34,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:45:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:45:34,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:45:34,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:45:34,821 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 16:45:35,603 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:45:35,603 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:45:35,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:35 BoogieIcfgContainer [2019-12-27 16:45:35,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:45:35,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:45:35,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:45:35,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:45:35,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:33" (1/3) ... [2019-12-27 16:45:35,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5231c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:35, skipping insertion in model container [2019-12-27 16:45:35,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:34" (2/3) ... [2019-12-27 16:45:35,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5231c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:35, skipping insertion in model container [2019-12-27 16:45:35,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:35" (3/3) ... [2019-12-27 16:45:35,615 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-27 16:45:35,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:45:35,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:45:35,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:45:35,635 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:45:35,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,731 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,731 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:35,808 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:45:35,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:45:35,828 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:45:35,828 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:45:35,828 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:45:35,828 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:45:35,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:45:35,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:45:35,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:45:35,848 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 16:45:35,849 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:35,964 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:35,964 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:35,981 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:36,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:36,066 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:36,066 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:36,074 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:36,096 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:45:36,097 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:41,291 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:45:41,440 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:45:41,475 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 16:45:41,475 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 16:45:41,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 16:46:03,989 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 16:46:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 16:46:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:46:03,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:03,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:46:03,998 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 16:46:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 16:46:04,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:04,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242868264] [2019-12-27 16:46:04,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:46:04,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242868264] [2019-12-27 16:46:04,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:04,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:46:04,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730684544] [2019-12-27 16:46:04,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:04,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:04,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:46:04,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:04,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:04,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:04,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:04,311 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 16:46:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:06,071 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 16:46:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:06,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:46:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:07,063 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 16:46:07,063 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 16:46:07,064 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 16:46:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 16:46:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 16:46:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 16:46:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 16:46:18,909 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 16:46:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:18,910 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 16:46:18,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 16:46:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:46:18,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:18,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:18,915 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 16:46:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 16:46:18,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:18,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434357036] [2019-12-27 16:46:18,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:19,066 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 16:46:19,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434357036] [2019-12-27 16:46:19,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:19,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:19,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538909919] [2019-12-27 16:46:19,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:19,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:19,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:46:19,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:19,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:19,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:46:19,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:46:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:46:19,078 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 16:46:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:24,432 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 16:46:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:46:24,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:46:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:25,116 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 16:46:25,116 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 16:46:25,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 16:46:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 16:46:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 16:46:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 16:46:40,451 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 16:46:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:40,452 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 16:46:40,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:46:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 16:46:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:46:40,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:40,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:40,460 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 16:46:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 16:46:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:40,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523826103] [2019-12-27 16:46:40,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:40,558 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 16:46:40,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523826103] [2019-12-27 16:46:40,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:40,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:40,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079081141] [2019-12-27 16:46:40,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:40,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:40,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:46:40,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:40,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:40,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:40,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:40,564 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 16:46:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:40,713 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 16:46:40,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:40,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:46:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:40,775 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 16:46:40,776 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 16:46:40,776 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 16:46:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 16:46:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 16:46:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 16:46:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 16:46:47,200 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 16:46:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:47,200 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 16:46:47,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 16:46:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:46:47,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:47,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:47,204 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 16:46:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 16:46:47,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:47,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409168620] [2019-12-27 16:46:47,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:47,303 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 16:46:47,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409168620] [2019-12-27 16:46:47,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:47,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:47,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697630941] [2019-12-27 16:46:47,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:47,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:47,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:46:47,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:47,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:47,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:46:47,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:46:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:47,313 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 16:46:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:47,885 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 16:46:47,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:46:47,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:46:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:47,970 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 16:46:47,970 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 16:46:47,971 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 16:46:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 16:46:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 16:46:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 16:46:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 16:46:48,760 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 16:46:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:48,761 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 16:46:48,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:46:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 16:46:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:46:48,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:48,771 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 16:46:48,771 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 16:46:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 16:46:48,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:48,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061506149] [2019-12-27 16:46:48,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:48,896 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 16:46:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061506149] [2019-12-27 16:46:48,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:48,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:46:48,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052162481] [2019-12-27 16:46:48,898 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:48,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:48,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:46:48,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:48,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:48,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:46:48,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:46:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:48,959 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 7 states. [2019-12-27 16:46:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:49,954 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 16:46:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:46:49,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:46:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:50,061 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 16:46:50,061 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 16:46:50,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:46:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 16:46:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 16:46:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:46:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 16:46:51,251 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 16:46:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:51,251 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 16:46:51,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:46:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 16:46:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:46:51,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:51,266 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 16:46:51,266 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 16:46:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 16:46:51,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:51,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314161059] [2019-12-27 16:46:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:51,322 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 16:46:51,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314161059] [2019-12-27 16:46:51,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:51,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:51,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472029321] [2019-12-27 16:46:51,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:51,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:51,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:46:51,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:51,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:51,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:46:51,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:46:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:51,352 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 5 states. [2019-12-27 16:46:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:51,440 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 16:46:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:46:51,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:46:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:51,472 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 16:46:51,472 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 16:46:51,473 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 16:46:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 16:46:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 16:46:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 16:46:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 16:46:51,730 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 16:46:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:51,730 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 16:46:51,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:46:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 16:46:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:46:51,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:51,743 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 16:46:51,743 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 16:46:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 16:46:51,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:51,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390944653] [2019-12-27 16:46:51,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:51,789 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 16:46:51,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390944653] [2019-12-27 16:46:51,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:51,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:51,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [843346316] [2019-12-27 16:46:51,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:51,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:51,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:46:51,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:51,802 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:51,803 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 16:46:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:51,932 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 16:46:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:51,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:46:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:51,964 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 16:46:51,965 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 16:46:51,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 16:46:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 16:46:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 16:46:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 16:46:52,276 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 16:46:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:52,276 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 16:46:52,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 16:46:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:46:52,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:52,419 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 16:46:52,419 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 16:46:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 16:46:52,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:52,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727157606] [2019-12-27 16:46:52,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:52,500 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 16:46:52,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727157606] [2019-12-27 16:46:52,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:52,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:46:52,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130374212] [2019-12-27 16:46:52,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:52,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:52,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:46:52,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:52,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:52,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:46:52,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:46:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:46:52,513 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 16:46:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:53,038 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 16:46:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:46:53,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:46:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:53,073 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 16:46:53,073 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 16:46:53,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:46:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 16:46:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 16:46:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 16:46:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 16:46:53,406 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 16:46:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:53,406 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 16:46:53,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:46:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 16:46:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:46:53,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:53,428 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 16:46:53,428 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 16:46:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:53,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 16:46:53,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:53,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208640335] [2019-12-27 16:46:53,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:53,518 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 16:46:53,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208640335] [2019-12-27 16:46:53,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:53,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:46:53,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865116884] [2019-12-27 16:46:53,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:53,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:53,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:46:53,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:53,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:46:53,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:46:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:46:53,552 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 8 states. [2019-12-27 16:46:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:54,681 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 16:46:54,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:46:54,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:46:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:54,722 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 16:46:54,722 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 16:46:54,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:46:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 16:46:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 16:46:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 16:46:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 16:46:55,051 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 16:46:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:55,051 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 16:46:55,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:46:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 16:46:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:46:55,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:55,075 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 16:46:55,075 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 16:46:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 16:46:55,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:55,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656471134] [2019-12-27 16:46:55,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:55,151 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 16:46:55,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656471134] [2019-12-27 16:46:55,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:55,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:55,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [641861934] [2019-12-27 16:46:55,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:55,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:55,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 16:46:55,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:55,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:46:55,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:46:55,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:46:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:46:55,279 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 6 states. [2019-12-27 16:46:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:55,471 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 16:46:55,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:46:55,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 16:46:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:55,509 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 16:46:55,509 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 16:46:55,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 16:46:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 16:46:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 16:46:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 16:46:55,877 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 16:46:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:55,877 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 16:46:55,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:46:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 16:46:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:46:56,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:56,030 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 16:46:56,030 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 16:46:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 16:46:56,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:56,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967528168] [2019-12-27 16:46:56,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:56,131 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 16:46:56,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967528168] [2019-12-27 16:46:56,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:56,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:46:56,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [669422925] [2019-12-27 16:46:56,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:56,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:56,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 16:46:56,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:56,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:56,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:56,210 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 16:46:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:56,289 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 16:46:56,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:56,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:46:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:56,324 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 16:46:56,324 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 16:46:56,325 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 16:46:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 16:46:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 16:46:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 16:46:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 16:46:56,614 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 16:46:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:56,614 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 16:46:56,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 16:46:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:46:56,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:56,629 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 16:46:56,630 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 16:46:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 16:46:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:56,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694425891] [2019-12-27 16:46:56,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:56,685 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 16:46:56,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694425891] [2019-12-27 16:46:56,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:56,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:56,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68456017] [2019-12-27 16:46:56,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:56,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:56,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:46:56,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:56,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:56,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:46:56,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:46:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:56,745 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 5 states. [2019-12-27 16:46:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:57,197 INFO L93 Difference]: Finished difference Result 31293 states and 93283 transitions. [2019-12-27 16:46:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:46:57,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:46:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:57,230 INFO L225 Difference]: With dead ends: 31293 [2019-12-27 16:46:57,230 INFO L226 Difference]: Without dead ends: 16903 [2019-12-27 16:46:57,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-12-27 16:46:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 11605. [2019-12-27 16:46:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 16:46:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 16:46:57,530 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 16:46:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:57,530 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 16:46:57,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:46:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 16:46:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:46:57,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:57,545 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 16:46:57,545 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 16:46:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 16:46:57,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:57,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760915690] [2019-12-27 16:46:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:57,629 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 16:46:57,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760915690] [2019-12-27 16:46:57,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:57,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:46:57,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877829769] [2019-12-27 16:46:57,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:57,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:57,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 16:46:57,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:57,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:46:57,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:46:57,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:46:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:57,734 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 7 states. [2019-12-27 16:46:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:57,799 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 16:46:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:46:57,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:46:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:57,811 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 16:46:57,811 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 16:46:57,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 16:46:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 16:46:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 16:46:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 16:46:57,950 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 16:46:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:57,950 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 16:46:57,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:46:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 16:46:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:46:57,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:57,962 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 16:46:57,962 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 16:46:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 16:46:57,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:57,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612966210] [2019-12-27 16:46:57,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:58,012 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 16:46:58,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612966210] [2019-12-27 16:46:58,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:58,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:58,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426295] [2019-12-27 16:46:58,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:58,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:58,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:46:58,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:58,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:46:58,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:58,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:58,509 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 16:46:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:58,593 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 16:46:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:58,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:46:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:58,613 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 16:46:58,613 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 16:46:58,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 16:46:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 16:46:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 16:46:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 16:46:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 16:46:58,827 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 16:46:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:58,827 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 16:46:58,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 16:46:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:46:58,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:58,842 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 16:46:58,842 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 16:46:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 16:46:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:58,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564133299] [2019-12-27 16:46:58,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:58,959 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 16:46:58,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564133299] [2019-12-27 16:46:58,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:58,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:46:58,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986627482] [2019-12-27 16:46:58,960 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:58,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:59,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:46:59,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:59,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:46:59,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:46:59,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:46:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:46:59,476 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 15 states. [2019-12-27 16:47:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:01,742 INFO L93 Difference]: Finished difference Result 25820 states and 78978 transitions. [2019-12-27 16:47:01,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:47:01,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-12-27 16:47:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:01,771 INFO L225 Difference]: With dead ends: 25820 [2019-12-27 16:47:01,771 INFO L226 Difference]: Without dead ends: 19646 [2019-12-27 16:47:01,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:47:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2019-12-27 16:47:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 9445. [2019-12-27 16:47:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 16:47:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 16:47:01,988 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 16:47:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:01,988 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 16:47:01,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:47:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 16:47:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:01,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:01,998 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 16:47:01,998 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 16:47:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 16:47:01,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:01,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755434627] [2019-12-27 16:47:01,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:02,088 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 16:47:02,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755434627] [2019-12-27 16:47:02,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:02,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403518891] [2019-12-27 16:47:02,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:02,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:02,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 348 transitions. [2019-12-27 16:47:02,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:02,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:47:02,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:47:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:47:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:02,660 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 14 states. [2019-12-27 16:47:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:04,793 INFO L93 Difference]: Finished difference Result 24845 states and 77092 transitions. [2019-12-27 16:47:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:47:04,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 16:47:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:04,819 INFO L225 Difference]: With dead ends: 24845 [2019-12-27 16:47:04,819 INFO L226 Difference]: Without dead ends: 17631 [2019-12-27 16:47:04,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:47:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17631 states. [2019-12-27 16:47:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17631 to 11056. [2019-12-27 16:47:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11056 states. [2019-12-27 16:47:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 34695 transitions. [2019-12-27 16:47:05,035 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 34695 transitions. Word has length 64 [2019-12-27 16:47:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:05,035 INFO L462 AbstractCegarLoop]: Abstraction has 11056 states and 34695 transitions. [2019-12-27 16:47:05,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:47:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 34695 transitions. [2019-12-27 16:47:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:05,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:05,047 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 16:47:05,047 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 16:47:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 16:47:05,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:05,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741431229] [2019-12-27 16:47:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:05,152 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 16:47:05,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741431229] [2019-12-27 16:47:05,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:05,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:05,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043538043] [2019-12-27 16:47:05,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:05,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:05,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 245 transitions. [2019-12-27 16:47:05,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:05,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:05,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:05,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:05,410 INFO L87 Difference]: Start difference. First operand 11056 states and 34695 transitions. Second operand 13 states. [2019-12-27 16:47:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:08,155 INFO L93 Difference]: Finished difference Result 33680 states and 103747 transitions. [2019-12-27 16:47:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:47:08,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:47:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:08,199 INFO L225 Difference]: With dead ends: 33680 [2019-12-27 16:47:08,199 INFO L226 Difference]: Without dead ends: 31192 [2019-12-27 16:47:08,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=505, Invalid=1945, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 16:47:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31192 states. [2019-12-27 16:47:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31192 to 10916. [2019-12-27 16:47:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-12-27 16:47:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 34289 transitions. [2019-12-27 16:47:08,659 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 34289 transitions. Word has length 64 [2019-12-27 16:47:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:08,659 INFO L462 AbstractCegarLoop]: Abstraction has 10916 states and 34289 transitions. [2019-12-27 16:47:08,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 34289 transitions. [2019-12-27 16:47:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:08,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:08,670 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 16:47:08,670 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 16:47:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 4 times [2019-12-27 16:47:08,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:08,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343016409] [2019-12-27 16:47:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:08,732 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 16:47:08,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343016409] [2019-12-27 16:47:08,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:08,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:08,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518702432] [2019-12-27 16:47:08,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:08,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:09,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 16:47:09,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:09,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:09,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:09,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:09,181 INFO L87 Difference]: Start difference. First operand 10916 states and 34289 transitions. Second operand 3 states. [2019-12-27 16:47:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:09,322 INFO L93 Difference]: Finished difference Result 12632 states and 39593 transitions. [2019-12-27 16:47:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:09,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:09,353 INFO L225 Difference]: With dead ends: 12632 [2019-12-27 16:47:09,353 INFO L226 Difference]: Without dead ends: 12632 [2019-12-27 16:47:09,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 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 16:47:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2019-12-27 16:47:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 11384. [2019-12-27 16:47:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-12-27 16:47:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 35849 transitions. [2019-12-27 16:47:09,675 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 35849 transitions. Word has length 64 [2019-12-27 16:47:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 11384 states and 35849 transitions. [2019-12-27 16:47:09,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 35849 transitions. [2019-12-27 16:47:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:09,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:09,695 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 16:47:09,695 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 16:47:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 16:47:09,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578464505] [2019-12-27 16:47:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:09,802 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 16:47:09,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578464505] [2019-12-27 16:47:09,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:09,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:47:09,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217341567] [2019-12-27 16:47:09,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:09,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:09,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 264 transitions. [2019-12-27 16:47:09,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:10,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:47:10,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:10,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:10,174 INFO L87 Difference]: Start difference. First operand 11384 states and 35849 transitions. Second operand 13 states. [2019-12-27 16:47:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:14,483 INFO L93 Difference]: Finished difference Result 56068 states and 173510 transitions. [2019-12-27 16:47:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 16:47:14,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:47:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:14,546 INFO L225 Difference]: With dead ends: 56068 [2019-12-27 16:47:14,546 INFO L226 Difference]: Without dead ends: 44689 [2019-12-27 16:47:14,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 16:47:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44689 states. [2019-12-27 16:47:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44689 to 14995. [2019-12-27 16:47:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-27 16:47:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 47906 transitions. [2019-12-27 16:47:14,987 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 47906 transitions. Word has length 65 [2019-12-27 16:47:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:14,988 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 47906 transitions. [2019-12-27 16:47:14,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 47906 transitions. [2019-12-27 16:47:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:15,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:15,005 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 16:47:15,006 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 16:47:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 16:47:15,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:15,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365086446] [2019-12-27 16:47:15,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:15,113 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 16:47:15,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365086446] [2019-12-27 16:47:15,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:15,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:15,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427859612] [2019-12-27 16:47:15,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:15,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:15,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 270 transitions. [2019-12-27 16:47:15,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:15,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:15,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:47:15,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:47:15,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:47:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:47:15,574 INFO L87 Difference]: Start difference. First operand 14995 states and 47906 transitions. Second operand 16 states. [2019-12-27 16:47:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:25,274 INFO L93 Difference]: Finished difference Result 68761 states and 211276 transitions. [2019-12-27 16:47:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 16:47:25,275 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 16:47:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:25,361 INFO L225 Difference]: With dead ends: 68761 [2019-12-27 16:47:25,361 INFO L226 Difference]: Without dead ends: 58612 [2019-12-27 16:47:25,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5123 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1963, Invalid=11377, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 16:47:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58612 states. [2019-12-27 16:47:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58612 to 14575. [2019-12-27 16:47:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14575 states. [2019-12-27 16:47:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14575 states to 14575 states and 46485 transitions. [2019-12-27 16:47:25,901 INFO L78 Accepts]: Start accepts. Automaton has 14575 states and 46485 transitions. Word has length 65 [2019-12-27 16:47:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:25,901 INFO L462 AbstractCegarLoop]: Abstraction has 14575 states and 46485 transitions. [2019-12-27 16:47:25,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:47:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14575 states and 46485 transitions. [2019-12-27 16:47:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:25,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:25,917 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 16:47:25,917 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 16:47:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash 597443054, now seen corresponding path program 3 times [2019-12-27 16:47:25,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:25,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868718409] [2019-12-27 16:47:25,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:26,022 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 16:47:26,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868718409] [2019-12-27 16:47:26,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:26,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:26,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065922087] [2019-12-27 16:47:26,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:26,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:26,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 282 transitions. [2019-12-27 16:47:26,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:26,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:47:26,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:47:26,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:47:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:47:26,270 INFO L87 Difference]: Start difference. First operand 14575 states and 46485 transitions. Second operand 11 states. [2019-12-27 16:47:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:27,541 INFO L93 Difference]: Finished difference Result 39752 states and 121974 transitions. [2019-12-27 16:47:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:47:27,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:47:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:27,590 INFO L225 Difference]: With dead ends: 39752 [2019-12-27 16:47:27,590 INFO L226 Difference]: Without dead ends: 35992 [2019-12-27 16:47:27,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:47:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35992 states. [2019-12-27 16:47:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35992 to 14470. [2019-12-27 16:47:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14470 states. [2019-12-27 16:47:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14470 states to 14470 states and 46039 transitions. [2019-12-27 16:47:27,964 INFO L78 Accepts]: Start accepts. Automaton has 14470 states and 46039 transitions. Word has length 65 [2019-12-27 16:47:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:27,964 INFO L462 AbstractCegarLoop]: Abstraction has 14470 states and 46039 transitions. [2019-12-27 16:47:27,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:47:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14470 states and 46039 transitions. [2019-12-27 16:47:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:27,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:27,980 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 16:47:27,980 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 16:47:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1262085647, now seen corresponding path program 1 times [2019-12-27 16:47:27,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:27,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072619971] [2019-12-27 16:47:27,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:28,052 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 16:47:28,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072619971] [2019-12-27 16:47:28,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:28,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [847361149] [2019-12-27 16:47:28,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:28,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:28,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 502 transitions. [2019-12-27 16:47:28,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:28,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:28,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:47:28,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:47:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:47:28,355 INFO L87 Difference]: Start difference. First operand 14470 states and 46039 transitions. Second operand 4 states. [2019-12-27 16:47:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:28,455 INFO L93 Difference]: Finished difference Result 14314 states and 45415 transitions. [2019-12-27 16:47:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:28,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:47:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:28,475 INFO L225 Difference]: With dead ends: 14314 [2019-12-27 16:47:28,475 INFO L226 Difference]: Without dead ends: 14314 [2019-12-27 16:47:28,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 16:47:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2019-12-27 16:47:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 13846. [2019-12-27 16:47:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13846 states. [2019-12-27 16:47:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13846 states to 13846 states and 43855 transitions. [2019-12-27 16:47:28,689 INFO L78 Accepts]: Start accepts. Automaton has 13846 states and 43855 transitions. Word has length 65 [2019-12-27 16:47:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:28,689 INFO L462 AbstractCegarLoop]: Abstraction has 13846 states and 43855 transitions. [2019-12-27 16:47:28,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:47:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13846 states and 43855 transitions. [2019-12-27 16:47:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:28,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:28,703 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 16:47:28,703 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 16:47:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 16:47:28,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:28,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460722763] [2019-12-27 16:47:28,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:28,990 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 16:47:28,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460722763] [2019-12-27 16:47:28,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:28,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:47:28,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531413230] [2019-12-27 16:47:28,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:29,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:29,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 377 transitions. [2019-12-27 16:47:29,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:29,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:47:29,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:47:29,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:29,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:29,749 INFO L87 Difference]: Start difference. First operand 13846 states and 43855 transitions. Second operand 18 states. [2019-12-27 16:47:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:34,147 INFO L93 Difference]: Finished difference Result 34837 states and 105610 transitions. [2019-12-27 16:47:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 16:47:34,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 16:47:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:34,196 INFO L225 Difference]: With dead ends: 34837 [2019-12-27 16:47:34,196 INFO L226 Difference]: Without dead ends: 34585 [2019-12-27 16:47:34,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 16:47:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34585 states. [2019-12-27 16:47:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34585 to 20698. [2019-12-27 16:47:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20698 states. [2019-12-27 16:47:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20698 states to 20698 states and 63675 transitions. [2019-12-27 16:47:34,611 INFO L78 Accepts]: Start accepts. Automaton has 20698 states and 63675 transitions. Word has length 65 [2019-12-27 16:47:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:34,612 INFO L462 AbstractCegarLoop]: Abstraction has 20698 states and 63675 transitions. [2019-12-27 16:47:34,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 20698 states and 63675 transitions. [2019-12-27 16:47:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:34,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:34,632 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 16:47:34,632 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 16:47:34,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-27 16:47:34,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:34,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719870972] [2019-12-27 16:47:34,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:34,889 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 16:47:34,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719870972] [2019-12-27 16:47:34,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:34,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:47:34,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129587858] [2019-12-27 16:47:34,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:34,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:35,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 343 transitions. [2019-12-27 16:47:35,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:35,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:47:35,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:47:35,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:47:35,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:47:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:47:35,398 INFO L87 Difference]: Start difference. First operand 20698 states and 63675 transitions. Second operand 15 states. [2019-12-27 16:47:37,360 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2019-12-27 16:47:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:38,501 INFO L93 Difference]: Finished difference Result 33775 states and 100043 transitions. [2019-12-27 16:47:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 16:47:38,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 16:47:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:38,545 INFO L225 Difference]: With dead ends: 33775 [2019-12-27 16:47:38,545 INFO L226 Difference]: Without dead ends: 33555 [2019-12-27 16:47:38,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:47:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33555 states. [2019-12-27 16:47:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33555 to 22492. [2019-12-27 16:47:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22492 states. [2019-12-27 16:47:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22492 states to 22492 states and 67796 transitions. [2019-12-27 16:47:38,967 INFO L78 Accepts]: Start accepts. Automaton has 22492 states and 67796 transitions. Word has length 65 [2019-12-27 16:47:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:38,967 INFO L462 AbstractCegarLoop]: Abstraction has 22492 states and 67796 transitions. [2019-12-27 16:47:38,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:47:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22492 states and 67796 transitions. [2019-12-27 16:47:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:38,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:38,991 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 16:47:38,991 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 16:47:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1979760167, now seen corresponding path program 3 times [2019-12-27 16:47:38,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:38,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807060275] [2019-12-27 16:47:38,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:39,074 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 16:47:39,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807060275] [2019-12-27 16:47:39,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:39,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:39,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345540241] [2019-12-27 16:47:39,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:39,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:39,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 280 transitions. [2019-12-27 16:47:39,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:39,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:47:39,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:39,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:39,345 INFO L87 Difference]: Start difference. First operand 22492 states and 67796 transitions. Second operand 6 states. [2019-12-27 16:47:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:39,876 INFO L93 Difference]: Finished difference Result 19871 states and 59086 transitions. [2019-12-27 16:47:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:39,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:47:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:39,923 INFO L225 Difference]: With dead ends: 19871 [2019-12-27 16:47:39,924 INFO L226 Difference]: Without dead ends: 19871 [2019-12-27 16:47:39,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19871 states. [2019-12-27 16:47:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19871 to 15278. [2019-12-27 16:47:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-27 16:47:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45869 transitions. [2019-12-27 16:47:40,313 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45869 transitions. Word has length 65 [2019-12-27 16:47:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:40,313 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45869 transitions. [2019-12-27 16:47:40,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45869 transitions. [2019-12-27 16:47:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:40,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:40,329 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 16:47:40,329 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 16:47:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-27 16:47:40,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:40,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872919036] [2019-12-27 16:47:40,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:40,487 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 16:47:40,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872919036] [2019-12-27 16:47:40,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:40,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:40,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [362564761] [2019-12-27 16:47:40,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:40,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:40,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 333 transitions. [2019-12-27 16:47:40,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:41,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:47:41,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:41,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:41,268 INFO L87 Difference]: Start difference. First operand 15278 states and 45869 transitions. Second operand 18 states. [2019-12-27 16:47:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:43,758 INFO L93 Difference]: Finished difference Result 26411 states and 78160 transitions. [2019-12-27 16:47:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:43,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:43,784 INFO L225 Difference]: With dead ends: 26411 [2019-12-27 16:47:43,785 INFO L226 Difference]: Without dead ends: 19669 [2019-12-27 16:47:43,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:47:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19669 states. [2019-12-27 16:47:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19669 to 15875. [2019-12-27 16:47:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15875 states. [2019-12-27 16:47:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15875 states to 15875 states and 47458 transitions. [2019-12-27 16:47:44,068 INFO L78 Accepts]: Start accepts. Automaton has 15875 states and 47458 transitions. Word has length 66 [2019-12-27 16:47:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:44,068 INFO L462 AbstractCegarLoop]: Abstraction has 15875 states and 47458 transitions. [2019-12-27 16:47:44,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15875 states and 47458 transitions. [2019-12-27 16:47:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:44,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:44,084 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 16:47:44,084 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 16:47:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-27 16:47:44,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:44,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744627855] [2019-12-27 16:47:44,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:44,287 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 16:47:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744627855] [2019-12-27 16:47:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740400089] [2019-12-27 16:47:44,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:44,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:44,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 340 transitions. [2019-12-27 16:47:44,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:44,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:44,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:44,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:44,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:47:44,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:44,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:44,980 INFO L87 Difference]: Start difference. First operand 15875 states and 47458 transitions. Second operand 18 states. [2019-12-27 16:47:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:48,006 INFO L93 Difference]: Finished difference Result 28779 states and 84712 transitions. [2019-12-27 16:47:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 16:47:48,006 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:48,039 INFO L225 Difference]: With dead ends: 28779 [2019-12-27 16:47:48,039 INFO L226 Difference]: Without dead ends: 24498 [2019-12-27 16:47:48,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:47:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24498 states. [2019-12-27 16:47:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24498 to 16282. [2019-12-27 16:47:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16282 states. [2019-12-27 16:47:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16282 states to 16282 states and 48403 transitions. [2019-12-27 16:47:48,337 INFO L78 Accepts]: Start accepts. Automaton has 16282 states and 48403 transitions. Word has length 66 [2019-12-27 16:47:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:48,337 INFO L462 AbstractCegarLoop]: Abstraction has 16282 states and 48403 transitions. [2019-12-27 16:47:48,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16282 states and 48403 transitions. [2019-12-27 16:47:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:48,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:48,352 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 16:47:48,352 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 16:47:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-27 16:47:48,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:48,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355383913] [2019-12-27 16:47:48,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:48,550 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 16:47:48,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355383913] [2019-12-27 16:47:48,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:48,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:47:48,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956341537] [2019-12-27 16:47:48,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:48,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:48,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 481 transitions. [2019-12-27 16:47:48,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:47:49,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:47:49,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:47:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:47:49,470 INFO L87 Difference]: Start difference. First operand 16282 states and 48403 transitions. Second operand 21 states. [2019-12-27 16:47:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:51,678 INFO L93 Difference]: Finished difference Result 24327 states and 71067 transitions. [2019-12-27 16:47:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:47:51,679 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 16:47:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:51,707 INFO L225 Difference]: With dead ends: 24327 [2019-12-27 16:47:51,708 INFO L226 Difference]: Without dead ends: 20323 [2019-12-27 16:47:51,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:47:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20323 states. [2019-12-27 16:47:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20323 to 15943. [2019-12-27 16:47:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15943 states. [2019-12-27 16:47:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15943 states to 15943 states and 47439 transitions. [2019-12-27 16:47:51,978 INFO L78 Accepts]: Start accepts. Automaton has 15943 states and 47439 transitions. Word has length 66 [2019-12-27 16:47:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:51,979 INFO L462 AbstractCegarLoop]: Abstraction has 15943 states and 47439 transitions. [2019-12-27 16:47:51,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:47:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15943 states and 47439 transitions. [2019-12-27 16:47:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:51,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:51,995 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 16:47:51,995 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-27 16:47:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:51,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003345522] [2019-12-27 16:47:51,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:52,161 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 16:47:52,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003345522] [2019-12-27 16:47:52,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:52,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:47:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678440425] [2019-12-27 16:47:52,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:52,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:52,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 323 transitions. [2019-12-27 16:47:52,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:52,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:52,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:47:52,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:47:52,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:52,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:47:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:47:52,884 INFO L87 Difference]: Start difference. First operand 15943 states and 47439 transitions. Second operand 22 states. [2019-12-27 16:47:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:59,075 INFO L93 Difference]: Finished difference Result 46854 states and 139206 transitions. [2019-12-27 16:47:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 16:47:59,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:47:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:59,132 INFO L225 Difference]: With dead ends: 46854 [2019-12-27 16:47:59,132 INFO L226 Difference]: Without dead ends: 40150 [2019-12-27 16:47:59,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=917, Invalid=5889, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 16:47:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40150 states. [2019-12-27 16:47:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40150 to 21539. [2019-12-27 16:47:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21539 states. [2019-12-27 16:47:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21539 states to 21539 states and 64211 transitions. [2019-12-27 16:47:59,616 INFO L78 Accepts]: Start accepts. Automaton has 21539 states and 64211 transitions. Word has length 66 [2019-12-27 16:47:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:59,616 INFO L462 AbstractCegarLoop]: Abstraction has 21539 states and 64211 transitions. [2019-12-27 16:47:59,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:47:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21539 states and 64211 transitions. [2019-12-27 16:47:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:59,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:59,638 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 16:47:59,638 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1428156048, now seen corresponding path program 5 times [2019-12-27 16:47:59,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:59,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463743291] [2019-12-27 16:47:59,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:59,799 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 16:47:59,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463743291] [2019-12-27 16:47:59,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:59,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:47:59,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300778284] [2019-12-27 16:47:59,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:59,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:00,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 634 transitions. [2019-12-27 16:48:00,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:00,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:00,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:00,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 16:48:00,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 16:48:00,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 16:48:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:48:00,847 INFO L87 Difference]: Start difference. First operand 21539 states and 64211 transitions. Second operand 25 states. [2019-12-27 16:48:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:09,058 INFO L93 Difference]: Finished difference Result 52479 states and 153494 transitions. [2019-12-27 16:48:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-27 16:48:09,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-12-27 16:48:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:09,131 INFO L225 Difference]: With dead ends: 52479 [2019-12-27 16:48:09,132 INFO L226 Difference]: Without dead ends: 49342 [2019-12-27 16:48:09,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2110, Invalid=14660, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 16:48:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49342 states. [2019-12-27 16:48:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49342 to 23533. [2019-12-27 16:48:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23533 states. [2019-12-27 16:48:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23533 states to 23533 states and 70034 transitions. [2019-12-27 16:48:09,732 INFO L78 Accepts]: Start accepts. Automaton has 23533 states and 70034 transitions. Word has length 66 [2019-12-27 16:48:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:09,732 INFO L462 AbstractCegarLoop]: Abstraction has 23533 states and 70034 transitions. [2019-12-27 16:48:09,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 16:48:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23533 states and 70034 transitions. [2019-12-27 16:48:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:09,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:09,762 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 16:48:09,762 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash -336670156, now seen corresponding path program 6 times [2019-12-27 16:48:09,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:09,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061512322] [2019-12-27 16:48:09,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:10,394 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 16:48:10,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061512322] [2019-12-27 16:48:10,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:10,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:48:10,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393871716] [2019-12-27 16:48:10,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:10,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:10,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 469 transitions. [2019-12-27 16:48:10,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:10,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:11,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:11,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:48:11,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:11,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:12,144 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 16:48:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-27 16:48:12,470 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-27 16:48:12,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 53 times. [2019-12-27 16:48:12,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 16:48:12,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 16:48:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:48:12,472 INFO L87 Difference]: Start difference. First operand 23533 states and 70034 transitions. Second operand 34 states. [2019-12-27 16:48:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:22,401 INFO L93 Difference]: Finished difference Result 32332 states and 94052 transitions. [2019-12-27 16:48:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:48:22,402 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-12-27 16:48:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:22,441 INFO L225 Difference]: With dead ends: 32332 [2019-12-27 16:48:22,441 INFO L226 Difference]: Without dead ends: 29712 [2019-12-27 16:48:22,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=650, Invalid=3510, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 16:48:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29712 states. [2019-12-27 16:48:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29712 to 23783. [2019-12-27 16:48:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23783 states. [2019-12-27 16:48:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23783 states to 23783 states and 70581 transitions. [2019-12-27 16:48:22,811 INFO L78 Accepts]: Start accepts. Automaton has 23783 states and 70581 transitions. Word has length 66 [2019-12-27 16:48:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:22,811 INFO L462 AbstractCegarLoop]: Abstraction has 23783 states and 70581 transitions. [2019-12-27 16:48:22,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 16:48:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23783 states and 70581 transitions. [2019-12-27 16:48:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:22,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:22,838 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 16:48:22,838 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash -85497452, now seen corresponding path program 7 times [2019-12-27 16:48:22,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:22,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315338305] [2019-12-27 16:48:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:23,138 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 16:48:23,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315338305] [2019-12-27 16:48:23,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:23,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:48:23,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836716371] [2019-12-27 16:48:23,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:23,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:23,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 545 transitions. [2019-12-27 16:48:23,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:23,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:48:24,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 16:48:24,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 16:48:24,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 16:48:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:48:24,109 INFO L87 Difference]: Start difference. First operand 23783 states and 70581 transitions. Second operand 23 states. [2019-12-27 16:48:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:33,073 INFO L93 Difference]: Finished difference Result 57793 states and 165324 transitions. [2019-12-27 16:48:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 16:48:33,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 16:48:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:33,146 INFO L225 Difference]: With dead ends: 57793 [2019-12-27 16:48:33,147 INFO L226 Difference]: Without dead ends: 57625 [2019-12-27 16:48:33,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1307, Invalid=5173, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 16:48:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57625 states. [2019-12-27 16:48:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57625 to 22401. [2019-12-27 16:48:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22401 states. [2019-12-27 16:48:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22401 states to 22401 states and 65938 transitions. [2019-12-27 16:48:33,912 INFO L78 Accepts]: Start accepts. Automaton has 22401 states and 65938 transitions. Word has length 66 [2019-12-27 16:48:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:33,912 INFO L462 AbstractCegarLoop]: Abstraction has 22401 states and 65938 transitions. [2019-12-27 16:48:33,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 16:48:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22401 states and 65938 transitions. [2019-12-27 16:48:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:33,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:33,938 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 16:48:33,938 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1622676514, now seen corresponding path program 8 times [2019-12-27 16:48:33,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:33,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603311220] [2019-12-27 16:48:33,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:33,996 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 16:48:33,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603311220] [2019-12-27 16:48:33,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:33,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:33,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242150291] [2019-12-27 16:48:33,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:34,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:34,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 552 transitions. [2019-12-27 16:48:34,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:34,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:34,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:34,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:34,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:34,333 INFO L87 Difference]: Start difference. First operand 22401 states and 65938 transitions. Second operand 3 states. [2019-12-27 16:48:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:34,403 INFO L93 Difference]: Finished difference Result 22400 states and 65936 transitions. [2019-12-27 16:48:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:34,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:48:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:34,434 INFO L225 Difference]: With dead ends: 22400 [2019-12-27 16:48:34,434 INFO L226 Difference]: Without dead ends: 22400 [2019-12-27 16:48:34,434 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 16:48:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22400 states. [2019-12-27 16:48:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22400 to 19898. [2019-12-27 16:48:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19898 states. [2019-12-27 16:48:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19898 states to 19898 states and 58959 transitions. [2019-12-27 16:48:34,746 INFO L78 Accepts]: Start accepts. Automaton has 19898 states and 58959 transitions. Word has length 66 [2019-12-27 16:48:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:34,747 INFO L462 AbstractCegarLoop]: Abstraction has 19898 states and 58959 transitions. [2019-12-27 16:48:34,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19898 states and 58959 transitions. [2019-12-27 16:48:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:34,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:34,770 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 16:48:34,770 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 1 times [2019-12-27 16:48:34,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:34,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948246701] [2019-12-27 16:48:34,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:34,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:34,887 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:34,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:34,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-27 16:48:34,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-27 16:48:34,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~x~0_In386306204 ~__unbuffered_p0_EAX~0_Out386306204) (= ~b$r_buff1_thd3~0_Out386306204 ~b$r_buff0_thd3~0_In386306204) (= ~b$r_buff0_thd0~0_In386306204 ~b$r_buff1_thd0~0_Out386306204) (= ~b$r_buff0_thd2~0_In386306204 ~b$r_buff1_thd2~0_Out386306204) (= 1 ~b$r_buff0_thd1~0_Out386306204) (= ~b$r_buff1_thd1~0_Out386306204 ~b$r_buff0_thd1~0_In386306204) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In386306204 0))) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In386306204, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In386306204, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In386306204, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In386306204, ~x~0=~x~0_In386306204, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In386306204} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out386306204, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In386306204, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out386306204, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In386306204, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out386306204, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out386306204, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In386306204, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out386306204, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out386306204, ~x~0=~x~0_In386306204, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In386306204} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:34,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In1395475292 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In1395475292 256)))) (or (and (or .cse0 .cse1) (= ~b~0_In1395475292 |P1Thread1of1ForFork0_#t~ite9_Out1395475292|)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1395475292| ~b$w_buff1~0_In1395475292) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1395475292, ~b~0=~b~0_In1395475292, ~b$w_buff1~0=~b$w_buff1~0_In1395475292, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1395475292} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1395475292, ~b~0=~b~0_In1395475292, ~b$w_buff1~0=~b$w_buff1~0_In1395475292, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1395475292|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1395475292} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:34,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:34,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-963763914 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-963763914 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-963763914| ~b$w_buff0_used~0_In-963763914) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-963763914| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-963763914, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-963763914} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-963763914, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-963763914, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-963763914|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 16:48:34,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff0_used~0_In442056627 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In442056627 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In442056627 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In442056627 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out442056627| ~b$w_buff1_used~0_In442056627) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out442056627|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In442056627, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In442056627, ~b$w_buff1_used~0=~b$w_buff1_used~0_In442056627, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In442056627} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In442056627, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In442056627, ~b$w_buff1_used~0=~b$w_buff1_used~0_In442056627, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out442056627|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In442056627} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:48:34,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-2078787828 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-2078787828 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-2078787828|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In-2078787828 |P1Thread1of1ForFork0_#t~ite13_Out-2078787828|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2078787828, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2078787828} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2078787828, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2078787828, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-2078787828|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 16:48:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In-1906125233 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In-1906125233 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-1906125233 256))) (.cse0 (= (mod ~b$r_buff1_thd2~0_In-1906125233 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1906125233| ~b$r_buff1_thd2~0_In-1906125233) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1906125233| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1906125233, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1906125233, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1906125233, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1906125233} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1906125233, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1906125233, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1906125233, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1906125233|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1906125233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 16:48:34,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 16:48:34,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1091649778 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1091649778 256)))) (or (= 0 (mod ~b$w_buff0_used~0_In1091649778 256)) (and (= 0 (mod ~b$r_buff1_thd3~0_In1091649778 256)) .cse0) (and (= (mod ~b$w_buff1_used~0_In1091649778 256) 0) .cse0))) (= |P2Thread1of1ForFork1_#t~ite20_Out1091649778| |P2Thread1of1ForFork1_#t~ite21_Out1091649778|) (= |P2Thread1of1ForFork1_#t~ite20_Out1091649778| ~b$w_buff0~0_In1091649778) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite21_Out1091649778| ~b$w_buff0~0_In1091649778) (= |P2Thread1of1ForFork1_#t~ite20_In1091649778| |P2Thread1of1ForFork1_#t~ite20_Out1091649778|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1091649778, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1091649778, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1091649778|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1091649778, ~b$w_buff0~0=~b$w_buff0~0_In1091649778, ~weak$$choice2~0=~weak$$choice2~0_In1091649778, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1091649778} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1091649778, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1091649778, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1091649778|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1091649778|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1091649778, ~b$w_buff0~0=~b$w_buff0~0_In1091649778, ~weak$$choice2~0=~weak$$choice2~0_In1091649778, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1091649778} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:48:34,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-368463060 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_Out-368463060| |P2Thread1of1ForFork1_#t~ite27_Out-368463060|) (= |P2Thread1of1ForFork1_#t~ite26_Out-368463060| ~b$w_buff0_used~0_In-368463060) .cse0 (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-368463060 256)))) (or (= (mod ~b$w_buff0_used~0_In-368463060 256) 0) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-368463060 256))) (and (= (mod ~b$w_buff1_used~0_In-368463060 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-368463060| ~b$w_buff0_used~0_In-368463060) (= |P2Thread1of1ForFork1_#t~ite26_In-368463060| |P2Thread1of1ForFork1_#t~ite26_Out-368463060|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-368463060, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-368463060, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-368463060|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-368463060, ~weak$$choice2~0=~weak$$choice2~0_In-368463060, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-368463060} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-368463060, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-368463060|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-368463060, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-368463060|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-368463060, ~weak$$choice2~0=~weak$$choice2~0_In-368463060, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-368463060} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 16:48:34,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:34,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 16:48:34,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd3~0_In-334379171 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-334379171 256)))) (or (and (= ~b$w_buff1~0_In-334379171 |P2Thread1of1ForFork1_#t~ite38_Out-334379171|) (not .cse0) (not .cse1)) (and (= ~b~0_In-334379171 |P2Thread1of1ForFork1_#t~ite38_Out-334379171|) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-334379171, ~b~0=~b~0_In-334379171, ~b$w_buff1~0=~b$w_buff1~0_In-334379171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-334379171} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-334379171|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-334379171, ~b~0=~b~0_In-334379171, ~b$w_buff1~0=~b$w_buff1~0_In-334379171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-334379171} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 16:48:34,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 16:48:34,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1867901941 256))) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-1867901941 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-1867901941| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-1867901941 |P2Thread1of1ForFork1_#t~ite40_Out-1867901941|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1867901941, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1867901941} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1867901941, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1867901941, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1867901941|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 16:48:34,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In1869342917 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1869342917 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In1869342917 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In1869342917 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out1869342917| ~b$w_buff1_used~0_In1869342917) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out1869342917| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1869342917, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1869342917, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1869342917, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1869342917} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1869342917, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1869342917, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1869342917, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1869342917|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1869342917} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 16:48:34,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1802267984 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1802267984 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1802267984|)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd3~0_In-1802267984 |P2Thread1of1ForFork1_#t~ite42_Out-1802267984|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1802267984, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1802267984} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1802267984, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1802267984, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1802267984|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 16:48:34,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~b$r_buff0_thd3~0_In327475053 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In327475053 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In327475053 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In327475053 256)))) (or (and (= ~b$r_buff1_thd3~0_In327475053 |P2Thread1of1ForFork1_#t~ite43_Out327475053|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out327475053|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In327475053, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In327475053, ~b$w_buff1_used~0=~b$w_buff1_used~0_In327475053, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In327475053} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In327475053, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In327475053, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out327475053|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In327475053, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In327475053} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 16:48:34,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 16:48:34,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-2103770716 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-2103770716 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out-2103770716| 0)) (and (= ~b$w_buff0_used~0_In-2103770716 |P0Thread1of1ForFork2_#t~ite5_Out-2103770716|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2103770716, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2103770716} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2103770716, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2103770716, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-2103770716|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:48:34,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In-1716613470 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1716613470 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In-1716613470 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1716613470 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1716613470 |P0Thread1of1ForFork2_#t~ite6_Out-1716613470|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1716613470|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1716613470, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1716613470, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1716613470, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1716613470} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1716613470, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1716613470, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1716613470, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1716613470, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1716613470|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:48:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In2126097555 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In2126097555 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd1~0_Out2126097555 ~b$r_buff0_thd1~0_In2126097555)) (and (= ~b$r_buff0_thd1~0_Out2126097555 0) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2126097555, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2126097555} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2126097555, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out2126097555, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out2126097555|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:48:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In-710295269 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-710295269 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-710295269 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In-710295269 256)))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-710295269|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out-710295269| ~b$r_buff1_thd1~0_In-710295269) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-710295269, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-710295269, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-710295269, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-710295269} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-710295269, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-710295269, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-710295269, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-710295269, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-710295269|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:48:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:48:34,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:48:34,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In-1709816435 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-1709816435 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1709816435| ~b$w_buff1~0_In-1709816435) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1709816435| ~b~0_In-1709816435)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1709816435, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1709816435, ~b~0=~b~0_In-1709816435, ~b$w_buff1~0=~b$w_buff1~0_In-1709816435} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1709816435, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1709816435, ~b~0=~b~0_In-1709816435, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1709816435|, ~b$w_buff1~0=~b$w_buff1~0_In-1709816435} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:48:34,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:48:34,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-182904288 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-182904288 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-182904288|) (not .cse0) (not .cse1)) (and (= ~b$w_buff0_used~0_In-182904288 |ULTIMATE.start_main_#t~ite49_Out-182904288|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-182904288, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-182904288} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-182904288, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-182904288|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-182904288} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:48:34,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In410007396 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In410007396 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In410007396 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In410007396 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out410007396|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~b$w_buff1_used~0_In410007396 |ULTIMATE.start_main_#t~ite50_Out410007396|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In410007396, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In410007396, ~b$w_buff1_used~0=~b$w_buff1_used~0_In410007396, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In410007396} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out410007396|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In410007396, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In410007396, ~b$w_buff1_used~0=~b$w_buff1_used~0_In410007396, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In410007396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:48:34,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In525844718 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In525844718 256) 0))) (or (and (= ~b$r_buff0_thd0~0_In525844718 |ULTIMATE.start_main_#t~ite51_Out525844718|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out525844718|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In525844718, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In525844718} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In525844718, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out525844718|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In525844718} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:48:34,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1087095645 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1087095645 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1087095645 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In-1087095645 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1087095645| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1087095645| ~b$r_buff1_thd0~0_In-1087095645) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1087095645, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1087095645, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1087095645, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1087095645} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1087095645, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1087095645|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1087095645, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1087095645, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1087095645} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:48:34,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:35,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:35 BasicIcfg [2019-12-27 16:48:35,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:35,010 INFO L168 Benchmark]: Toolchain (without parser) took 181168.22 ms. Allocated memory was 138.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,011 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.10 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,012 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,012 INFO L168 Benchmark]: RCFGBuilder took 851.70 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,012 INFO L168 Benchmark]: TraceAbstraction took 179402.44 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:35,017 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.10 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.70 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.2 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 179402.44 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.2 MB in the beginning and 1.6 GB in the end (delta: -1.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: 5.6s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.0s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 86.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8202 SDtfs, 21885 SDslu, 40106 SDs, 0 SdLazy, 40667 SolverSat, 1550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1288 GetRequests, 304 SyntacticMatches, 100 SemanticMatches, 884 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19137 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 45.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 340155 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1705 NumberOfCodeBlocks, 1705 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1605 ConstructedInterpolants, 0 QuantifiedInterpolants, 404194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...