/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:11:31,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:11:31,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:11:31,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:11:31,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:11:31,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:11:31,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:11:31,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:11:31,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:11:31,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:11:31,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:11:31,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:11:31,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:11:31,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:11:31,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:11:31,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:11:31,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:11:31,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:11:31,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:11:31,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:11:31,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:11:31,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:11:31,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:11:31,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:11:31,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:11:31,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:11:31,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:11:31,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:11:31,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:11:31,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:11:31,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:11:31,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:11:31,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:11:31,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:11:31,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:11:31,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:11:31,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:11:31,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:11:31,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:11:31,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:11:31,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:11:31,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:11:31,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:11:31,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:11:31,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:11:31,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:11:31,779 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:11:31,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:11:31,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:11:31,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:11:31,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:11:31,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:11:31,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:11:31,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:11:31,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:11:31,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:11:31,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:11:31,781 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:11:31,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:11:31,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:11:31,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:11:31,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:11:31,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:11:31,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:11:31,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:11:31,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:11:31,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:11:31,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:11:31,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:11:31,786 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:11:31,786 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:11:31,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:11:31,786 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:11:31,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:11:32,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:11:32,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:11:32,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:11:32,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:11:32,074 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:11:32,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-27 20:11:32,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb99a4b/54973c991a3a4324909ffde01338fb66/FLAG7ac14d12a [2019-12-27 20:11:32,725 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:11:32,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-27 20:11:32,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb99a4b/54973c991a3a4324909ffde01338fb66/FLAG7ac14d12a [2019-12-27 20:11:33,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bb99a4b/54973c991a3a4324909ffde01338fb66 [2019-12-27 20:11:33,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:11:33,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:11:33,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:11:33,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:11:33,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:11:33,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfe2024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33, skipping insertion in model container [2019-12-27 20:11:33,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:11:33,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:11:33,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:11:33,617 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:11:33,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:11:33,823 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:11:33,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33 WrapperNode [2019-12-27 20:11:33,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:11:33,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:11:33,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:11:33,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:11:33,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:11:33,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:11:33,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:11:33,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:11:33,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (1/1) ... [2019-12-27 20:11:33,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:11:33,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:11:33,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:11:33,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:11:33,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (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 20:11:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:11:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:11:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:11:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:11:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:11:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:11:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:11:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:11:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:11:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:11:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:11:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:11:34,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:11:34,020 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 20:11:34,773 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:11:34,773 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:11:34,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:11:34 BoogieIcfgContainer [2019-12-27 20:11:34,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:11:34,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:11:34,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:11:34,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:11:34,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:11:33" (1/3) ... [2019-12-27 20:11:34,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26df5ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:11:34, skipping insertion in model container [2019-12-27 20:11:34,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:11:33" (2/3) ... [2019-12-27 20:11:34,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26df5ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:11:34, skipping insertion in model container [2019-12-27 20:11:34,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:11:34" (3/3) ... [2019-12-27 20:11:34,785 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-27 20:11:34,796 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:11:34,797 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:11:34,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:11:34,806 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:11:34,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,850 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,915 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,915 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,921 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,921 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:11:34,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:11:34,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:11:34,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:11:34,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:11:34,967 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:11:34,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:11:34,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:11:34,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:11:34,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:11:34,985 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 20:11:34,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 20:11:35,111 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 20:11:35,112 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:11:35,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:11:35,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 20:11:35,258 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 20:11:35,258 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:11:35,267 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:11:35,290 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:11:35,291 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:11:38,759 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 20:11:38,889 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:11:38,985 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79642 [2019-12-27 20:11:38,986 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:11:38,990 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-27 20:11:53,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 95102 states. [2019-12-27 20:11:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 95102 states. [2019-12-27 20:11:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:11:53,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:11:53,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:11:53,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:11:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:11:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 797531429, now seen corresponding path program 1 times [2019-12-27 20:11:53,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:11:53,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490025017] [2019-12-27 20:11:53,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:11:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:11:53,664 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 20:11:53,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490025017] [2019-12-27 20:11:53,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:11:53,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:11:53,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531130993] [2019-12-27 20:11:53,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:11:53,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:11:53,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:11:53,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:11:53,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:11:53,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:11:53,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:11:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:11:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:11:53,695 INFO L87 Difference]: Start difference. First operand 95102 states. Second operand 3 states. [2019-12-27 20:11:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:11:56,724 INFO L93 Difference]: Finished difference Result 93264 states and 402387 transitions. [2019-12-27 20:11:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:11:56,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:11:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:11:57,267 INFO L225 Difference]: With dead ends: 93264 [2019-12-27 20:11:57,267 INFO L226 Difference]: Without dead ends: 87384 [2019-12-27 20:11:57,268 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 20:12:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87384 states. [2019-12-27 20:12:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87384 to 87384. [2019-12-27 20:12:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87384 states. [2019-12-27 20:12:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87384 states to 87384 states and 376487 transitions. [2019-12-27 20:12:03,334 INFO L78 Accepts]: Start accepts. Automaton has 87384 states and 376487 transitions. Word has length 5 [2019-12-27 20:12:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:03,334 INFO L462 AbstractCegarLoop]: Abstraction has 87384 states and 376487 transitions. [2019-12-27 20:12:03,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 87384 states and 376487 transitions. [2019-12-27 20:12:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:12:03,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:03,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:03,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 429489199, now seen corresponding path program 1 times [2019-12-27 20:12:03,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:03,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235217710] [2019-12-27 20:12:03,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:03,428 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 20:12:03,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235217710] [2019-12-27 20:12:03,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:03,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:03,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092889291] [2019-12-27 20:12:03,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:03,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:03,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:12:03,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:03,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:03,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:03,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:03,440 INFO L87 Difference]: Start difference. First operand 87384 states and 376487 transitions. Second operand 3 states. [2019-12-27 20:12:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:06,573 INFO L93 Difference]: Finished difference Result 22591 states and 78202 transitions. [2019-12-27 20:12:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:06,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:12:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:06,636 INFO L225 Difference]: With dead ends: 22591 [2019-12-27 20:12:06,636 INFO L226 Difference]: Without dead ends: 22591 [2019-12-27 20:12:06,637 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 20:12:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-27 20:12:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 22591. [2019-12-27 20:12:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22591 states. [2019-12-27 20:12:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 78202 transitions. [2019-12-27 20:12:07,175 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 78202 transitions. Word has length 13 [2019-12-27 20:12:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:07,175 INFO L462 AbstractCegarLoop]: Abstraction has 22591 states and 78202 transitions. [2019-12-27 20:12:07,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 78202 transitions. [2019-12-27 20:12:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:12:07,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:07,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:07,177 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1420519725, now seen corresponding path program 1 times [2019-12-27 20:12:07,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:07,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020828115] [2019-12-27 20:12:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:07,253 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 20:12:07,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020828115] [2019-12-27 20:12:07,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:07,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:07,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715415242] [2019-12-27 20:12:07,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:07,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:07,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:12:07,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:07,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:07,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:07,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:07,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:07,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:07,259 INFO L87 Difference]: Start difference. First operand 22591 states and 78202 transitions. Second operand 4 states. [2019-12-27 20:12:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:07,647 INFO L93 Difference]: Finished difference Result 33180 states and 110963 transitions. [2019-12-27 20:12:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:07,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:12:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:07,729 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 20:12:07,730 INFO L226 Difference]: Without dead ends: 33166 [2019-12-27 20:12:07,730 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 20:12:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-12-27 20:12:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 29831. [2019-12-27 20:12:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29831 states. [2019-12-27 20:12:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29831 states to 29831 states and 100864 transitions. [2019-12-27 20:12:08,812 INFO L78 Accepts]: Start accepts. Automaton has 29831 states and 100864 transitions. Word has length 13 [2019-12-27 20:12:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:08,813 INFO L462 AbstractCegarLoop]: Abstraction has 29831 states and 100864 transitions. [2019-12-27 20:12:08,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29831 states and 100864 transitions. [2019-12-27 20:12:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:12:08,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:08,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:08,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash 839242224, now seen corresponding path program 1 times [2019-12-27 20:12:08,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:08,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100664619] [2019-12-27 20:12:08,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:08,929 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 20:12:08,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100664619] [2019-12-27 20:12:08,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:08,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:08,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [921593355] [2019-12-27 20:12:08,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:08,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:08,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:12:08,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:09,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:12:09,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:12:09,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:12:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:09,020 INFO L87 Difference]: Start difference. First operand 29831 states and 100864 transitions. Second operand 7 states. [2019-12-27 20:12:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:09,724 INFO L93 Difference]: Finished difference Result 42454 states and 141193 transitions. [2019-12-27 20:12:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:12:09,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 20:12:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:09,801 INFO L225 Difference]: With dead ends: 42454 [2019-12-27 20:12:09,802 INFO L226 Difference]: Without dead ends: 42438 [2019-12-27 20:12:09,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42438 states. [2019-12-27 20:12:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42438 to 34354. [2019-12-27 20:12:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34354 states. [2019-12-27 20:12:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34354 states to 34354 states and 115309 transitions. [2019-12-27 20:12:10,742 INFO L78 Accepts]: Start accepts. Automaton has 34354 states and 115309 transitions. Word has length 14 [2019-12-27 20:12:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:10,743 INFO L462 AbstractCegarLoop]: Abstraction has 34354 states and 115309 transitions. [2019-12-27 20:12:10,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:12:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34354 states and 115309 transitions. [2019-12-27 20:12:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:12:10,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:10,756 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 20:12:10,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1523113448, now seen corresponding path program 1 times [2019-12-27 20:12:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:10,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939464505] [2019-12-27 20:12:10,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:11,069 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 20:12:11,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939464505] [2019-12-27 20:12:11,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:11,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:12:11,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013920487] [2019-12-27 20:12:11,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:11,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:11,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 74 transitions. [2019-12-27 20:12:11,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:11,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:11,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:11,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:12:11,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:12:11,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:12:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:12:11,143 INFO L87 Difference]: Start difference. First operand 34354 states and 115309 transitions. Second operand 8 states. [2019-12-27 20:12:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:12,312 INFO L93 Difference]: Finished difference Result 54694 states and 179145 transitions. [2019-12-27 20:12:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:12:12,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 20:12:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:12,456 INFO L225 Difference]: With dead ends: 54694 [2019-12-27 20:12:12,456 INFO L226 Difference]: Without dead ends: 54654 [2019-12-27 20:12:12,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:12:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54654 states. [2019-12-27 20:12:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54654 to 34641. [2019-12-27 20:12:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 20:12:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 115518 transitions. [2019-12-27 20:12:13,332 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 115518 transitions. Word has length 22 [2019-12-27 20:12:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:13,333 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 115518 transitions. [2019-12-27 20:12:13,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:12:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 115518 transitions. [2019-12-27 20:12:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:12:13,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:13,349 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 20:12:13,350 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:13,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash 142007166, now seen corresponding path program 1 times [2019-12-27 20:12:13,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:13,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30515691] [2019-12-27 20:12:13,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:13,415 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 20:12:13,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30515691] [2019-12-27 20:12:13,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:13,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:13,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [720490266] [2019-12-27 20:12:13,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:13,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:13,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:12:13,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:13,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:13,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:13,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:13,428 INFO L87 Difference]: Start difference. First operand 34641 states and 115518 transitions. Second operand 4 states. [2019-12-27 20:12:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:13,511 INFO L93 Difference]: Finished difference Result 13809 states and 42789 transitions. [2019-12-27 20:12:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:12:13,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:12:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:13,764 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 20:12:13,765 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 20:12:13,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 20:12:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13589. [2019-12-27 20:12:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13589 states. [2019-12-27 20:12:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13589 states to 13589 states and 42149 transitions. [2019-12-27 20:12:13,966 INFO L78 Accepts]: Start accepts. Automaton has 13589 states and 42149 transitions. Word has length 25 [2019-12-27 20:12:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:13,967 INFO L462 AbstractCegarLoop]: Abstraction has 13589 states and 42149 transitions. [2019-12-27 20:12:13,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13589 states and 42149 transitions. [2019-12-27 20:12:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:12:13,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:13,988 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 20:12:13,988 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1724321301, now seen corresponding path program 1 times [2019-12-27 20:12:13,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:13,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613964479] [2019-12-27 20:12:13,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:14,102 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 20:12:14,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613964479] [2019-12-27 20:12:14,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:14,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:12:14,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030919324] [2019-12-27 20:12:14,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:14,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:14,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 96 transitions. [2019-12-27 20:12:14,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:14,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:14,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:14,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:14,139 INFO L87 Difference]: Start difference. First operand 13589 states and 42149 transitions. Second operand 5 states. [2019-12-27 20:12:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:14,695 INFO L93 Difference]: Finished difference Result 19435 states and 59648 transitions. [2019-12-27 20:12:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:14,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 20:12:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:14,732 INFO L225 Difference]: With dead ends: 19435 [2019-12-27 20:12:14,732 INFO L226 Difference]: Without dead ends: 19435 [2019-12-27 20:12:14,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19435 states. [2019-12-27 20:12:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19435 to 17764. [2019-12-27 20:12:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17764 states. [2019-12-27 20:12:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17764 states to 17764 states and 54945 transitions. [2019-12-27 20:12:15,133 INFO L78 Accepts]: Start accepts. Automaton has 17764 states and 54945 transitions. Word has length 39 [2019-12-27 20:12:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:15,133 INFO L462 AbstractCegarLoop]: Abstraction has 17764 states and 54945 transitions. [2019-12-27 20:12:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17764 states and 54945 transitions. [2019-12-27 20:12:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:12:15,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:15,169 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 20:12:15,169 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1837073981, now seen corresponding path program 2 times [2019-12-27 20:12:15,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:15,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130606445] [2019-12-27 20:12:15,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:15,271 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 20:12:15,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130606445] [2019-12-27 20:12:15,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:15,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:12:15,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541126673] [2019-12-27 20:12:15,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:15,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:15,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 94 transitions. [2019-12-27 20:12:15,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:15,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:12:15,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:12:15,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:12:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:12:15,362 INFO L87 Difference]: Start difference. First operand 17764 states and 54945 transitions. Second operand 8 states. [2019-12-27 20:12:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:17,091 INFO L93 Difference]: Finished difference Result 49517 states and 150589 transitions. [2019-12-27 20:12:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:12:17,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 20:12:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:17,174 INFO L225 Difference]: With dead ends: 49517 [2019-12-27 20:12:17,174 INFO L226 Difference]: Without dead ends: 49517 [2019-12-27 20:12:17,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:12:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49517 states. [2019-12-27 20:12:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49517 to 19957. [2019-12-27 20:12:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19957 states. [2019-12-27 20:12:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19957 states to 19957 states and 61982 transitions. [2019-12-27 20:12:17,842 INFO L78 Accepts]: Start accepts. Automaton has 19957 states and 61982 transitions. Word has length 39 [2019-12-27 20:12:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:17,842 INFO L462 AbstractCegarLoop]: Abstraction has 19957 states and 61982 transitions. [2019-12-27 20:12:17,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:12:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 19957 states and 61982 transitions. [2019-12-27 20:12:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:12:17,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:17,881 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 20:12:17,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash 6353365, now seen corresponding path program 3 times [2019-12-27 20:12:17,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:17,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157853014] [2019-12-27 20:12:17,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:17,946 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 20:12:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157853014] [2019-12-27 20:12:17,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:17,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:12:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651657296] [2019-12-27 20:12:17,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:17,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:17,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 92 transitions. [2019-12-27 20:12:17,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:17,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:17,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:17,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:17,980 INFO L87 Difference]: Start difference. First operand 19957 states and 61982 transitions. Second operand 5 states. [2019-12-27 20:12:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:18,084 INFO L93 Difference]: Finished difference Result 18572 states and 58389 transitions. [2019-12-27 20:12:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:18,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 20:12:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:18,110 INFO L225 Difference]: With dead ends: 18572 [2019-12-27 20:12:18,110 INFO L226 Difference]: Without dead ends: 18572 [2019-12-27 20:12:18,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18572 states. [2019-12-27 20:12:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18572 to 17762. [2019-12-27 20:12:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-12-27 20:12:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 56111 transitions. [2019-12-27 20:12:18,378 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 56111 transitions. Word has length 39 [2019-12-27 20:12:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:18,379 INFO L462 AbstractCegarLoop]: Abstraction has 17762 states and 56111 transitions. [2019-12-27 20:12:18,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 56111 transitions. [2019-12-27 20:12:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:18,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:18,399 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] [2019-12-27 20:12:18,400 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1406487866, now seen corresponding path program 1 times [2019-12-27 20:12:18,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:18,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788642233] [2019-12-27 20:12:18,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:18,456 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 20:12:18,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788642233] [2019-12-27 20:12:18,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:18,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:18,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881555899] [2019-12-27 20:12:18,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:18,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:18,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 314 states and 602 transitions. [2019-12-27 20:12:18,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:18,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:12:18,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:18,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:18,948 INFO L87 Difference]: Start difference. First operand 17762 states and 56111 transitions. Second operand 3 states. [2019-12-27 20:12:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:19,056 INFO L93 Difference]: Finished difference Result 23930 states and 74187 transitions. [2019-12-27 20:12:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:19,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:12:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:19,091 INFO L225 Difference]: With dead ends: 23930 [2019-12-27 20:12:19,092 INFO L226 Difference]: Without dead ends: 23930 [2019-12-27 20:12:19,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 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 20:12:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23930 states. [2019-12-27 20:12:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23930 to 19510. [2019-12-27 20:12:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19510 states. [2019-12-27 20:12:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 61316 transitions. [2019-12-27 20:12:19,435 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 61316 transitions. Word has length 54 [2019-12-27 20:12:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:19,435 INFO L462 AbstractCegarLoop]: Abstraction has 19510 states and 61316 transitions. [2019-12-27 20:12:19,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 61316 transitions. [2019-12-27 20:12:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:19,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:19,458 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] [2019-12-27 20:12:19,459 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash 370887878, now seen corresponding path program 1 times [2019-12-27 20:12:19,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:19,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126052552] [2019-12-27 20:12:19,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:19,538 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 20:12:19,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126052552] [2019-12-27 20:12:19,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:19,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:19,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228776103] [2019-12-27 20:12:19,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:19,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:19,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 314 states and 602 transitions. [2019-12-27 20:12:19,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:19,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:12:19,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:12:19,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:12:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:12:19,885 INFO L87 Difference]: Start difference. First operand 19510 states and 61316 transitions. Second operand 6 states. [2019-12-27 20:12:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:20,333 INFO L93 Difference]: Finished difference Result 42500 states and 132935 transitions. [2019-12-27 20:12:20,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:12:20,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 20:12:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:20,380 INFO L225 Difference]: With dead ends: 42500 [2019-12-27 20:12:20,380 INFO L226 Difference]: Without dead ends: 22899 [2019-12-27 20:12:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:12:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22899 states. [2019-12-27 20:12:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22899 to 16295. [2019-12-27 20:12:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16295 states. [2019-12-27 20:12:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16295 states to 16295 states and 51180 transitions. [2019-12-27 20:12:20,727 INFO L78 Accepts]: Start accepts. Automaton has 16295 states and 51180 transitions. Word has length 54 [2019-12-27 20:12:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:20,728 INFO L462 AbstractCegarLoop]: Abstraction has 16295 states and 51180 transitions. [2019-12-27 20:12:20,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:12:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 16295 states and 51180 transitions. [2019-12-27 20:12:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:20,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:20,753 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] [2019-12-27 20:12:20,753 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash 81413032, now seen corresponding path program 2 times [2019-12-27 20:12:20,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:20,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683017805] [2019-12-27 20:12:20,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:12:20,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683017805] [2019-12-27 20:12:20,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:20,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:12:20,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960762786] [2019-12-27 20:12:20,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:20,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:21,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 407 transitions. [2019-12-27 20:12:21,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:21,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:12:21,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:12:21,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:12:21,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:12:21,321 INFO L87 Difference]: Start difference. First operand 16295 states and 51180 transitions. Second operand 8 states. [2019-12-27 20:12:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:22,676 INFO L93 Difference]: Finished difference Result 59340 states and 181838 transitions. [2019-12-27 20:12:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:12:22,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 20:12:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:22,741 INFO L225 Difference]: With dead ends: 59340 [2019-12-27 20:12:22,741 INFO L226 Difference]: Without dead ends: 44964 [2019-12-27 20:12:22,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:12:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44964 states. [2019-12-27 20:12:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44964 to 19594. [2019-12-27 20:12:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19594 states. [2019-12-27 20:12:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19594 states to 19594 states and 61390 transitions. [2019-12-27 20:12:23,255 INFO L78 Accepts]: Start accepts. Automaton has 19594 states and 61390 transitions. Word has length 54 [2019-12-27 20:12:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:23,255 INFO L462 AbstractCegarLoop]: Abstraction has 19594 states and 61390 transitions. [2019-12-27 20:12:23,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:12:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 19594 states and 61390 transitions. [2019-12-27 20:12:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:23,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:23,282 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] [2019-12-27 20:12:23,282 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 990041374, now seen corresponding path program 3 times [2019-12-27 20:12:23,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:23,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046032472] [2019-12-27 20:12:23,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:23,360 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 20:12:23,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046032472] [2019-12-27 20:12:23,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:23,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:12:23,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253574715] [2019-12-27 20:12:23,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:23,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:23,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 416 transitions. [2019-12-27 20:12:23,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:23,742 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:12:23,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:12:23,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:12:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:12:23,743 INFO L87 Difference]: Start difference. First operand 19594 states and 61390 transitions. Second operand 7 states. [2019-12-27 20:12:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:24,187 INFO L93 Difference]: Finished difference Result 47541 states and 145674 transitions. [2019-12-27 20:12:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:12:24,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 20:12:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:24,241 INFO L225 Difference]: With dead ends: 47541 [2019-12-27 20:12:24,241 INFO L226 Difference]: Without dead ends: 34124 [2019-12-27 20:12:24,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:12:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34124 states. [2019-12-27 20:12:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34124 to 22739. [2019-12-27 20:12:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22739 states. [2019-12-27 20:12:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22739 states to 22739 states and 70799 transitions. [2019-12-27 20:12:24,727 INFO L78 Accepts]: Start accepts. Automaton has 22739 states and 70799 transitions. Word has length 54 [2019-12-27 20:12:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:24,728 INFO L462 AbstractCegarLoop]: Abstraction has 22739 states and 70799 transitions. [2019-12-27 20:12:24,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:12:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22739 states and 70799 transitions. [2019-12-27 20:12:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:24,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:24,756 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] [2019-12-27 20:12:24,756 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1620768744, now seen corresponding path program 4 times [2019-12-27 20:12:24,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:24,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846470302] [2019-12-27 20:12:24,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:24,828 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 20:12:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846470302] [2019-12-27 20:12:24,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:24,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:12:24,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361836251] [2019-12-27 20:12:24,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:24,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:24,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 211 transitions. [2019-12-27 20:12:24,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:25,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:12:25,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:12:25,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:25,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:12:25,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:25,046 INFO L87 Difference]: Start difference. First operand 22739 states and 70799 transitions. Second operand 9 states. [2019-12-27 20:12:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:26,363 INFO L93 Difference]: Finished difference Result 85166 states and 258762 transitions. [2019-12-27 20:12:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 20:12:26,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 20:12:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:26,490 INFO L225 Difference]: With dead ends: 85166 [2019-12-27 20:12:26,490 INFO L226 Difference]: Without dead ends: 74047 [2019-12-27 20:12:26,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:12:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74047 states. [2019-12-27 20:12:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74047 to 30953. [2019-12-27 20:12:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30953 states. [2019-12-27 20:12:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30953 states to 30953 states and 96385 transitions. [2019-12-27 20:12:27,671 INFO L78 Accepts]: Start accepts. Automaton has 30953 states and 96385 transitions. Word has length 54 [2019-12-27 20:12:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:27,671 INFO L462 AbstractCegarLoop]: Abstraction has 30953 states and 96385 transitions. [2019-12-27 20:12:27,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:12:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30953 states and 96385 transitions. [2019-12-27 20:12:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:27,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:27,707 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] [2019-12-27 20:12:27,707 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1685739649, now seen corresponding path program 1 times [2019-12-27 20:12:27,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:27,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250060804] [2019-12-27 20:12:27,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:27,748 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 20:12:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250060804] [2019-12-27 20:12:27,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:27,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:27,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1421239364] [2019-12-27 20:12:27,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:27,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:27,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 211 transitions. [2019-12-27 20:12:27,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:27,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:12:27,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:27,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:27,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:27,886 INFO L87 Difference]: Start difference. First operand 30953 states and 96385 transitions. Second operand 3 states. [2019-12-27 20:12:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:28,012 INFO L93 Difference]: Finished difference Result 31610 states and 95055 transitions. [2019-12-27 20:12:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:28,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:12:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:28,054 INFO L225 Difference]: With dead ends: 31610 [2019-12-27 20:12:28,054 INFO L226 Difference]: Without dead ends: 31610 [2019-12-27 20:12:28,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31610 states. [2019-12-27 20:12:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31610 to 22864. [2019-12-27 20:12:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22864 states. [2019-12-27 20:12:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22864 states to 22864 states and 68847 transitions. [2019-12-27 20:12:28,463 INFO L78 Accepts]: Start accepts. Automaton has 22864 states and 68847 transitions. Word has length 54 [2019-12-27 20:12:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:28,463 INFO L462 AbstractCegarLoop]: Abstraction has 22864 states and 68847 transitions. [2019-12-27 20:12:28,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22864 states and 68847 transitions. [2019-12-27 20:12:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:28,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:28,486 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] [2019-12-27 20:12:28,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1519494854, now seen corresponding path program 5 times [2019-12-27 20:12:28,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:28,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913772233] [2019-12-27 20:12:28,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:28,586 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 20:12:28,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913772233] [2019-12-27 20:12:28,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:28,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:12:28,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520878441] [2019-12-27 20:12:28,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:28,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:28,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 500 transitions. [2019-12-27 20:12:28,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:29,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:29,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:12:29,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:12:29,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:12:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:12:29,198 INFO L87 Difference]: Start difference. First operand 22864 states and 68847 transitions. Second operand 10 states. [2019-12-27 20:12:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:31,367 INFO L93 Difference]: Finished difference Result 36927 states and 108817 transitions. [2019-12-27 20:12:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:12:31,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 20:12:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:31,417 INFO L225 Difference]: With dead ends: 36927 [2019-12-27 20:12:31,417 INFO L226 Difference]: Without dead ends: 36927 [2019-12-27 20:12:31,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:12:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36927 states. [2019-12-27 20:12:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36927 to 24151. [2019-12-27 20:12:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24151 states. [2019-12-27 20:12:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24151 states to 24151 states and 72421 transitions. [2019-12-27 20:12:31,877 INFO L78 Accepts]: Start accepts. Automaton has 24151 states and 72421 transitions. Word has length 54 [2019-12-27 20:12:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:31,878 INFO L462 AbstractCegarLoop]: Abstraction has 24151 states and 72421 transitions. [2019-12-27 20:12:31,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:12:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24151 states and 72421 transitions. [2019-12-27 20:12:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:31,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:31,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:31,900 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -531095546, now seen corresponding path program 6 times [2019-12-27 20:12:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:31,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371185228] [2019-12-27 20:12:31,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:32,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 20:12:32,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371185228] [2019-12-27 20:12:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:12:32,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115095451] [2019-12-27 20:12:32,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:32,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:32,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 341 transitions. [2019-12-27 20:12:32,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:32,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:12:32,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:12:32,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:12:32,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:12:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:12:32,420 INFO L87 Difference]: Start difference. First operand 24151 states and 72421 transitions. Second operand 12 states. [2019-12-27 20:12:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:36,163 INFO L93 Difference]: Finished difference Result 55111 states and 162096 transitions. [2019-12-27 20:12:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:12:36,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 20:12:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:36,244 INFO L225 Difference]: With dead ends: 55111 [2019-12-27 20:12:36,244 INFO L226 Difference]: Without dead ends: 55111 [2019-12-27 20:12:36,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=445, Invalid=1717, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 20:12:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55111 states. [2019-12-27 20:12:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55111 to 22630. [2019-12-27 20:12:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22630 states. [2019-12-27 20:12:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22630 states to 22630 states and 68016 transitions. [2019-12-27 20:12:36,904 INFO L78 Accepts]: Start accepts. Automaton has 22630 states and 68016 transitions. Word has length 54 [2019-12-27 20:12:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:36,904 INFO L462 AbstractCegarLoop]: Abstraction has 22630 states and 68016 transitions. [2019-12-27 20:12:36,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:12:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 22630 states and 68016 transitions. [2019-12-27 20:12:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:12:36,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:36,931 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] [2019-12-27 20:12:36,931 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1105712334, now seen corresponding path program 7 times [2019-12-27 20:12:36,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:36,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168342797] [2019-12-27 20:12:36,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:36,992 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 20:12:36,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168342797] [2019-12-27 20:12:36,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:36,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:36,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538031796] [2019-12-27 20:12:36,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:37,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:37,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 281 transitions. [2019-12-27 20:12:37,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:37,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:37,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:37,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:37,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:37,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:37,173 INFO L87 Difference]: Start difference. First operand 22630 states and 68016 transitions. Second operand 3 states. [2019-12-27 20:12:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:37,301 INFO L93 Difference]: Finished difference Result 22630 states and 68014 transitions. [2019-12-27 20:12:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:37,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:12:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:37,347 INFO L225 Difference]: With dead ends: 22630 [2019-12-27 20:12:37,347 INFO L226 Difference]: Without dead ends: 22630 [2019-12-27 20:12:37,348 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 20:12:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22630 states. [2019-12-27 20:12:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22630 to 18352. [2019-12-27 20:12:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18352 states. [2019-12-27 20:12:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18352 states to 18352 states and 56299 transitions. [2019-12-27 20:12:37,680 INFO L78 Accepts]: Start accepts. Automaton has 18352 states and 56299 transitions. Word has length 54 [2019-12-27 20:12:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:37,681 INFO L462 AbstractCegarLoop]: Abstraction has 18352 states and 56299 transitions. [2019-12-27 20:12:37,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18352 states and 56299 transitions. [2019-12-27 20:12:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:12:37,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:37,701 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] [2019-12-27 20:12:37,701 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1839404346, now seen corresponding path program 1 times [2019-12-27 20:12:37,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:37,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43943707] [2019-12-27 20:12:37,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:37,761 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 20:12:37,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43943707] [2019-12-27 20:12:37,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:37,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:37,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938084390] [2019-12-27 20:12:37,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:37,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:38,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 501 transitions. [2019-12-27 20:12:38,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:38,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:12:38,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:38,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:38,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:38,133 INFO L87 Difference]: Start difference. First operand 18352 states and 56299 transitions. Second operand 4 states. [2019-12-27 20:12:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:38,350 INFO L93 Difference]: Finished difference Result 18162 states and 54024 transitions. [2019-12-27 20:12:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:38,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 20:12:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:38,376 INFO L225 Difference]: With dead ends: 18162 [2019-12-27 20:12:38,376 INFO L226 Difference]: Without dead ends: 18162 [2019-12-27 20:12:38,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-27 20:12:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 13112. [2019-12-27 20:12:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-27 20:12:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 39476 transitions. [2019-12-27 20:12:38,611 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 39476 transitions. Word has length 55 [2019-12-27 20:12:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:38,611 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 39476 transitions. [2019-12-27 20:12:38,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 39476 transitions. [2019-12-27 20:12:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:38,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:38,625 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] [2019-12-27 20:12:38,626 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 159664107, now seen corresponding path program 1 times [2019-12-27 20:12:38,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:38,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344223925] [2019-12-27 20:12:38,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:38,724 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 20:12:38,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344223925] [2019-12-27 20:12:38,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:38,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:12:38,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823477116] [2019-12-27 20:12:38,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:38,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:38,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 20:12:38,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:39,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:12:39,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:12:39,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:12:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:39,047 INFO L87 Difference]: Start difference. First operand 13112 states and 39476 transitions. Second operand 9 states. [2019-12-27 20:12:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:40,491 INFO L93 Difference]: Finished difference Result 32969 states and 98984 transitions. [2019-12-27 20:12:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:12:40,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 20:12:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:40,530 INFO L225 Difference]: With dead ends: 32969 [2019-12-27 20:12:40,530 INFO L226 Difference]: Without dead ends: 28028 [2019-12-27 20:12:40,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:12:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28028 states. [2019-12-27 20:12:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28028 to 13718. [2019-12-27 20:12:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13718 states. [2019-12-27 20:12:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13718 states to 13718 states and 40912 transitions. [2019-12-27 20:12:40,832 INFO L78 Accepts]: Start accepts. Automaton has 13718 states and 40912 transitions. Word has length 56 [2019-12-27 20:12:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:40,832 INFO L462 AbstractCegarLoop]: Abstraction has 13718 states and 40912 transitions. [2019-12-27 20:12:40,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:12:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13718 states and 40912 transitions. [2019-12-27 20:12:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:40,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:40,846 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] [2019-12-27 20:12:40,846 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash 806764797, now seen corresponding path program 2 times [2019-12-27 20:12:40,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:40,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314740842] [2019-12-27 20:12:40,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:40,956 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 20:12:40,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314740842] [2019-12-27 20:12:40,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:40,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:12:40,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823092749] [2019-12-27 20:12:40,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:40,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:41,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 355 transitions. [2019-12-27 20:12:41,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:41,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:12:41,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:12:41,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:41,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:12:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:12:41,296 INFO L87 Difference]: Start difference. First operand 13718 states and 40912 transitions. Second operand 9 states. [2019-12-27 20:12:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:42,300 INFO L93 Difference]: Finished difference Result 23342 states and 69188 transitions. [2019-12-27 20:12:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:12:42,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 20:12:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:42,333 INFO L225 Difference]: With dead ends: 23342 [2019-12-27 20:12:42,333 INFO L226 Difference]: Without dead ends: 19743 [2019-12-27 20:12:42,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:12:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2019-12-27 20:12:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 13550. [2019-12-27 20:12:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13550 states. [2019-12-27 20:12:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13550 states to 13550 states and 40388 transitions. [2019-12-27 20:12:42,571 INFO L78 Accepts]: Start accepts. Automaton has 13550 states and 40388 transitions. Word has length 56 [2019-12-27 20:12:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:42,572 INFO L462 AbstractCegarLoop]: Abstraction has 13550 states and 40388 transitions. [2019-12-27 20:12:42,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:12:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 13550 states and 40388 transitions. [2019-12-27 20:12:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:42,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:42,587 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] [2019-12-27 20:12:42,587 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1852085971, now seen corresponding path program 3 times [2019-12-27 20:12:42,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:42,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079740891] [2019-12-27 20:12:42,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:43,129 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 20:12:43,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079740891] [2019-12-27 20:12:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:43,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:12:43,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159000945] [2019-12-27 20:12:43,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:43,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:43,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 396 transitions. [2019-12-27 20:12:43,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:43,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:12:43,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:12:43,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:12:43,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:12:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:12:43,472 INFO L87 Difference]: Start difference. First operand 13550 states and 40388 transitions. Second operand 18 states. [2019-12-27 20:12:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:47,861 INFO L93 Difference]: Finished difference Result 30715 states and 90067 transitions. [2019-12-27 20:12:47,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 20:12:47,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 20:12:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:47,903 INFO L225 Difference]: With dead ends: 30715 [2019-12-27 20:12:47,903 INFO L226 Difference]: Without dead ends: 28097 [2019-12-27 20:12:47,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=707, Invalid=3453, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 20:12:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28097 states. [2019-12-27 20:12:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28097 to 14158. [2019-12-27 20:12:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14158 states. [2019-12-27 20:12:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 41886 transitions. [2019-12-27 20:12:48,362 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 41886 transitions. Word has length 56 [2019-12-27 20:12:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:48,362 INFO L462 AbstractCegarLoop]: Abstraction has 14158 states and 41886 transitions. [2019-12-27 20:12:48,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:12:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 41886 transitions. [2019-12-27 20:12:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:48,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:48,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:48,375 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash -879531663, now seen corresponding path program 4 times [2019-12-27 20:12:48,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:48,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515401216] [2019-12-27 20:12:48,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:48,560 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 20:12:48,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515401216] [2019-12-27 20:12:48,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:48,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:12:48,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050046199] [2019-12-27 20:12:48,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:48,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:48,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 438 transitions. [2019-12-27 20:12:48,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:49,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 20:12:49,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:12:49,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:12:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:12:49,017 INFO L87 Difference]: Start difference. First operand 14158 states and 41886 transitions. Second operand 16 states. [2019-12-27 20:12:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:58,054 INFO L93 Difference]: Finished difference Result 49498 states and 145993 transitions. [2019-12-27 20:12:58,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-12-27 20:12:58,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 20:12:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:58,110 INFO L225 Difference]: With dead ends: 49498 [2019-12-27 20:12:58,110 INFO L226 Difference]: Without dead ends: 48382 [2019-12-27 20:12:58,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8564 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2667, Invalid=18503, Unknown=0, NotChecked=0, Total=21170 [2019-12-27 20:12:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48382 states. [2019-12-27 20:12:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48382 to 16313. [2019-12-27 20:12:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16313 states. [2019-12-27 20:12:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16313 states to 16313 states and 47946 transitions. [2019-12-27 20:12:58,567 INFO L78 Accepts]: Start accepts. Automaton has 16313 states and 47946 transitions. Word has length 56 [2019-12-27 20:12:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:58,568 INFO L462 AbstractCegarLoop]: Abstraction has 16313 states and 47946 transitions. [2019-12-27 20:12:58,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:12:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16313 states and 47946 transitions. [2019-12-27 20:12:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:12:58,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:58,583 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] [2019-12-27 20:12:58,583 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:12:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960527, now seen corresponding path program 5 times [2019-12-27 20:12:58,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:58,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704666093] [2019-12-27 20:12:58,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:58,750 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 20:12:58,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704666093] [2019-12-27 20:12:58,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:58,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:12:58,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066468268] [2019-12-27 20:12:58,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:58,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:58,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 343 transitions. [2019-12-27 20:12:58,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:59,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:12:59,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:12:59,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:12:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:12:59,014 INFO L87 Difference]: Start difference. First operand 16313 states and 47946 transitions. Second operand 12 states. [2019-12-27 20:13:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:00,007 INFO L93 Difference]: Finished difference Result 25114 states and 73579 transitions. [2019-12-27 20:13:00,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:13:00,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 20:13:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:00,037 INFO L225 Difference]: With dead ends: 25114 [2019-12-27 20:13:00,037 INFO L226 Difference]: Without dead ends: 20085 [2019-12-27 20:13:00,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 20:13:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20085 states. [2019-12-27 20:13:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20085 to 12756. [2019-12-27 20:13:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12756 states. [2019-12-27 20:13:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12756 states to 12756 states and 38074 transitions. [2019-12-27 20:13:00,287 INFO L78 Accepts]: Start accepts. Automaton has 12756 states and 38074 transitions. Word has length 56 [2019-12-27 20:13:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:00,288 INFO L462 AbstractCegarLoop]: Abstraction has 12756 states and 38074 transitions. [2019-12-27 20:13:00,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:13:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12756 states and 38074 transitions. [2019-12-27 20:13:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:13:00,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:00,300 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] [2019-12-27 20:13:00,300 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1908396633, now seen corresponding path program 6 times [2019-12-27 20:13:00,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:00,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283296240] [2019-12-27 20:13:00,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:13:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:13:00,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:13:00,445 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:13:00,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_30| 4) |v_#length_21|) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd1~0_68) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~x~0_26 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t424~0.base_30|) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_30|) |v_ULTIMATE.start_main_~#t424~0.offset_23| 0))) (= 0 v_~x$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_30|) 0) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x$r_buff1_thd0~0_21 0) (= v_~x$flush_delayed~0_14 0) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_30| 1)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= v_~x$mem_tmp~0_11 0) (= 0 v_~z~0_9) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_23|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_15|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_23|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_22|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_30|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 20:13:00,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:13:00,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_71) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_72) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 20:13:00,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:13:00,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1032174888 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1032174888 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1032174888| ~x$w_buff1~0_In1032174888)) (and (= ~x~0_In1032174888 |P2Thread1of1ForFork1_#t~ite32_Out1032174888|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1032174888, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032174888, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1032174888, ~x~0=~x~0_In1032174888} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1032174888|, ~x$w_buff1~0=~x$w_buff1~0_In1032174888, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032174888, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1032174888, ~x~0=~x~0_In1032174888} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:13:00,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In796315843 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In796315843 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out796315843|)) (and (= ~x$w_buff0_used~0_In796315843 |P1Thread1of1ForFork0_#t~ite28_Out796315843|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In796315843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In796315843} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In796315843, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out796315843|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In796315843} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:13:00,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1766596059 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1766596059 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1766596059 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1766596059 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1766596059| ~x$w_buff1_used~0_In1766596059)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1766596059| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1766596059, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766596059, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766596059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766596059} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1766596059, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766596059, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766596059, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1766596059|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766596059} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:13:00,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In128912439 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In128912439 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out128912439) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In128912439 ~x$r_buff0_thd2~0_Out128912439) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In128912439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128912439} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out128912439|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out128912439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128912439} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:13:00,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In2114423360 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2114423360 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2114423360 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2114423360 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out2114423360| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out2114423360| ~x$r_buff1_thd2~0_In2114423360) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2114423360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2114423360, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2114423360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2114423360} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2114423360|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2114423360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2114423360, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2114423360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2114423360} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:13:00,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 20:13:00,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1202113613 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1202113613 256)))) (or (= (mod ~x$w_buff0_used~0_In1202113613 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In1202113613 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1202113613 256))))) .cse1 (= ~x$w_buff0_used~0_In1202113613 |P0Thread1of1ForFork2_#t~ite14_Out1202113613|) (= |P0Thread1of1ForFork2_#t~ite14_Out1202113613| |P0Thread1of1ForFork2_#t~ite15_Out1202113613|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In1202113613| |P0Thread1of1ForFork2_#t~ite14_Out1202113613|) (= ~x$w_buff0_used~0_In1202113613 |P0Thread1of1ForFork2_#t~ite15_Out1202113613|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1202113613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1202113613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1202113613, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1202113613|, ~weak$$choice2~0=~weak$$choice2~0_In1202113613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202113613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1202113613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1202113613, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1202113613|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1202113613, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1202113613|, ~weak$$choice2~0=~weak$$choice2~0_In1202113613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202113613} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:13:00,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse1 (= |P0Thread1of1ForFork2_#t~ite18_Out-1586131559| |P0Thread1of1ForFork2_#t~ite17_Out-1586131559|)) (.cse5 (= (mod ~x$w_buff0_used~0_In-1586131559 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In-1586131559 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1586131559 256))) (.cse4 (= 0 (mod ~x$r_buff1_thd1~0_In-1586131559 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1586131559 256)))) (or (and (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out-1586131559| ~x$w_buff1_used~0_In-1586131559) (= |P0Thread1of1ForFork2_#t~ite17_Out-1586131559| |P0Thread1of1ForFork2_#t~ite17_In-1586131559|) (not .cse0)) (and .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-1586131559| ~x$w_buff1_used~0_In-1586131559) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5) .cse0)) (= |P0Thread1of1ForFork2_#t~ite16_In-1586131559| |P0Thread1of1ForFork2_#t~ite16_Out-1586131559|)) (let ((.cse6 (not .cse3))) (and .cse1 (not .cse5) .cse0 (= |P0Thread1of1ForFork2_#t~ite16_Out-1586131559| 0) (or (not .cse2) .cse6) (or .cse6 (not .cse4)) (= |P0Thread1of1ForFork2_#t~ite17_Out-1586131559| |P0Thread1of1ForFork2_#t~ite16_Out-1586131559|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1586131559, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1586131559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1586131559, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-1586131559|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1586131559, ~weak$$choice2~0=~weak$$choice2~0_In-1586131559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1586131559} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1586131559, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1586131559|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1586131559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1586131559, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-1586131559|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1586131559, ~weak$$choice2~0=~weak$$choice2~0_In-1586131559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1586131559} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 20:13:00,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L746-->L747: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_35) (not (= 0 (mod v_~weak$$choice2~0_16 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 20:13:00,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 20:13:00,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_20) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 20:13:00,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1796440958 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1796440958 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1796440958| ~x$w_buff0_used~0_In-1796440958)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-1796440958| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1796440958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796440958} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1796440958|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1796440958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796440958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:13:00,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-943464213 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-943464213 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-943464213 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-943464213 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-943464213 |P2Thread1of1ForFork1_#t~ite35_Out-943464213|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-943464213| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-943464213, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-943464213, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-943464213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-943464213} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-943464213|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-943464213, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-943464213, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-943464213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-943464213} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:13:00,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-798979209 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-798979209 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-798979209|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-798979209 |P2Thread1of1ForFork1_#t~ite36_Out-798979209|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798979209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798979209} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-798979209|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798979209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798979209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:13:00,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1029877861 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1029877861 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1029877861 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1029877861 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1029877861| ~x$r_buff1_thd3~0_In-1029877861)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1029877861| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1029877861, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1029877861, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1029877861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029877861} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1029877861|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1029877861, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1029877861, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1029877861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029877861} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:13:00,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 20:13:00,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:13:00,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out418412690| |ULTIMATE.start_main_#t~ite41_Out418412690|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In418412690 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In418412690 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out418412690| ~x$w_buff1~0_In418412690)) (and (= ~x~0_In418412690 |ULTIMATE.start_main_#t~ite41_Out418412690|) .cse1 (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In418412690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418412690, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418412690, ~x~0=~x~0_In418412690} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out418412690|, ~x$w_buff1~0=~x$w_buff1~0_In418412690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418412690, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418412690, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out418412690|, ~x~0=~x~0_In418412690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:13:00,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-53325200 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-53325200 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-53325200| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-53325200| ~x$w_buff0_used~0_In-53325200) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-53325200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-53325200} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-53325200, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-53325200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-53325200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:13:00,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2011727260 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2011727260 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-2011727260 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2011727260 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-2011727260| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2011727260 |ULTIMATE.start_main_#t~ite44_Out-2011727260|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011727260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2011727260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2011727260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011727260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2011727260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2011727260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2011727260, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2011727260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2011727260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:13:00,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1266799656 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1266799656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1266799656|)) (and (= ~x$r_buff0_thd0~0_In-1266799656 |ULTIMATE.start_main_#t~ite45_Out-1266799656|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1266799656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266799656} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1266799656, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1266799656|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266799656} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:13:00,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-429886057 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-429886057 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-429886057 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-429886057 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-429886057 |ULTIMATE.start_main_#t~ite46_Out-429886057|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-429886057| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429886057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429886057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429886057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429886057} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-429886057, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-429886057|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-429886057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-429886057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-429886057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:13:00,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:13:00,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:13:00 BasicIcfg [2019-12-27 20:13:00,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:13:00,588 INFO L168 Benchmark]: Toolchain (without parser) took 87534.78 ms. Allocated memory was 138.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.4 MB in the beginning and 869.0 MB in the end (delta: -768.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,589 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.84 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.65 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,590 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,591 INFO L168 Benchmark]: RCFGBuilder took 830.05 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,591 INFO L168 Benchmark]: TraceAbstraction took 85809.19 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.7 MB in the beginning and 869.0 MB in the end (delta: -764.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:13:00,594 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.84 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.65 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.05 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85809.19 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.7 MB in the beginning and 869.0 MB in the end (delta: -764.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 165 ProgramPointsBefore, 85 ProgramPointsAfterwards, 196 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 26 ChoiceCompositions, 6815 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 79642 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 39.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5698 SDtfs, 10005 SDslu, 22136 SDs, 0 SdLazy, 18179 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 194 SyntacticMatches, 95 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11313 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 291737 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1086 NumberOfCodeBlocks, 1086 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 180684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...