/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:38:33,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:38:33,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:38:33,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:38:33,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:38:33,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:38:33,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:38:33,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:38:33,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:38:33,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:38:33,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:38:33,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:38:33,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:38:33,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:38:33,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:38:33,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:38:33,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:38:33,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:38:33,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:38:33,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:38:33,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:38:33,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:38:33,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:38:33,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:38:33,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:38:33,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:38:33,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:38:33,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:38:33,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:38:33,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:38:33,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:38:33,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:38:33,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:38:33,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:38:33,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:38:33,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:38:33,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:38:33,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:38:33,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:38:33,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:38:33,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:38:33,756 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.epf [2019-12-27 07:38:33,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:38:33,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:38:33,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:38:33,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:38:33,778 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:38:33,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:38:33,779 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:38:33,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:38:33,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:38:33,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:38:33,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:38:33,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:38:33,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:38:33,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:38:33,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:38:33,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:38:33,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:38:33,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:38:33,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:38:33,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:38:33,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:38:33,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:38:33,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:38:33,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:38:33,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:38:33,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:38:33,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:38:33,784 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:38:33,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:38:33,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:38:34,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:38:34,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:38:34,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:38:34,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:38:34,106 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:38:34,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-27 07:38:34,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a240ae/361ad48ea8e644fbad6b5c258d4125d4/FLAG6b4fbfd62 [2019-12-27 07:38:34,739 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:38:34,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-27 07:38:34,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a240ae/361ad48ea8e644fbad6b5c258d4125d4/FLAG6b4fbfd62 [2019-12-27 07:38:35,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a240ae/361ad48ea8e644fbad6b5c258d4125d4 [2019-12-27 07:38:35,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:38:35,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:38:35,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:35,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:38:35,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:38:35,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edc5a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35, skipping insertion in model container [2019-12-27 07:38:35,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:38:35,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:38:35,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:35,652 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:38:35,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:35,810 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:38:35,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35 WrapperNode [2019-12-27 07:38:35,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:35,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:35,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:38:35,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:38:35,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:35,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:38:35,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:38:35,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:38:35,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (1/1) ... [2019-12-27 07:38:35,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:38:35,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:38:35,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:38:35,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:38:35,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (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 07:38:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:38:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:38:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:38:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:38:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:38:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:38:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:38:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:38:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:38:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:38:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:38:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:38:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:38:35,999 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 07:38:36,687 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:38:36,688 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:38:36,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:36 BoogieIcfgContainer [2019-12-27 07:38:36,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:38:36,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:38:36,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:38:36,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:38:36,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:38:35" (1/3) ... [2019-12-27 07:38:36,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19615f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:36, skipping insertion in model container [2019-12-27 07:38:36,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:35" (2/3) ... [2019-12-27 07:38:36,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19615f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:36, skipping insertion in model container [2019-12-27 07:38:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:36" (3/3) ... [2019-12-27 07:38:36,698 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.oepc.i [2019-12-27 07:38:36,708 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:38:36,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:38:36,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:38:36,717 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:38:36,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:36,853 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:38:36,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:38:36,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:38:36,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:38:36,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:38:36,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:38:36,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:38:36,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:38:36,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:38:36,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 07:38:36,892 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:36,983 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:36,983 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:36,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:37,027 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:37,078 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:37,078 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:37,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:37,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:38:37,107 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:38:40,153 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 07:38:40,774 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:38:40,908 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:38:40,976 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 07:38:40,977 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:38:40,979 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 07:38:53,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 07:38:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 07:38:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:38:53,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:53,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:38:53,702 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 07:38:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 07:38:53,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:53,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660562085] [2019-12-27 07:38:53,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:53,948 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 07:38:53,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660562085] [2019-12-27 07:38:53,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:53,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:38:53,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289718164] [2019-12-27 07:38:53,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:38:53,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:38:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:38:53,976 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 07:38:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:56,458 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 07:38:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:38:56,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:38:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:57,041 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 07:38:57,042 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 07:38:57,049 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 07:39:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 07:39:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 07:39:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 07:39:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 07:39:07,773 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 07:39:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:07,774 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 07:39:07,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 07:39:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:07,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:07,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:07,784 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 07:39:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 07:39:07,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:07,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060869767] [2019-12-27 07:39:07,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:07,920 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 07:39:07,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060869767] [2019-12-27 07:39:07,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:07,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:07,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403978165] [2019-12-27 07:39:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:07,924 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 07:39:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:12,415 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 07:39:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:12,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:12,996 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 07:39:12,996 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 07:39:12,997 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 07:39:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 07:39:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 07:39:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 07:39:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 07:39:19,490 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 07:39:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:19,491 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 07:39:19,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 07:39:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:19,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:19,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:19,495 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 07:39:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 07:39:19,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:19,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394379722] [2019-12-27 07:39:19,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:19,603 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 07:39:19,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394379722] [2019-12-27 07:39:19,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:19,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:19,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877259118] [2019-12-27 07:39:19,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:19,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:19,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:19,606 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 07:39:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:23,208 INFO L93 Difference]: Finished difference Result 37434 states and 130812 transitions. [2019-12-27 07:39:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:23,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:23,311 INFO L225 Difference]: With dead ends: 37434 [2019-12-27 07:39:23,311 INFO L226 Difference]: Without dead ends: 29372 [2019-12-27 07:39:23,312 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 07:39:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-12-27 07:39:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 29300. [2019-12-27 07:39:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-27 07:39:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 98618 transitions. [2019-12-27 07:39:24,034 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 98618 transitions. Word has length 13 [2019-12-27 07:39:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:24,035 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 98618 transitions. [2019-12-27 07:39:24,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 98618 transitions. [2019-12-27 07:39:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:24,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:24,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:24,038 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 07:39:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 07:39:24,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:24,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824923833] [2019-12-27 07:39:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:24,098 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 07:39:24,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824923833] [2019-12-27 07:39:24,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:24,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:24,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702119486] [2019-12-27 07:39:24,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:24,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:24,100 INFO L87 Difference]: Start difference. First operand 29300 states and 98618 transitions. Second operand 3 states. [2019-12-27 07:39:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:24,321 INFO L93 Difference]: Finished difference Result 43227 states and 144586 transitions. [2019-12-27 07:39:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:24,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:39:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:24,433 INFO L225 Difference]: With dead ends: 43227 [2019-12-27 07:39:24,434 INFO L226 Difference]: Without dead ends: 43227 [2019-12-27 07:39:24,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2019-12-27 07:39:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 32227. [2019-12-27 07:39:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-12-27 07:39:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 107573 transitions. [2019-12-27 07:39:25,499 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 107573 transitions. Word has length 14 [2019-12-27 07:39:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:25,499 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 107573 transitions. [2019-12-27 07:39:25,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 107573 transitions. [2019-12-27 07:39:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:25,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:25,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:25,501 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 07:39:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 07:39:25,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:25,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073645984] [2019-12-27 07:39:25,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:25,570 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 07:39:25,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073645984] [2019-12-27 07:39:25,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:25,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:25,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210804832] [2019-12-27 07:39:25,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:25,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:25,573 INFO L87 Difference]: Start difference. First operand 32227 states and 107573 transitions. Second operand 4 states. [2019-12-27 07:39:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:25,978 INFO L93 Difference]: Finished difference Result 39628 states and 130327 transitions. [2019-12-27 07:39:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:25,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:26,077 INFO L225 Difference]: With dead ends: 39628 [2019-12-27 07:39:26,077 INFO L226 Difference]: Without dead ends: 39539 [2019-12-27 07:39:26,077 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 07:39:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39539 states. [2019-12-27 07:39:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39539 to 34645. [2019-12-27 07:39:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34645 states. [2019-12-27 07:39:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 115289 transitions. [2019-12-27 07:39:26,757 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 115289 transitions. Word has length 14 [2019-12-27 07:39:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:26,757 INFO L462 AbstractCegarLoop]: Abstraction has 34645 states and 115289 transitions. [2019-12-27 07:39:26,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 115289 transitions. [2019-12-27 07:39:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:26,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:26,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:26,759 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 07:39:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 07:39:26,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:26,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121221886] [2019-12-27 07:39:26,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:26,851 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 07:39:26,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121221886] [2019-12-27 07:39:26,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:26,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:26,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9886505] [2019-12-27 07:39:26,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:26,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:26,854 INFO L87 Difference]: Start difference. First operand 34645 states and 115289 transitions. Second operand 4 states. [2019-12-27 07:39:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:27,478 INFO L93 Difference]: Finished difference Result 41557 states and 136749 transitions. [2019-12-27 07:39:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:27,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:27,564 INFO L225 Difference]: With dead ends: 41557 [2019-12-27 07:39:27,565 INFO L226 Difference]: Without dead ends: 41459 [2019-12-27 07:39:27,565 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 07:39:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41459 states. [2019-12-27 07:39:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41459 to 35260. [2019-12-27 07:39:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35260 states. [2019-12-27 07:39:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35260 states to 35260 states and 117020 transitions. [2019-12-27 07:39:28,250 INFO L78 Accepts]: Start accepts. Automaton has 35260 states and 117020 transitions. Word has length 14 [2019-12-27 07:39:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:28,250 INFO L462 AbstractCegarLoop]: Abstraction has 35260 states and 117020 transitions. [2019-12-27 07:39:28,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35260 states and 117020 transitions. [2019-12-27 07:39:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:28,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:28,263 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 07:39:28,263 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 07:39:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 07:39:28,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:28,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429523323] [2019-12-27 07:39:28,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:28,352 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 07:39:28,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429523323] [2019-12-27 07:39:28,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:28,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:28,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644664493] [2019-12-27 07:39:28,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:28,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:28,355 INFO L87 Difference]: Start difference. First operand 35260 states and 117020 transitions. Second operand 5 states. [2019-12-27 07:39:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:28,921 INFO L93 Difference]: Finished difference Result 47518 states and 155149 transitions. [2019-12-27 07:39:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:28,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:29,000 INFO L225 Difference]: With dead ends: 47518 [2019-12-27 07:39:29,000 INFO L226 Difference]: Without dead ends: 47342 [2019-12-27 07:39:29,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47342 states. [2019-12-27 07:39:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47342 to 35974. [2019-12-27 07:39:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2019-12-27 07:39:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 119384 transitions. [2019-12-27 07:39:30,023 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 119384 transitions. Word has length 22 [2019-12-27 07:39:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:30,024 INFO L462 AbstractCegarLoop]: Abstraction has 35974 states and 119384 transitions. [2019-12-27 07:39:30,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 119384 transitions. [2019-12-27 07:39:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:30,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:30,034 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 07:39:30,034 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 07:39:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 07:39:30,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:30,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051008400] [2019-12-27 07:39:30,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:30,120 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 07:39:30,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051008400] [2019-12-27 07:39:30,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:30,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:30,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592000970] [2019-12-27 07:39:30,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:30,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:30,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:30,123 INFO L87 Difference]: Start difference. First operand 35974 states and 119384 transitions. Second operand 5 states. [2019-12-27 07:39:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:30,733 INFO L93 Difference]: Finished difference Result 47846 states and 156183 transitions. [2019-12-27 07:39:30,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:30,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:30,811 INFO L225 Difference]: With dead ends: 47846 [2019-12-27 07:39:30,812 INFO L226 Difference]: Without dead ends: 47578 [2019-12-27 07:39:30,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2019-12-27 07:39:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 33984. [2019-12-27 07:39:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-12-27 07:39:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 112757 transitions. [2019-12-27 07:39:31,485 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 112757 transitions. Word has length 22 [2019-12-27 07:39:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:31,485 INFO L462 AbstractCegarLoop]: Abstraction has 33984 states and 112757 transitions. [2019-12-27 07:39:31,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 112757 transitions. [2019-12-27 07:39:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:39:31,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:31,500 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 07:39:31,500 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 07:39:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-27 07:39:31,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:31,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661278725] [2019-12-27 07:39:31,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:31,582 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 07:39:31,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661278725] [2019-12-27 07:39:31,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:31,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:31,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072663898] [2019-12-27 07:39:31,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:31,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:31,584 INFO L87 Difference]: Start difference. First operand 33984 states and 112757 transitions. Second operand 5 states. [2019-12-27 07:39:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:32,349 INFO L93 Difference]: Finished difference Result 46481 states and 151170 transitions. [2019-12-27 07:39:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:39:32,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:39:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:32,429 INFO L225 Difference]: With dead ends: 46481 [2019-12-27 07:39:32,430 INFO L226 Difference]: Without dead ends: 46454 [2019-12-27 07:39:32,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46454 states. [2019-12-27 07:39:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46454 to 37630. [2019-12-27 07:39:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37630 states. [2019-12-27 07:39:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37630 states to 37630 states and 124168 transitions. [2019-12-27 07:39:33,142 INFO L78 Accepts]: Start accepts. Automaton has 37630 states and 124168 transitions. Word has length 25 [2019-12-27 07:39:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:33,142 INFO L462 AbstractCegarLoop]: Abstraction has 37630 states and 124168 transitions. [2019-12-27 07:39:33,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 37630 states and 124168 transitions. [2019-12-27 07:39:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:39:33,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:33,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:33,160 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 07:39:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-27 07:39:33,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683795864] [2019-12-27 07:39:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:33,236 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 07:39:33,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683795864] [2019-12-27 07:39:33,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:33,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:39:33,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812796138] [2019-12-27 07:39:33,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:33,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:33,239 INFO L87 Difference]: Start difference. First operand 37630 states and 124168 transitions. Second operand 5 states. [2019-12-27 07:39:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:33,347 INFO L93 Difference]: Finished difference Result 16928 states and 51968 transitions. [2019-12-27 07:39:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:33,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 07:39:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:33,367 INFO L225 Difference]: With dead ends: 16928 [2019-12-27 07:39:33,367 INFO L226 Difference]: Without dead ends: 14438 [2019-12-27 07:39:33,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14438 states. [2019-12-27 07:39:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14438 to 14106. [2019-12-27 07:39:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14106 states. [2019-12-27 07:39:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14106 states to 14106 states and 42981 transitions. [2019-12-27 07:39:33,572 INFO L78 Accepts]: Start accepts. Automaton has 14106 states and 42981 transitions. Word has length 28 [2019-12-27 07:39:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:33,573 INFO L462 AbstractCegarLoop]: Abstraction has 14106 states and 42981 transitions. [2019-12-27 07:39:33,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 14106 states and 42981 transitions. [2019-12-27 07:39:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:39:33,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:33,593 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 07:39:33,593 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 07:39:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-27 07:39:33,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:33,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457500779] [2019-12-27 07:39:33,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:33,651 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 07:39:33,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457500779] [2019-12-27 07:39:33,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:33,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:33,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477704541] [2019-12-27 07:39:33,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:33,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:33,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:33,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:33,653 INFO L87 Difference]: Start difference. First operand 14106 states and 42981 transitions. Second operand 3 states. [2019-12-27 07:39:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:33,747 INFO L93 Difference]: Finished difference Result 25950 states and 78976 transitions. [2019-12-27 07:39:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:33,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:39:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:33,768 INFO L225 Difference]: With dead ends: 25950 [2019-12-27 07:39:33,768 INFO L226 Difference]: Without dead ends: 14456 [2019-12-27 07:39:33,768 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 07:39:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2019-12-27 07:39:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 14298. [2019-12-27 07:39:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14298 states. [2019-12-27 07:39:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14298 states to 14298 states and 42698 transitions. [2019-12-27 07:39:34,175 INFO L78 Accepts]: Start accepts. Automaton has 14298 states and 42698 transitions. Word has length 39 [2019-12-27 07:39:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:34,175 INFO L462 AbstractCegarLoop]: Abstraction has 14298 states and 42698 transitions. [2019-12-27 07:39:34,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14298 states and 42698 transitions. [2019-12-27 07:39:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:39:34,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:34,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:34,195 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 07:39:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 07:39:34,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:34,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639023583] [2019-12-27 07:39:34,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:34,315 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 07:39:34,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639023583] [2019-12-27 07:39:34,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:34,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:39:34,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741810564] [2019-12-27 07:39:34,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:34,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:34,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:34,318 INFO L87 Difference]: Start difference. First operand 14298 states and 42698 transitions. Second operand 6 states. [2019-12-27 07:39:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:34,443 INFO L93 Difference]: Finished difference Result 12948 states and 39291 transitions. [2019-12-27 07:39:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:39:34,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 07:39:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:34,463 INFO L225 Difference]: With dead ends: 12948 [2019-12-27 07:39:34,464 INFO L226 Difference]: Without dead ends: 10783 [2019-12-27 07:39:34,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10783 states. [2019-12-27 07:39:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10783 to 9467. [2019-12-27 07:39:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9467 states. [2019-12-27 07:39:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9467 states to 9467 states and 29555 transitions. [2019-12-27 07:39:34,650 INFO L78 Accepts]: Start accepts. Automaton has 9467 states and 29555 transitions. Word has length 40 [2019-12-27 07:39:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:34,650 INFO L462 AbstractCegarLoop]: Abstraction has 9467 states and 29555 transitions. [2019-12-27 07:39:34,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 29555 transitions. [2019-12-27 07:39:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:34,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:34,666 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 07:39:34,666 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 07:39:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 07:39:34,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:34,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039102762] [2019-12-27 07:39:34,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:34,753 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 07:39:34,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039102762] [2019-12-27 07:39:34,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:34,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:34,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782712423] [2019-12-27 07:39:34,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:34,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:34,756 INFO L87 Difference]: Start difference. First operand 9467 states and 29555 transitions. Second operand 7 states. [2019-12-27 07:39:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:35,114 INFO L93 Difference]: Finished difference Result 25853 states and 80397 transitions. [2019-12-27 07:39:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:35,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:35,157 INFO L225 Difference]: With dead ends: 25853 [2019-12-27 07:39:35,157 INFO L226 Difference]: Without dead ends: 19749 [2019-12-27 07:39:35,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:39:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-12-27 07:39:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 11483. [2019-12-27 07:39:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11483 states. [2019-12-27 07:39:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 36134 transitions. [2019-12-27 07:39:35,423 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 36134 transitions. Word has length 54 [2019-12-27 07:39:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:35,423 INFO L462 AbstractCegarLoop]: Abstraction has 11483 states and 36134 transitions. [2019-12-27 07:39:35,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 36134 transitions. [2019-12-27 07:39:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:35,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:35,437 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 07:39:35,437 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 07:39:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 07:39:35,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:35,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116311806] [2019-12-27 07:39:35,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:35,526 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 07:39:35,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116311806] [2019-12-27 07:39:35,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:35,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:35,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897387187] [2019-12-27 07:39:35,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:35,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:35,528 INFO L87 Difference]: Start difference. First operand 11483 states and 36134 transitions. Second operand 7 states. [2019-12-27 07:39:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:35,931 INFO L93 Difference]: Finished difference Result 32418 states and 99744 transitions. [2019-12-27 07:39:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:35,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:35,974 INFO L225 Difference]: With dead ends: 32418 [2019-12-27 07:39:35,975 INFO L226 Difference]: Without dead ends: 22978 [2019-12-27 07:39:35,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:39:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2019-12-27 07:39:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 14415. [2019-12-27 07:39:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-12-27 07:39:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 45368 transitions. [2019-12-27 07:39:36,280 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 45368 transitions. Word has length 54 [2019-12-27 07:39:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:36,280 INFO L462 AbstractCegarLoop]: Abstraction has 14415 states and 45368 transitions. [2019-12-27 07:39:36,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 45368 transitions. [2019-12-27 07:39:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:36,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:36,296 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 07:39:36,297 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 07:39:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 07:39:36,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:36,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312935543] [2019-12-27 07:39:36,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:36,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312935543] [2019-12-27 07:39:36,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:36,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:39:36,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507289285] [2019-12-27 07:39:36,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:39:36,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:39:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:39:36,396 INFO L87 Difference]: Start difference. First operand 14415 states and 45368 transitions. Second operand 8 states. [2019-12-27 07:39:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:37,358 INFO L93 Difference]: Finished difference Result 35579 states and 108354 transitions. [2019-12-27 07:39:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:39:37,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 07:39:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:37,408 INFO L225 Difference]: With dead ends: 35579 [2019-12-27 07:39:37,408 INFO L226 Difference]: Without dead ends: 33133 [2019-12-27 07:39:37,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:39:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33133 states. [2019-12-27 07:39:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33133 to 14473. [2019-12-27 07:39:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14473 states. [2019-12-27 07:39:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14473 states to 14473 states and 45640 transitions. [2019-12-27 07:39:37,963 INFO L78 Accepts]: Start accepts. Automaton has 14473 states and 45640 transitions. Word has length 54 [2019-12-27 07:39:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:37,964 INFO L462 AbstractCegarLoop]: Abstraction has 14473 states and 45640 transitions. [2019-12-27 07:39:37,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:39:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14473 states and 45640 transitions. [2019-12-27 07:39:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:37,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:37,982 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 07:39:37,982 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 07:39:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-27 07:39:37,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:37,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995066600] [2019-12-27 07:39:37,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:38,110 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 07:39:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995066600] [2019-12-27 07:39:38,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:38,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:38,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707416881] [2019-12-27 07:39:38,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:38,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:38,112 INFO L87 Difference]: Start difference. First operand 14473 states and 45640 transitions. Second operand 9 states. [2019-12-27 07:39:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:39,477 INFO L93 Difference]: Finished difference Result 49504 states and 150336 transitions. [2019-12-27 07:39:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:39:39,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:39,549 INFO L225 Difference]: With dead ends: 49504 [2019-12-27 07:39:39,550 INFO L226 Difference]: Without dead ends: 47058 [2019-12-27 07:39:39,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:39:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47058 states. [2019-12-27 07:39:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47058 to 14494. [2019-12-27 07:39:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14494 states. [2019-12-27 07:39:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 45720 transitions. [2019-12-27 07:39:40,039 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 45720 transitions. Word has length 54 [2019-12-27 07:39:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:40,039 INFO L462 AbstractCegarLoop]: Abstraction has 14494 states and 45720 transitions. [2019-12-27 07:39:40,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 45720 transitions. [2019-12-27 07:39:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:40,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:40,064 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 07:39:40,064 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 07:39:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-27 07:39:40,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:40,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344981564] [2019-12-27 07:39:40,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:40,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344981564] [2019-12-27 07:39:40,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:40,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123779732] [2019-12-27 07:39:40,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:40,219 INFO L87 Difference]: Start difference. First operand 14494 states and 45720 transitions. Second operand 9 states. [2019-12-27 07:39:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:42,021 INFO L93 Difference]: Finished difference Result 63652 states and 193236 transitions. [2019-12-27 07:39:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 07:39:42,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:42,095 INFO L225 Difference]: With dead ends: 63652 [2019-12-27 07:39:42,095 INFO L226 Difference]: Without dead ends: 54968 [2019-12-27 07:39:42,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 07:39:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54968 states. [2019-12-27 07:39:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54968 to 18583. [2019-12-27 07:39:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18583 states. [2019-12-27 07:39:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18583 states to 18583 states and 58671 transitions. [2019-12-27 07:39:42,641 INFO L78 Accepts]: Start accepts. Automaton has 18583 states and 58671 transitions. Word has length 54 [2019-12-27 07:39:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:42,641 INFO L462 AbstractCegarLoop]: Abstraction has 18583 states and 58671 transitions. [2019-12-27 07:39:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18583 states and 58671 transitions. [2019-12-27 07:39:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:42,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:42,662 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 07:39:42,662 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 07:39:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-27 07:39:42,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:42,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727523137] [2019-12-27 07:39:42,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:42,767 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 07:39:42,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727523137] [2019-12-27 07:39:42,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:42,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:39:42,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866927227] [2019-12-27 07:39:42,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:42,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:42,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:42,773 INFO L87 Difference]: Start difference. First operand 18583 states and 58671 transitions. Second operand 7 states. [2019-12-27 07:39:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:43,866 INFO L93 Difference]: Finished difference Result 36231 states and 111529 transitions. [2019-12-27 07:39:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:39:43,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:43,919 INFO L225 Difference]: With dead ends: 36231 [2019-12-27 07:39:43,919 INFO L226 Difference]: Without dead ends: 36147 [2019-12-27 07:39:43,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:39:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36147 states. [2019-12-27 07:39:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36147 to 21319. [2019-12-27 07:39:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21319 states. [2019-12-27 07:39:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21319 states to 21319 states and 66755 transitions. [2019-12-27 07:39:44,344 INFO L78 Accepts]: Start accepts. Automaton has 21319 states and 66755 transitions. Word has length 54 [2019-12-27 07:39:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:44,344 INFO L462 AbstractCegarLoop]: Abstraction has 21319 states and 66755 transitions. [2019-12-27 07:39:44,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21319 states and 66755 transitions. [2019-12-27 07:39:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:44,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:44,369 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 07:39:44,369 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 07:39:44,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 7 times [2019-12-27 07:39:44,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:44,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025396124] [2019-12-27 07:39:44,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:44,455 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 07:39:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025396124] [2019-12-27 07:39:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:44,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413183802] [2019-12-27 07:39:44,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:44,458 INFO L87 Difference]: Start difference. First operand 21319 states and 66755 transitions. Second operand 6 states. [2019-12-27 07:39:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:45,334 INFO L93 Difference]: Finished difference Result 32118 states and 97686 transitions. [2019-12-27 07:39:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:39:45,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 07:39:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:45,413 INFO L225 Difference]: With dead ends: 32118 [2019-12-27 07:39:45,413 INFO L226 Difference]: Without dead ends: 31996 [2019-12-27 07:39:45,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:39:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31996 states. [2019-12-27 07:39:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31996 to 26591. [2019-12-27 07:39:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26591 states. [2019-12-27 07:39:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26591 states to 26591 states and 82479 transitions. [2019-12-27 07:39:46,193 INFO L78 Accepts]: Start accepts. Automaton has 26591 states and 82479 transitions. Word has length 54 [2019-12-27 07:39:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:46,193 INFO L462 AbstractCegarLoop]: Abstraction has 26591 states and 82479 transitions. [2019-12-27 07:39:46,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 26591 states and 82479 transitions. [2019-12-27 07:39:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:46,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:46,222 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 07:39:46,222 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 07:39:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 8 times [2019-12-27 07:39:46,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:46,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828476338] [2019-12-27 07:39:46,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:46,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828476338] [2019-12-27 07:39:46,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:46,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:46,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251068032] [2019-12-27 07:39:46,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:46,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:46,280 INFO L87 Difference]: Start difference. First operand 26591 states and 82479 transitions. Second operand 3 states. [2019-12-27 07:39:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:46,372 INFO L93 Difference]: Finished difference Result 26589 states and 82474 transitions. [2019-12-27 07:39:46,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:46,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:39:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:46,411 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 07:39:46,412 INFO L226 Difference]: Without dead ends: 26589 [2019-12-27 07:39:46,412 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 07:39:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states. [2019-12-27 07:39:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 22408. [2019-12-27 07:39:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22408 states. [2019-12-27 07:39:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22408 states to 22408 states and 70952 transitions. [2019-12-27 07:39:46,787 INFO L78 Accepts]: Start accepts. Automaton has 22408 states and 70952 transitions. Word has length 54 [2019-12-27 07:39:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:46,787 INFO L462 AbstractCegarLoop]: Abstraction has 22408 states and 70952 transitions. [2019-12-27 07:39:46,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22408 states and 70952 transitions. [2019-12-27 07:39:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:39:46,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:46,810 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 07:39:46,811 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 07:39:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-27 07:39:46,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:46,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817999904] [2019-12-27 07:39:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:46,868 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 07:39:46,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817999904] [2019-12-27 07:39:46,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:46,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:46,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349324216] [2019-12-27 07:39:46,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:46,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:46,870 INFO L87 Difference]: Start difference. First operand 22408 states and 70952 transitions. Second operand 3 states. [2019-12-27 07:39:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:46,946 INFO L93 Difference]: Finished difference Result 17531 states and 54465 transitions. [2019-12-27 07:39:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:46,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:39:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:46,986 INFO L225 Difference]: With dead ends: 17531 [2019-12-27 07:39:46,987 INFO L226 Difference]: Without dead ends: 17531 [2019-12-27 07:39:46,987 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 07:39:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17531 states. [2019-12-27 07:39:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17531 to 16654. [2019-12-27 07:39:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16654 states. [2019-12-27 07:39:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16654 states to 16654 states and 51716 transitions. [2019-12-27 07:39:47,444 INFO L78 Accepts]: Start accepts. Automaton has 16654 states and 51716 transitions. Word has length 55 [2019-12-27 07:39:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:47,445 INFO L462 AbstractCegarLoop]: Abstraction has 16654 states and 51716 transitions. [2019-12-27 07:39:47,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 16654 states and 51716 transitions. [2019-12-27 07:39:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:47,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:47,469 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 07:39:47,469 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 07:39:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-27 07:39:47,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:47,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549864762] [2019-12-27 07:39:47,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:47,938 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 07:39:47,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549864762] [2019-12-27 07:39:47,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:47,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:39:47,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267855484] [2019-12-27 07:39:47,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:39:47,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:39:47,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:39:47,940 INFO L87 Difference]: Start difference. First operand 16654 states and 51716 transitions. Second operand 15 states. [2019-12-27 07:39:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:52,326 INFO L93 Difference]: Finished difference Result 35013 states and 107110 transitions. [2019-12-27 07:39:52,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 07:39:52,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:39:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:52,376 INFO L225 Difference]: With dead ends: 35013 [2019-12-27 07:39:52,376 INFO L226 Difference]: Without dead ends: 29324 [2019-12-27 07:39:52,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 07:39:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29324 states. [2019-12-27 07:39:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29324 to 17124. [2019-12-27 07:39:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2019-12-27 07:39:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 52953 transitions. [2019-12-27 07:39:52,728 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 52953 transitions. Word has length 56 [2019-12-27 07:39:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:52,728 INFO L462 AbstractCegarLoop]: Abstraction has 17124 states and 52953 transitions. [2019-12-27 07:39:52,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:39:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 52953 transitions. [2019-12-27 07:39:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:52,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:52,747 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 07:39:52,748 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 07:39:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2011437082, now seen corresponding path program 2 times [2019-12-27 07:39:52,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:52,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452588264] [2019-12-27 07:39:52,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:53,166 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 07:39:53,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452588264] [2019-12-27 07:39:53,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:53,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:39:53,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214876536] [2019-12-27 07:39:53,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:39:53,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:39:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:39:53,168 INFO L87 Difference]: Start difference. First operand 17124 states and 52953 transitions. Second operand 15 states. [2019-12-27 07:39:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:56,749 INFO L93 Difference]: Finished difference Result 31566 states and 96477 transitions. [2019-12-27 07:39:56,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 07:39:56,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:39:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:56,793 INFO L225 Difference]: With dead ends: 31566 [2019-12-27 07:39:56,793 INFO L226 Difference]: Without dead ends: 29534 [2019-12-27 07:39:56,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 07:39:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29534 states. [2019-12-27 07:39:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29534 to 17220. [2019-12-27 07:39:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17220 states. [2019-12-27 07:39:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17220 states to 17220 states and 53225 transitions. [2019-12-27 07:39:57,302 INFO L78 Accepts]: Start accepts. Automaton has 17220 states and 53225 transitions. Word has length 56 [2019-12-27 07:39:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:57,302 INFO L462 AbstractCegarLoop]: Abstraction has 17220 states and 53225 transitions. [2019-12-27 07:39:57,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:39:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17220 states and 53225 transitions. [2019-12-27 07:39:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:57,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:57,323 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 07:39:57,323 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 07:39:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 3 times [2019-12-27 07:39:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:57,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088421164] [2019-12-27 07:39:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:57,694 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 07:39:57,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088421164] [2019-12-27 07:39:57,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:57,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:39:57,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977449171] [2019-12-27 07:39:57,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:39:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:39:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:39:57,696 INFO L87 Difference]: Start difference. First operand 17220 states and 53225 transitions. Second operand 15 states. [2019-12-27 07:40:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:01,441 INFO L93 Difference]: Finished difference Result 29592 states and 90251 transitions. [2019-12-27 07:40:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:40:01,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:40:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:01,496 INFO L225 Difference]: With dead ends: 29592 [2019-12-27 07:40:01,497 INFO L226 Difference]: Without dead ends: 29294 [2019-12-27 07:40:01,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 07:40:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29294 states. [2019-12-27 07:40:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29294 to 17076. [2019-12-27 07:40:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17076 states. [2019-12-27 07:40:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17076 states to 17076 states and 52829 transitions. [2019-12-27 07:40:01,833 INFO L78 Accepts]: Start accepts. Automaton has 17076 states and 52829 transitions. Word has length 56 [2019-12-27 07:40:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:01,833 INFO L462 AbstractCegarLoop]: Abstraction has 17076 states and 52829 transitions. [2019-12-27 07:40:01,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:40:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17076 states and 52829 transitions. [2019-12-27 07:40:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:01,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:01,851 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 07:40:01,851 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 07:40:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1966624802, now seen corresponding path program 4 times [2019-12-27 07:40:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:01,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73383533] [2019-12-27 07:40:01,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:02,260 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 07:40:02,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73383533] [2019-12-27 07:40:02,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:02,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:40:02,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572929554] [2019-12-27 07:40:02,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:40:02,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:40:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:40:02,262 INFO L87 Difference]: Start difference. First operand 17076 states and 52829 transitions. Second operand 15 states. [2019-12-27 07:40:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:06,968 INFO L93 Difference]: Finished difference Result 40318 states and 122962 transitions. [2019-12-27 07:40:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 07:40:06,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:40:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:07,014 INFO L225 Difference]: With dead ends: 40318 [2019-12-27 07:40:07,014 INFO L226 Difference]: Without dead ends: 29013 [2019-12-27 07:40:07,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 07:40:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-27 07:40:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 17069. [2019-12-27 07:40:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17069 states. [2019-12-27 07:40:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17069 states to 17069 states and 52555 transitions. [2019-12-27 07:40:07,359 INFO L78 Accepts]: Start accepts. Automaton has 17069 states and 52555 transitions. Word has length 56 [2019-12-27 07:40:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:07,360 INFO L462 AbstractCegarLoop]: Abstraction has 17069 states and 52555 transitions. [2019-12-27 07:40:07,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:40:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17069 states and 52555 transitions. [2019-12-27 07:40:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:07,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:07,378 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 07:40:07,378 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1896503372, now seen corresponding path program 5 times [2019-12-27 07:40:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834488285] [2019-12-27 07:40:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:07,795 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 07:40:07,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834488285] [2019-12-27 07:40:07,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:07,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:40:07,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123075851] [2019-12-27 07:40:07,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:40:07,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:40:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:40:07,797 INFO L87 Difference]: Start difference. First operand 17069 states and 52555 transitions. Second operand 16 states. [2019-12-27 07:40:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:11,867 INFO L93 Difference]: Finished difference Result 31405 states and 95564 transitions. [2019-12-27 07:40:11,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 07:40:11,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 07:40:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:11,908 INFO L225 Difference]: With dead ends: 31405 [2019-12-27 07:40:11,908 INFO L226 Difference]: Without dead ends: 29019 [2019-12-27 07:40:11,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 07:40:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29019 states. [2019-12-27 07:40:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29019 to 17105. [2019-12-27 07:40:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17105 states. [2019-12-27 07:40:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17105 states to 17105 states and 52633 transitions. [2019-12-27 07:40:12,224 INFO L78 Accepts]: Start accepts. Automaton has 17105 states and 52633 transitions. Word has length 56 [2019-12-27 07:40:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:12,224 INFO L462 AbstractCegarLoop]: Abstraction has 17105 states and 52633 transitions. [2019-12-27 07:40:12,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:40:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17105 states and 52633 transitions. [2019-12-27 07:40:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:12,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:12,244 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 07:40:12,244 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -565823518, now seen corresponding path program 6 times [2019-12-27 07:40:12,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:12,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723098682] [2019-12-27 07:40:12,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:12,336 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 07:40:12,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723098682] [2019-12-27 07:40:12,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:12,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:40:12,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361955298] [2019-12-27 07:40:12,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:40:12,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:40:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:40:12,337 INFO L87 Difference]: Start difference. First operand 17105 states and 52633 transitions. Second operand 9 states. [2019-12-27 07:40:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:13,387 INFO L93 Difference]: Finished difference Result 29153 states and 88969 transitions. [2019-12-27 07:40:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:40:13,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 07:40:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:13,421 INFO L225 Difference]: With dead ends: 29153 [2019-12-27 07:40:13,421 INFO L226 Difference]: Without dead ends: 24042 [2019-12-27 07:40:13,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:40:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24042 states. [2019-12-27 07:40:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24042 to 17079. [2019-12-27 07:40:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17079 states. [2019-12-27 07:40:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17079 states to 17079 states and 52489 transitions. [2019-12-27 07:40:13,715 INFO L78 Accepts]: Start accepts. Automaton has 17079 states and 52489 transitions. Word has length 56 [2019-12-27 07:40:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:13,716 INFO L462 AbstractCegarLoop]: Abstraction has 17079 states and 52489 transitions. [2019-12-27 07:40:13,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:40:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17079 states and 52489 transitions. [2019-12-27 07:40:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:13,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:13,733 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 07:40:13,733 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash -584253452, now seen corresponding path program 7 times [2019-12-27 07:40:13,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838658459] [2019-12-27 07:40:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:40:13,876 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 07:40:13,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838658459] [2019-12-27 07:40:13,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:40:13,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:40:13,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14864135] [2019-12-27 07:40:13,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:40:13,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:40:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:40:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:40:13,878 INFO L87 Difference]: Start difference. First operand 17079 states and 52489 transitions. Second operand 11 states. [2019-12-27 07:40:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:40:14,752 INFO L93 Difference]: Finished difference Result 29865 states and 91375 transitions. [2019-12-27 07:40:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:40:14,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 07:40:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:40:14,791 INFO L225 Difference]: With dead ends: 29865 [2019-12-27 07:40:14,791 INFO L226 Difference]: Without dead ends: 25745 [2019-12-27 07:40:14,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-27 07:40:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25745 states. [2019-12-27 07:40:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25745 to 16499. [2019-12-27 07:40:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16499 states. [2019-12-27 07:40:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16499 states to 16499 states and 50808 transitions. [2019-12-27 07:40:15,101 INFO L78 Accepts]: Start accepts. Automaton has 16499 states and 50808 transitions. Word has length 56 [2019-12-27 07:40:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:40:15,102 INFO L462 AbstractCegarLoop]: Abstraction has 16499 states and 50808 transitions. [2019-12-27 07:40:15,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:40:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 16499 states and 50808 transitions. [2019-12-27 07:40:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:40:15,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:40:15,124 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 07:40:15,124 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:40:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:40:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 8 times [2019-12-27 07:40:15,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:40:15,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303825566] [2019-12-27 07:40:15,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:40:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:40:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:40:15,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:40:15,218 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:40:15,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_22|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2085~0.base_22|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_22| 1) |v_#valid_56|) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= |v_ULTIMATE.start_main_~#t2085~0.offset_18| 0) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_22|) |v_ULTIMATE.start_main_~#t2085~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2085~0.base_22| 4)) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ULTIMATE.start_main_~#t2085~0.offset=|v_ULTIMATE.start_main_~#t2085~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2085~0.base=|v_ULTIMATE.start_main_~#t2085~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~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_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2085~0.offset, ULTIMATE.start_main_~#t2087~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2085~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2087~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2086~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t2086~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:40:15,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2086~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| 4) |v_#length_15|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10| 1) |v_#valid_31|) (= |v_ULTIMATE.start_main_~#t2086~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10|) |v_ULTIMATE.start_main_~#t2086~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2086~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2086~0.base, #length] because there is no mapped edge [2019-12-27 07:40:15,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} 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 07:40:15,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11|) |v_ULTIMATE.start_main_~#t2087~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2087~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2087~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2087~0.base, ULTIMATE.start_main_~#t2087~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:40:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2116216485 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2116216485 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In2116216485 |P2Thread1of1ForFork1_#t~ite32_Out2116216485|)) (and (= ~x~0_In2116216485 |P2Thread1of1ForFork1_#t~ite32_Out2116216485|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2116216485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2116216485, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2116216485, ~x~0=~x~0_In2116216485} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out2116216485|, ~x$w_buff1~0=~x$w_buff1~0_In2116216485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2116216485, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2116216485, ~x~0=~x~0_In2116216485} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:40:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |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_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1949253426 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1949253426 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1949253426| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1949253426 |P2Thread1of1ForFork1_#t~ite34_Out1949253426|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949253426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949253426} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1949253426|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1949253426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949253426} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:40:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1382025180 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1382025180 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1382025180| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1382025180| ~x$w_buff0_used~0_In-1382025180)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382025180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382025180} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382025180, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1382025180|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382025180} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:40:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1174367703 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1174367703 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1174367703 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1174367703 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1174367703|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out1174367703| ~x$w_buff1_used~0_In1174367703) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1174367703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1174367703, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1174367703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174367703} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1174367703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1174367703, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1174367703, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1174367703|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174367703} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:40:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1705035460 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1705035460 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1705035460) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1705035460 ~x$r_buff0_thd2~0_Out-1705035460) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705035460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705035460} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1705035460|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1705035460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705035460} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:40:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1693813950 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1693813950 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1693813950 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1693813950 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1693813950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1693813950| ~x$r_buff1_thd2~0_In1693813950) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1693813950, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1693813950, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1693813950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1693813950} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1693813950|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1693813950, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1693813950, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1693813950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1693813950} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:40:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 07:40:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1712303427 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-1712303427| |P0Thread1of1ForFork2_#t~ite8_Out-1712303427|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1712303427| ~x$w_buff0~0_In-1712303427) (not .cse0)) (and (= ~x$w_buff0~0_In-1712303427 |P0Thread1of1ForFork2_#t~ite8_Out-1712303427|) .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out-1712303427| |P0Thread1of1ForFork2_#t~ite8_Out-1712303427|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1712303427 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1712303427 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-1712303427 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1712303427 256)))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1712303427, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1712303427, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1712303427|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1712303427, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1712303427, ~weak$$choice2~0=~weak$$choice2~0_In-1712303427, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1712303427} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1712303427, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1712303427, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1712303427|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1712303427, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1712303427|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1712303427, ~weak$$choice2~0=~weak$$choice2~0_In-1712303427, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1712303427} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:40:15,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-878081068 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-878081068 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-878081068 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-878081068 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out-878081068| ~x$w_buff1_used~0_In-878081068) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-878081068| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-878081068, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-878081068, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-878081068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-878081068} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-878081068|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-878081068, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-878081068, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-878081068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-878081068} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:40:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In92873770 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In92873770 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out92873770|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In92873770 |P2Thread1of1ForFork1_#t~ite36_Out92873770|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In92873770, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92873770} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out92873770|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In92873770, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92873770} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:40:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-104904050 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-104904050 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-104904050 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-104904050 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-104904050| ~x$r_buff1_thd3~0_In-104904050) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite37_Out-104904050| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-104904050, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-104904050, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-104904050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-104904050} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-104904050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-104904050, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-104904050, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-104904050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-104904050} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:40:15,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 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_16} 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_15, 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 07:40:15,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In73522739 256)))) (or (and .cse0 (= ~x$w_buff1_used~0_In73522739 |P0Thread1of1ForFork2_#t~ite17_Out73522739|) (= |P0Thread1of1ForFork2_#t~ite18_Out73522739| |P0Thread1of1ForFork2_#t~ite17_Out73522739|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In73522739 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In73522739 256)) .cse1) (= (mod ~x$w_buff0_used~0_In73522739 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In73522739 256)))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In73522739| |P0Thread1of1ForFork2_#t~ite17_Out73522739|) (= ~x$w_buff1_used~0_In73522739 |P0Thread1of1ForFork2_#t~ite18_Out73522739|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In73522739, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In73522739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In73522739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In73522739, ~weak$$choice2~0=~weak$$choice2~0_In73522739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73522739} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In73522739, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out73522739|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out73522739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In73522739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In73522739, ~weak$$choice2~0=~weak$$choice2~0_In73522739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73522739} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:40:15,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} 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 07:40:15,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In556879372 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In556879372 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In556879372 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In556879372 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out556879372| |P0Thread1of1ForFork2_#t~ite23_Out556879372|)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In556879372 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In556879372| |P0Thread1of1ForFork2_#t~ite22_Out556879372|) (or (and (or .cse0 (and .cse1 .cse2) (and .cse2 .cse3)) .cse4 .cse5 (= ~x$r_buff1_thd1~0_In556879372 |P0Thread1of1ForFork2_#t~ite23_Out556879372|)) (and (not .cse4) (= |P0Thread1of1ForFork2_#t~ite23_In556879372| |P0Thread1of1ForFork2_#t~ite23_Out556879372|) (= ~x$r_buff1_thd1~0_In556879372 |P0Thread1of1ForFork2_#t~ite24_Out556879372|)))) (let ((.cse6 (not .cse2))) (and (or (not .cse3) .cse6) (or (not .cse1) .cse6) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out556879372|) (= |P0Thread1of1ForFork2_#t~ite23_Out556879372| |P0Thread1of1ForFork2_#t~ite22_Out556879372|) .cse4 (not .cse0) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In556879372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In556879372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In556879372, ~weak$$choice2~0=~weak$$choice2~0_In556879372, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In556879372|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In556879372|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In556879372} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In556879372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In556879372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In556879372, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out556879372|, ~weak$$choice2~0=~weak$$choice2~0_In556879372, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out556879372|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out556879372|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In556879372} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:40:15,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} 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_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:40:15,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1336650287 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1336650287 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1336650287| ~x~0_In-1336650287) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1336650287 |ULTIMATE.start_main_#t~ite41_Out-1336650287|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1336650287, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1336650287, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1336650287, ~x~0=~x~0_In-1336650287} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1336650287|, ~x$w_buff1~0=~x$w_buff1~0_In-1336650287, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1336650287, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1336650287, ~x~0=~x~0_In-1336650287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:40:15,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:40:15,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1933983129 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1933983129 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1933983129 |ULTIMATE.start_main_#t~ite43_Out-1933983129|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1933983129| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1933983129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933983129} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1933983129, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1933983129|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933983129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:40:15,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1711181927 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1711181927 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1711181927 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1711181927 256) 0))) (or (and (= ~x$w_buff1_used~0_In1711181927 |ULTIMATE.start_main_#t~ite44_Out1711181927|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1711181927| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1711181927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1711181927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1711181927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711181927} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1711181927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1711181927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1711181927, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1711181927|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711181927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:40:15,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-133795761 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-133795761 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-133795761|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-133795761| ~x$r_buff0_thd0~0_In-133795761)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-133795761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133795761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-133795761, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-133795761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133795761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:40:15,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1368998899 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1368998899 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1368998899 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1368998899 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1368998899| ~x$r_buff1_thd0~0_In-1368998899) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out-1368998899| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368998899, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1368998899, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1368998899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368998899} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1368998899, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1368998899|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1368998899, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1368998899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1368998899} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:40:15,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 07:40:15,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:40:15 BasicIcfg [2019-12-27 07:40:15,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:40:15,340 INFO L168 Benchmark]: Toolchain (without parser) took 100262.76 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.8 MB in the beginning and 823.8 MB in the end (delta: -723.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,340 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,342 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,342 INFO L168 Benchmark]: RCFGBuilder took 762.62 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,343 INFO L168 Benchmark]: TraceAbstraction took 98647.54 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.9 MB in the beginning and 823.8 MB in the end (delta: -719.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:40:15,346 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.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.62 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98647.54 ms. Allocated memory was 201.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 103.9 MB in the beginning and 823.8 MB in the end (delta: -719.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L820] FCALL, FORK 0 pthread_create(&t2086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L775] 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_p2_EAX=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] [L822] FCALL, FORK 0 pthread_create(&t2087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=1] [L795] 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_p2_EAX=1, 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=1] [L775] 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) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] 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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L739] 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) [L740] 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)) [L741] 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_p2_EAX=1, 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=0, x$flush_delayed=1, 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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 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)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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_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))=1, x=0, x$flush_delayed=1, 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=2] [L742] 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)) [L743] 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)) [L745] 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)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=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=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=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=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.3s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 46.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6673 SDtfs, 11846 SDslu, 27035 SDs, 0 SdLazy, 21067 SolverSat, 647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 47 SyntacticMatches, 29 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5655 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 277560 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 250143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...