/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/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:04:16,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:04:16,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:04:16,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:04:16,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:04:16,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:04:16,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:04:16,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:04:16,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:04:16,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:04:16,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:04:16,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:04:16,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:04:16,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:04:16,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:04:16,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:04:16,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:04:16,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:04:16,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:04:16,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:04:16,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:04:16,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:04:16,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:04:16,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:04:16,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:04:16,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:04:16,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:04:16,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:04:16,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:04:16,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:04:16,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:04:16,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:04:16,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:04:16,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:04:16,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:04:16,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:04:16,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:04:16,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:04:16,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:04:16,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:04:16,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:04:16,761 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-18 23:04:16,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:04:16,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:04:16,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:04:16,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:04:16,780 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:04:16,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:04:16,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:04:16,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:04:16,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:04:16,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:04:16,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:04:16,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:04:16,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:04:16,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:04:16,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:04:16,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:04:16,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:04:16,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:04:16,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:04:16,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:04:16,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:04:16,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:04:16,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:04:16,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:04:16,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:04:17,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:04:17,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:04:17,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:04:17,100 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:04:17,100 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:04:17,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-18 23:04:17,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba00a3b82/f0ce2d2117024e2b956ee562091304c3/FLAGae5bd729d [2019-12-18 23:04:17,765 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:04:17,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-18 23:04:17,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba00a3b82/f0ce2d2117024e2b956ee562091304c3/FLAGae5bd729d [2019-12-18 23:04:18,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba00a3b82/f0ce2d2117024e2b956ee562091304c3 [2019-12-18 23:04:18,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:04:18,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:04:18,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:04:18,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:04:18,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:04:18,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908c1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18, skipping insertion in model container [2019-12-18 23:04:18,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:04:18,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:04:18,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:04:18,763 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:04:18,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:04:18,910 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:04:18,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18 WrapperNode [2019-12-18 23:04:18,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:04:18,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:04:18,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:04:18,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:04:18,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:04:18,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:04:18,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:04:18,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:04:18,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:18,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:19,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:19,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:19,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (1/1) ... [2019-12-18 23:04:19,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:04:19,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:04:19,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:04:19,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:04:19,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (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-18 23:04:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:04:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:04:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:04:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:04:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:04:19,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:04:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:04:19,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:04:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:04:19,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:04:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:04:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:04:19,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:04:19,111 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:04:19,808 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:04:19,809 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:04:19,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:04:19 BoogieIcfgContainer [2019-12-18 23:04:19,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:04:19,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:04:19,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:04:19,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:04:19,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:04:18" (1/3) ... [2019-12-18 23:04:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bbe4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:04:19, skipping insertion in model container [2019-12-18 23:04:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:04:18" (2/3) ... [2019-12-18 23:04:19,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bbe4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:04:19, skipping insertion in model container [2019-12-18 23:04:19,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:04:19" (3/3) ... [2019-12-18 23:04:19,821 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2019-12-18 23:04:19,831 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:04:19,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:04:19,840 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:04:19,841 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:04:19,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:04:19,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:04:20,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:04:20,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:04:20,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:04:20,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:04:20,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:04:20,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:04:20,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:04:20,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:04:20,037 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 23:04:20,039 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:04:20,121 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:04:20,122 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:04:20,138 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:04:20,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:04:20,209 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:04:20,209 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:04:20,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:04:20,237 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 23:04:20,239 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:04:23,657 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 23:04:23,902 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 23:04:24,066 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 23:04:24,086 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75290 [2019-12-18 23:04:24,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 23:04:24,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-18 23:04:38,979 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92134 states. [2019-12-18 23:04:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 92134 states. [2019-12-18 23:04:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:04:38,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:38,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:04:38,989 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-18 23:04:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash 790879197, now seen corresponding path program 1 times [2019-12-18 23:04:39,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:39,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137629273] [2019-12-18 23:04:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:39,240 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-18 23:04:39,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137629273] [2019-12-18 23:04:39,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:39,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:04:39,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063901078] [2019-12-18 23:04:39,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:39,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:39,271 INFO L87 Difference]: Start difference. First operand 92134 states. Second operand 3 states. [2019-12-18 23:04:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:42,255 INFO L93 Difference]: Finished difference Result 90524 states and 389631 transitions. [2019-12-18 23:04:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:42,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:04:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:42,740 INFO L225 Difference]: With dead ends: 90524 [2019-12-18 23:04:42,740 INFO L226 Difference]: Without dead ends: 84882 [2019-12-18 23:04:42,742 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-18 23:04:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-12-18 23:04:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 84882. [2019-12-18 23:04:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84882 states. [2019-12-18 23:04:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84882 states to 84882 states and 364809 transitions. [2019-12-18 23:04:48,645 INFO L78 Accepts]: Start accepts. Automaton has 84882 states and 364809 transitions. Word has length 5 [2019-12-18 23:04:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:48,645 INFO L462 AbstractCegarLoop]: Abstraction has 84882 states and 364809 transitions. [2019-12-18 23:04:48,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 84882 states and 364809 transitions. [2019-12-18 23:04:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:48,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:48,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:48,655 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-18 23:04:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2214746, now seen corresponding path program 1 times [2019-12-18 23:04:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:48,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615060613] [2019-12-18 23:04:48,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:48,768 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-18 23:04:48,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615060613] [2019-12-18 23:04:48,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:48,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:48,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791060621] [2019-12-18 23:04:48,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:48,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:48,772 INFO L87 Difference]: Start difference. First operand 84882 states and 364809 transitions. Second operand 4 states. [2019-12-18 23:04:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:53,163 INFO L93 Difference]: Finished difference Result 130108 states and 534106 transitions. [2019-12-18 23:04:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:53,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:04:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:53,796 INFO L225 Difference]: With dead ends: 130108 [2019-12-18 23:04:53,796 INFO L226 Difference]: Without dead ends: 129996 [2019-12-18 23:04:53,797 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-18 23:04:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2019-12-18 23:05:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 120798. [2019-12-18 23:05:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120798 states. [2019-12-18 23:05:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120798 states to 120798 states and 501253 transitions. [2019-12-18 23:05:06,665 INFO L78 Accepts]: Start accepts. Automaton has 120798 states and 501253 transitions. Word has length 13 [2019-12-18 23:05:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 120798 states and 501253 transitions. [2019-12-18 23:05:06,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:05:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 120798 states and 501253 transitions. [2019-12-18 23:05:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:05:06,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:06,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:06,670 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-18 23:05:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1319615161, now seen corresponding path program 1 times [2019-12-18 23:05:06,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:06,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016141129] [2019-12-18 23:05:06,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:06,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016141129] [2019-12-18 23:05:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:06,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:06,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875489735] [2019-12-18 23:05:06,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:06,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:06,731 INFO L87 Difference]: Start difference. First operand 120798 states and 501253 transitions. Second operand 3 states. [2019-12-18 23:05:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:06,979 INFO L93 Difference]: Finished difference Result 29480 states and 98975 transitions. [2019-12-18 23:05:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:06,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:05:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:07,056 INFO L225 Difference]: With dead ends: 29480 [2019-12-18 23:05:07,056 INFO L226 Difference]: Without dead ends: 29480 [2019-12-18 23:05:07,057 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-18 23:05:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29480 states. [2019-12-18 23:05:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29480 to 29480. [2019-12-18 23:05:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29480 states. [2019-12-18 23:05:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29480 states to 29480 states and 98975 transitions. [2019-12-18 23:05:07,633 INFO L78 Accepts]: Start accepts. Automaton has 29480 states and 98975 transitions. Word has length 13 [2019-12-18 23:05:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:07,634 INFO L462 AbstractCegarLoop]: Abstraction has 29480 states and 98975 transitions. [2019-12-18 23:05:07,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 29480 states and 98975 transitions. [2019-12-18 23:05:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:05:07,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:07,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:07,637 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-18 23:05:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -856921002, now seen corresponding path program 1 times [2019-12-18 23:05:07,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:07,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805032057] [2019-12-18 23:05:07,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:07,773 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-18 23:05:07,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805032057] [2019-12-18 23:05:07,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:07,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:07,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660703788] [2019-12-18 23:05:07,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:05:07,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:05:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:07,776 INFO L87 Difference]: Start difference. First operand 29480 states and 98975 transitions. Second operand 5 states. [2019-12-18 23:05:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:08,300 INFO L93 Difference]: Finished difference Result 42246 states and 139417 transitions. [2019-12-18 23:05:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:05:08,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 23:05:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:08,384 INFO L225 Difference]: With dead ends: 42246 [2019-12-18 23:05:08,385 INFO L226 Difference]: Without dead ends: 42228 [2019-12-18 23:05:08,385 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-18 23:05:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42228 states. [2019-12-18 23:05:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42228 to 33417. [2019-12-18 23:05:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2019-12-18 23:05:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 111616 transitions. [2019-12-18 23:05:11,139 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 111616 transitions. Word has length 14 [2019-12-18 23:05:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:11,139 INFO L462 AbstractCegarLoop]: Abstraction has 33417 states and 111616 transitions. [2019-12-18 23:05:11,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:05:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 111616 transitions. [2019-12-18 23:05:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:05:11,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:11,150 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-18 23:05:11,150 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-18 23:05:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1451441927, now seen corresponding path program 1 times [2019-12-18 23:05:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:11,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506918067] [2019-12-18 23:05:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:11,313 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-18 23:05:11,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506918067] [2019-12-18 23:05:11,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:11,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:05:11,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041145823] [2019-12-18 23:05:11,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:11,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:11,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:11,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:11,316 INFO L87 Difference]: Start difference. First operand 33417 states and 111616 transitions. Second operand 6 states. [2019-12-18 23:05:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:12,215 INFO L93 Difference]: Finished difference Result 52783 states and 172326 transitions. [2019-12-18 23:05:12,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:05:12,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:05:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:12,305 INFO L225 Difference]: With dead ends: 52783 [2019-12-18 23:05:12,305 INFO L226 Difference]: Without dead ends: 52753 [2019-12-18 23:05:12,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:05:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52753 states. [2019-12-18 23:05:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52753 to 36130. [2019-12-18 23:05:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36130 states. [2019-12-18 23:05:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36130 states to 36130 states and 119897 transitions. [2019-12-18 23:05:13,027 INFO L78 Accepts]: Start accepts. Automaton has 36130 states and 119897 transitions. Word has length 22 [2019-12-18 23:05:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:13,028 INFO L462 AbstractCegarLoop]: Abstraction has 36130 states and 119897 transitions. [2019-12-18 23:05:13,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36130 states and 119897 transitions. [2019-12-18 23:05:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:05:13,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:13,038 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-18 23:05:13,038 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-18 23:05:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -880932147, now seen corresponding path program 1 times [2019-12-18 23:05:13,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:13,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930561594] [2019-12-18 23:05:13,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:13,452 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-12-18 23:05:13,480 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-18 23:05:13,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930561594] [2019-12-18 23:05:13,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:13,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:05:13,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883454709] [2019-12-18 23:05:13,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:13,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:13,482 INFO L87 Difference]: Start difference. First operand 36130 states and 119897 transitions. Second operand 6 states. [2019-12-18 23:05:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:14,288 INFO L93 Difference]: Finished difference Result 61139 states and 197009 transitions. [2019-12-18 23:05:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:05:14,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:05:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:14,396 INFO L225 Difference]: With dead ends: 61139 [2019-12-18 23:05:14,397 INFO L226 Difference]: Without dead ends: 61109 [2019-12-18 23:05:14,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:05:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2019-12-18 23:05:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 41888. [2019-12-18 23:05:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 23:05:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137110 transitions. [2019-12-18 23:05:15,248 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137110 transitions. Word has length 22 [2019-12-18 23:05:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137110 transitions. [2019-12-18 23:05:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137110 transitions. [2019-12-18 23:05:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:05:15,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:15,256 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-18 23:05:15,256 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-18 23:05:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1606912493, now seen corresponding path program 2 times [2019-12-18 23:05:15,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:15,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369700220] [2019-12-18 23:05:15,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:15,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-18 23:05:15,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369700220] [2019-12-18 23:05:15,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:15,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:05:15,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204307802] [2019-12-18 23:05:15,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:15,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:15,338 INFO L87 Difference]: Start difference. First operand 41888 states and 137110 transitions. Second operand 6 states. [2019-12-18 23:05:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:16,663 INFO L93 Difference]: Finished difference Result 59558 states and 191538 transitions. [2019-12-18 23:05:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:05:16,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 23:05:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:16,769 INFO L225 Difference]: With dead ends: 59558 [2019-12-18 23:05:16,769 INFO L226 Difference]: Without dead ends: 59540 [2019-12-18 23:05:16,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:05:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59540 states. [2019-12-18 23:05:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59540 to 39834. [2019-12-18 23:05:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39834 states. [2019-12-18 23:05:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39834 states to 39834 states and 130144 transitions. [2019-12-18 23:05:17,575 INFO L78 Accepts]: Start accepts. Automaton has 39834 states and 130144 transitions. Word has length 22 [2019-12-18 23:05:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:17,575 INFO L462 AbstractCegarLoop]: Abstraction has 39834 states and 130144 transitions. [2019-12-18 23:05:17,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39834 states and 130144 transitions. [2019-12-18 23:05:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:05:17,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:17,588 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-18 23:05:17,588 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-18 23:05:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1210888405, now seen corresponding path program 1 times [2019-12-18 23:05:17,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:17,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35539066] [2019-12-18 23:05:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:17,634 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-18 23:05:17,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35539066] [2019-12-18 23:05:17,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:17,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:17,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664988124] [2019-12-18 23:05:17,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:05:17,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:17,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:05:17,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:17,638 INFO L87 Difference]: Start difference. First operand 39834 states and 130144 transitions. Second operand 4 states. [2019-12-18 23:05:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:17,707 INFO L93 Difference]: Finished difference Result 15680 states and 47607 transitions. [2019-12-18 23:05:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:05:17,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 23:05:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:17,729 INFO L225 Difference]: With dead ends: 15680 [2019-12-18 23:05:17,729 INFO L226 Difference]: Without dead ends: 15680 [2019-12-18 23:05:17,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2019-12-18 23:05:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 15474. [2019-12-18 23:05:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15474 states. [2019-12-18 23:05:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15474 states to 15474 states and 47012 transitions. [2019-12-18 23:05:17,956 INFO L78 Accepts]: Start accepts. Automaton has 15474 states and 47012 transitions. Word has length 25 [2019-12-18 23:05:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:17,956 INFO L462 AbstractCegarLoop]: Abstraction has 15474 states and 47012 transitions. [2019-12-18 23:05:17,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:05:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 15474 states and 47012 transitions. [2019-12-18 23:05:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 23:05:17,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:17,981 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-18 23:05:17,982 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-18 23:05:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1136830823, now seen corresponding path program 1 times [2019-12-18 23:05:17,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:17,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288727395] [2019-12-18 23:05:17,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:18,040 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-18 23:05:18,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288727395] [2019-12-18 23:05:18,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:18,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:18,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414479957] [2019-12-18 23:05:18,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:18,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:18,042 INFO L87 Difference]: Start difference. First operand 15474 states and 47012 transitions. Second operand 3 states. [2019-12-18 23:05:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:18,147 INFO L93 Difference]: Finished difference Result 28148 states and 85452 transitions. [2019-12-18 23:05:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 23:05:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:18,171 INFO L225 Difference]: With dead ends: 28148 [2019-12-18 23:05:18,171 INFO L226 Difference]: Without dead ends: 15947 [2019-12-18 23:05:18,171 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-18 23:05:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-12-18 23:05:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 15806. [2019-12-18 23:05:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2019-12-18 23:05:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 47065 transitions. [2019-12-18 23:05:18,389 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 47065 transitions. Word has length 39 [2019-12-18 23:05:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:18,389 INFO L462 AbstractCegarLoop]: Abstraction has 15806 states and 47065 transitions. [2019-12-18 23:05:18,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 47065 transitions. [2019-12-18 23:05:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 23:05:18,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:18,410 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-18 23:05:18,410 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-18 23:05:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash -285407363, now seen corresponding path program 1 times [2019-12-18 23:05:18,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:18,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252276194] [2019-12-18 23:05:18,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:18,482 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-18 23:05:18,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252276194] [2019-12-18 23:05:18,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:18,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:05:18,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579577673] [2019-12-18 23:05:18,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:05:18,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:05:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:18,485 INFO L87 Difference]: Start difference. First operand 15806 states and 47065 transitions. Second operand 5 states. [2019-12-18 23:05:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:18,753 INFO L93 Difference]: Finished difference Result 14360 states and 43443 transitions. [2019-12-18 23:05:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:05:18,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 23:05:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:18,776 INFO L225 Difference]: With dead ends: 14360 [2019-12-18 23:05:18,776 INFO L226 Difference]: Without dead ends: 12352 [2019-12-18 23:05:18,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2019-12-18 23:05:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 11736. [2019-12-18 23:05:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11736 states. [2019-12-18 23:05:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11736 states to 11736 states and 36252 transitions. [2019-12-18 23:05:18,960 INFO L78 Accepts]: Start accepts. Automaton has 11736 states and 36252 transitions. Word has length 40 [2019-12-18 23:05:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:18,960 INFO L462 AbstractCegarLoop]: Abstraction has 11736 states and 36252 transitions. [2019-12-18 23:05:18,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:05:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11736 states and 36252 transitions. [2019-12-18 23:05:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:18,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:18,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:18,979 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-18 23:05:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 72230609, now seen corresponding path program 1 times [2019-12-18 23:05:18,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:18,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914278292] [2019-12-18 23:05:18,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:19,038 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-18 23:05:19,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914278292] [2019-12-18 23:05:19,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:19,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:19,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720699878] [2019-12-18 23:05:19,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:19,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:19,041 INFO L87 Difference]: Start difference. First operand 11736 states and 36252 transitions. Second operand 3 states. [2019-12-18 23:05:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:19,127 INFO L93 Difference]: Finished difference Result 15466 states and 47136 transitions. [2019-12-18 23:05:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:19,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:05:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:19,149 INFO L225 Difference]: With dead ends: 15466 [2019-12-18 23:05:19,149 INFO L226 Difference]: Without dead ends: 15466 [2019-12-18 23:05:19,149 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-18 23:05:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2019-12-18 23:05:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 12452. [2019-12-18 23:05:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12452 states. [2019-12-18 23:05:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12452 states to 12452 states and 38494 transitions. [2019-12-18 23:05:19,367 INFO L78 Accepts]: Start accepts. Automaton has 12452 states and 38494 transitions. Word has length 54 [2019-12-18 23:05:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:19,368 INFO L462 AbstractCegarLoop]: Abstraction has 12452 states and 38494 transitions. [2019-12-18 23:05:19,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 12452 states and 38494 transitions. [2019-12-18 23:05:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:19,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:19,385 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-18 23:05:19,385 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-18 23:05:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1591694771, now seen corresponding path program 1 times [2019-12-18 23:05:19,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:19,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121173749] [2019-12-18 23:05:19,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:19,468 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-18 23:05:19,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121173749] [2019-12-18 23:05:19,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:19,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:05:19,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112551813] [2019-12-18 23:05:19,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:19,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:19,470 INFO L87 Difference]: Start difference. First operand 12452 states and 38494 transitions. Second operand 6 states. [2019-12-18 23:05:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:19,903 INFO L93 Difference]: Finished difference Result 37107 states and 113202 transitions. [2019-12-18 23:05:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:05:19,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 23:05:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:19,956 INFO L225 Difference]: With dead ends: 37107 [2019-12-18 23:05:19,957 INFO L226 Difference]: Without dead ends: 26417 [2019-12-18 23:05:19,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:05:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2019-12-18 23:05:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 15311. [2019-12-18 23:05:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 23:05:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47554 transitions. [2019-12-18 23:05:20,301 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47554 transitions. Word has length 54 [2019-12-18 23:05:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:20,302 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47554 transitions. [2019-12-18 23:05:20,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47554 transitions. [2019-12-18 23:05:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:20,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:20,319 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-18 23:05:20,319 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-18 23:05:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash 944548917, now seen corresponding path program 2 times [2019-12-18 23:05:20,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:20,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219419245] [2019-12-18 23:05:20,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:20,408 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-18 23:05:20,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219419245] [2019-12-18 23:05:20,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:20,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:05:20,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821766057] [2019-12-18 23:05:20,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:05:20,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:05:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:05:20,412 INFO L87 Difference]: Start difference. First operand 15311 states and 47554 transitions. Second operand 7 states. [2019-12-18 23:05:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:20,921 INFO L93 Difference]: Finished difference Result 36247 states and 110845 transitions. [2019-12-18 23:05:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:05:20,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:05:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:20,980 INFO L225 Difference]: With dead ends: 36247 [2019-12-18 23:05:20,980 INFO L226 Difference]: Without dead ends: 28238 [2019-12-18 23:05:20,981 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-18 23:05:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-18 23:05:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 18156. [2019-12-18 23:05:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18156 states. [2019-12-18 23:05:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18156 states to 18156 states and 56517 transitions. [2019-12-18 23:05:21,663 INFO L78 Accepts]: Start accepts. Automaton has 18156 states and 56517 transitions. Word has length 54 [2019-12-18 23:05:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:21,663 INFO L462 AbstractCegarLoop]: Abstraction has 18156 states and 56517 transitions. [2019-12-18 23:05:21,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:05:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18156 states and 56517 transitions. [2019-12-18 23:05:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:21,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:21,688 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-18 23:05:21,689 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-18 23:05:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash -472146899, now seen corresponding path program 3 times [2019-12-18 23:05:21,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:21,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923269782] [2019-12-18 23:05:21,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:21,775 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-18 23:05:21,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923269782] [2019-12-18 23:05:21,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:21,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:05:21,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046650697] [2019-12-18 23:05:21,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:05:21,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:05:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:05:21,778 INFO L87 Difference]: Start difference. First operand 18156 states and 56517 transitions. Second operand 7 states. [2019-12-18 23:05:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:22,224 INFO L93 Difference]: Finished difference Result 32612 states and 98652 transitions. [2019-12-18 23:05:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:05:22,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:05:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:22,283 INFO L225 Difference]: With dead ends: 32612 [2019-12-18 23:05:22,283 INFO L226 Difference]: Without dead ends: 30521 [2019-12-18 23:05:22,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:05:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30521 states. [2019-12-18 23:05:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30521 to 18238. [2019-12-18 23:05:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18238 states. [2019-12-18 23:05:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18238 states to 18238 states and 56811 transitions. [2019-12-18 23:05:22,672 INFO L78 Accepts]: Start accepts. Automaton has 18238 states and 56811 transitions. Word has length 54 [2019-12-18 23:05:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:22,672 INFO L462 AbstractCegarLoop]: Abstraction has 18238 states and 56811 transitions. [2019-12-18 23:05:22,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:05:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18238 states and 56811 transitions. [2019-12-18 23:05:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:22,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:22,702 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-18 23:05:22,702 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-18 23:05:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1266055375, now seen corresponding path program 1 times [2019-12-18 23:05:22,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:22,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566751134] [2019-12-18 23:05:22,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:22,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566751134] [2019-12-18 23:05:22,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:22,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:22,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475965979] [2019-12-18 23:05:22,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:22,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:22,752 INFO L87 Difference]: Start difference. First operand 18238 states and 56811 transitions. Second operand 3 states. [2019-12-18 23:05:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:22,862 INFO L93 Difference]: Finished difference Result 20067 states and 60827 transitions. [2019-12-18 23:05:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:22,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:05:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:22,899 INFO L225 Difference]: With dead ends: 20067 [2019-12-18 23:05:22,899 INFO L226 Difference]: Without dead ends: 20067 [2019-12-18 23:05:22,899 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-18 23:05:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2019-12-18 23:05:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 16362. [2019-12-18 23:05:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16362 states. [2019-12-18 23:05:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16362 states to 16362 states and 50310 transitions. [2019-12-18 23:05:23,206 INFO L78 Accepts]: Start accepts. Automaton has 16362 states and 50310 transitions. Word has length 54 [2019-12-18 23:05:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:23,206 INFO L462 AbstractCegarLoop]: Abstraction has 16362 states and 50310 transitions. [2019-12-18 23:05:23,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 16362 states and 50310 transitions. [2019-12-18 23:05:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:23,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:23,224 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-18 23:05:23,224 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-18 23:05:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1033313199, now seen corresponding path program 4 times [2019-12-18 23:05:23,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:23,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557775409] [2019-12-18 23:05:23,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:23,316 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-18 23:05:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557775409] [2019-12-18 23:05:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:23,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:05:23,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469822882] [2019-12-18 23:05:23,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:05:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:05:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:05:23,318 INFO L87 Difference]: Start difference. First operand 16362 states and 50310 transitions. Second operand 7 states. [2019-12-18 23:05:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:23,705 INFO L93 Difference]: Finished difference Result 32735 states and 97743 transitions. [2019-12-18 23:05:23,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:05:23,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:05:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:23,744 INFO L225 Difference]: With dead ends: 32735 [2019-12-18 23:05:23,744 INFO L226 Difference]: Without dead ends: 27615 [2019-12-18 23:05:23,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:05:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2019-12-18 23:05:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 16518. [2019-12-18 23:05:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16518 states. [2019-12-18 23:05:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16518 states to 16518 states and 50740 transitions. [2019-12-18 23:05:24,084 INFO L78 Accepts]: Start accepts. Automaton has 16518 states and 50740 transitions. Word has length 54 [2019-12-18 23:05:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:24,084 INFO L462 AbstractCegarLoop]: Abstraction has 16518 states and 50740 transitions. [2019-12-18 23:05:24,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:05:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16518 states and 50740 transitions. [2019-12-18 23:05:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:24,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:24,102 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-18 23:05:24,102 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-18 23:05:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1310665995, now seen corresponding path program 5 times [2019-12-18 23:05:24,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:24,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669961812] [2019-12-18 23:05:24,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:24,178 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-18 23:05:24,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669961812] [2019-12-18 23:05:24,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:24,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:05:24,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146415280] [2019-12-18 23:05:24,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:05:24,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:05:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:24,180 INFO L87 Difference]: Start difference. First operand 16518 states and 50740 transitions. Second operand 5 states. [2019-12-18 23:05:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:24,856 INFO L93 Difference]: Finished difference Result 25110 states and 74778 transitions. [2019-12-18 23:05:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:05:24,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 23:05:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:24,915 INFO L225 Difference]: With dead ends: 25110 [2019-12-18 23:05:24,915 INFO L226 Difference]: Without dead ends: 25026 [2019-12-18 23:05:24,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-18 23:05:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2019-12-18 23:05:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 19101. [2019-12-18 23:05:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19101 states. [2019-12-18 23:05:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19101 states to 19101 states and 58187 transitions. [2019-12-18 23:05:25,628 INFO L78 Accepts]: Start accepts. Automaton has 19101 states and 58187 transitions. Word has length 54 [2019-12-18 23:05:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:25,628 INFO L462 AbstractCegarLoop]: Abstraction has 19101 states and 58187 transitions. [2019-12-18 23:05:25,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:05:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 19101 states and 58187 transitions. [2019-12-18 23:05:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:25,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:25,648 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-18 23:05:25,648 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-18 23:05:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:25,648 INFO L82 PathProgramCache]: Analyzing trace with hash 454744557, now seen corresponding path program 6 times [2019-12-18 23:05:25,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:25,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486745319] [2019-12-18 23:05:25,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:25,754 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-18 23:05:25,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486745319] [2019-12-18 23:05:25,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:25,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:05:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274629926] [2019-12-18 23:05:25,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:05:25,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:05:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:05:25,756 INFO L87 Difference]: Start difference. First operand 19101 states and 58187 transitions. Second operand 7 states. [2019-12-18 23:05:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:26,895 INFO L93 Difference]: Finished difference Result 25883 states and 76771 transitions. [2019-12-18 23:05:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:05:26,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 23:05:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:26,942 INFO L225 Difference]: With dead ends: 25883 [2019-12-18 23:05:26,943 INFO L226 Difference]: Without dead ends: 25883 [2019-12-18 23:05:26,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:05:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25883 states. [2019-12-18 23:05:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25883 to 17612. [2019-12-18 23:05:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17612 states. [2019-12-18 23:05:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 53903 transitions. [2019-12-18 23:05:27,260 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 53903 transitions. Word has length 54 [2019-12-18 23:05:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:27,260 INFO L462 AbstractCegarLoop]: Abstraction has 17612 states and 53903 transitions. [2019-12-18 23:05:27,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:05:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 53903 transitions. [2019-12-18 23:05:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:27,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:27,280 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-18 23:05:27,280 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-18 23:05:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1507078609, now seen corresponding path program 7 times [2019-12-18 23:05:27,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:27,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453004413] [2019-12-18 23:05:27,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:27,413 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-18 23:05:27,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453004413] [2019-12-18 23:05:27,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:27,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:05:27,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010845916] [2019-12-18 23:05:27,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:05:27,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:05:27,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:27,416 INFO L87 Difference]: Start difference. First operand 17612 states and 53903 transitions. Second operand 9 states. [2019-12-18 23:05:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:29,355 INFO L93 Difference]: Finished difference Result 26122 states and 77334 transitions. [2019-12-18 23:05:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 23:05:29,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 23:05:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:29,417 INFO L225 Difference]: With dead ends: 26122 [2019-12-18 23:05:29,418 INFO L226 Difference]: Without dead ends: 25996 [2019-12-18 23:05:29,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:05:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25996 states. [2019-12-18 23:05:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25996 to 18690. [2019-12-18 23:05:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2019-12-18 23:05:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 56851 transitions. [2019-12-18 23:05:29,966 INFO L78 Accepts]: Start accepts. Automaton has 18690 states and 56851 transitions. Word has length 54 [2019-12-18 23:05:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:29,966 INFO L462 AbstractCegarLoop]: Abstraction has 18690 states and 56851 transitions. [2019-12-18 23:05:29,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:05:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 56851 transitions. [2019-12-18 23:05:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:29,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:29,985 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-18 23:05:29,985 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-18 23:05:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1799112527, now seen corresponding path program 8 times [2019-12-18 23:05:29,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:29,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669318167] [2019-12-18 23:05:29,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:30,123 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-18 23:05:30,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669318167] [2019-12-18 23:05:30,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:30,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:05:30,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951957488] [2019-12-18 23:05:30,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:05:30,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:30,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:05:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:30,126 INFO L87 Difference]: Start difference. First operand 18690 states and 56851 transitions. Second operand 9 states. [2019-12-18 23:05:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:31,517 INFO L93 Difference]: Finished difference Result 32212 states and 94517 transitions. [2019-12-18 23:05:31,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:05:31,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 23:05:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:31,563 INFO L225 Difference]: With dead ends: 32212 [2019-12-18 23:05:31,563 INFO L226 Difference]: Without dead ends: 31990 [2019-12-18 23:05:31,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:05:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31990 states. [2019-12-18 23:05:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31990 to 22271. [2019-12-18 23:05:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22271 states. [2019-12-18 23:05:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22271 states to 22271 states and 66596 transitions. [2019-12-18 23:05:32,002 INFO L78 Accepts]: Start accepts. Automaton has 22271 states and 66596 transitions. Word has length 54 [2019-12-18 23:05:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 22271 states and 66596 transitions. [2019-12-18 23:05:32,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:05:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22271 states and 66596 transitions. [2019-12-18 23:05:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:32,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:32,026 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-18 23:05:32,026 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-18 23:05:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 83564179, now seen corresponding path program 9 times [2019-12-18 23:05:32,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:32,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191153080] [2019-12-18 23:05:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:32,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191153080] [2019-12-18 23:05:32,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:32,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:05:32,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752073789] [2019-12-18 23:05:32,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:05:32,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:05:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:05:32,154 INFO L87 Difference]: Start difference. First operand 22271 states and 66596 transitions. Second operand 8 states. [2019-12-18 23:05:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:33,476 INFO L93 Difference]: Finished difference Result 43546 states and 128389 transitions. [2019-12-18 23:05:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:05:33,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 23:05:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:33,541 INFO L225 Difference]: With dead ends: 43546 [2019-12-18 23:05:33,541 INFO L226 Difference]: Without dead ends: 43322 [2019-12-18 23:05:33,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:05:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43322 states. [2019-12-18 23:05:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43322 to 22306. [2019-12-18 23:05:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22306 states. [2019-12-18 23:05:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22306 states to 22306 states and 66857 transitions. [2019-12-18 23:05:34,036 INFO L78 Accepts]: Start accepts. Automaton has 22306 states and 66857 transitions. Word has length 54 [2019-12-18 23:05:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:34,036 INFO L462 AbstractCegarLoop]: Abstraction has 22306 states and 66857 transitions. [2019-12-18 23:05:34,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:05:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22306 states and 66857 transitions. [2019-12-18 23:05:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:05:34,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:34,062 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-18 23:05:34,062 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-18 23:05:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash 367149589, now seen corresponding path program 10 times [2019-12-18 23:05:34,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:34,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026577646] [2019-12-18 23:05:34,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:34,127 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-18 23:05:34,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026577646] [2019-12-18 23:05:34,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:34,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:34,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155864719] [2019-12-18 23:05:34,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:34,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:34,129 INFO L87 Difference]: Start difference. First operand 22306 states and 66857 transitions. Second operand 3 states. [2019-12-18 23:05:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:34,226 INFO L93 Difference]: Finished difference Result 22306 states and 66855 transitions. [2019-12-18 23:05:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:34,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 23:05:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:34,259 INFO L225 Difference]: With dead ends: 22306 [2019-12-18 23:05:34,259 INFO L226 Difference]: Without dead ends: 22306 [2019-12-18 23:05:34,260 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-18 23:05:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22306 states. [2019-12-18 23:05:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22306 to 18666. [2019-12-18 23:05:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18666 states. [2019-12-18 23:05:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18666 states to 18666 states and 57066 transitions. [2019-12-18 23:05:34,839 INFO L78 Accepts]: Start accepts. Automaton has 18666 states and 57066 transitions. Word has length 54 [2019-12-18 23:05:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:34,840 INFO L462 AbstractCegarLoop]: Abstraction has 18666 states and 57066 transitions. [2019-12-18 23:05:34,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18666 states and 57066 transitions. [2019-12-18 23:05:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:05:34,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:34,861 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-18 23:05:34,861 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-18 23:05:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -409945417, now seen corresponding path program 1 times [2019-12-18 23:05:34,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:34,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848768572] [2019-12-18 23:05:34,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:34,906 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-18 23:05:34,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848768572] [2019-12-18 23:05:34,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:34,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:34,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997274790] [2019-12-18 23:05:34,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:34,908 INFO L87 Difference]: Start difference. First operand 18666 states and 57066 transitions. Second operand 3 states. [2019-12-18 23:05:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:34,975 INFO L93 Difference]: Finished difference Result 14343 states and 43229 transitions. [2019-12-18 23:05:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:34,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:05:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:35,003 INFO L225 Difference]: With dead ends: 14343 [2019-12-18 23:05:35,004 INFO L226 Difference]: Without dead ends: 14343 [2019-12-18 23:05:35,004 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-18 23:05:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2019-12-18 23:05:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 13786. [2019-12-18 23:05:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13786 states. [2019-12-18 23:05:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13786 states to 13786 states and 41545 transitions. [2019-12-18 23:05:35,324 INFO L78 Accepts]: Start accepts. Automaton has 13786 states and 41545 transitions. Word has length 55 [2019-12-18 23:05:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:35,324 INFO L462 AbstractCegarLoop]: Abstraction has 13786 states and 41545 transitions. [2019-12-18 23:05:35,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13786 states and 41545 transitions. [2019-12-18 23:05:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:05:35,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:35,345 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-18 23:05:35,346 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-18 23:05:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash -51181904, now seen corresponding path program 1 times [2019-12-18 23:05:35,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:35,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587182523] [2019-12-18 23:05:35,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:35,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:05:35,501 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:05:35,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_43 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_19| 1)) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= v_~x~0_26 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~x$flush_delayed~0_13 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~x$r_buff1_thd0~0_26 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2525~0.base_19| 4)) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$read_delayed~0_6) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2525~0.base_19| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2525~0.base_19|) |v_ULTIMATE.start_main_~#t2525~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2525~0.base_19|) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd1~0_71) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_19|) 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_16|) (= v_~z~0_17 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~main$tmp_guard0~0_11 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_21|, #length=|v_#length_25|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_17|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_16|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_26, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~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_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~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, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__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-18 23:05:35,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 23:05:35,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_35) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 23:05:35,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-18 23:05:35,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1983602003 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1983602003 256)))) (or (and (= ~x~0_In1983602003 |P2Thread1of1ForFork1_#t~ite32_Out1983602003|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1983602003 |P2Thread1of1ForFork1_#t~ite32_Out1983602003|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1983602003, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1983602003, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1983602003, ~x~0=~x~0_In1983602003} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1983602003|, ~x$w_buff1~0=~x$w_buff1~0_In1983602003, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1983602003, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1983602003, ~x~0=~x~0_In1983602003} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 23:05:35,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_19 |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_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 23:05:35,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2029255704 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In2029255704 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2029255704 |P2Thread1of1ForFork1_#t~ite34_Out2029255704|)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out2029255704| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2029255704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2029255704} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2029255704|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2029255704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2029255704} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 23:05:35,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-1894277319 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1894277319 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1894277319 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1894277319 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1894277319| ~x$w_buff1_used~0_In-1894277319) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1894277319| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1894277319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1894277319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1894277319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1894277319} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1894277319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1894277319, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1894277319, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1894277319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1894277319} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 23:05:35,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-411548751 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-411548751 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-411548751| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-411548751| ~x$r_buff0_thd3~0_In-411548751) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-411548751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-411548751} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-411548751|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-411548751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-411548751} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 23:05:35,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-972428164 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-972428164 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-972428164 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-972428164 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-972428164| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-972428164| ~x$r_buff1_thd3~0_In-972428164)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-972428164, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-972428164, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-972428164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-972428164} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-972428164|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-972428164, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-972428164, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-972428164, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-972428164} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 23:05:35,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} 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_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, 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-18 23:05:35,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2117813521 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-2117813521 |P0Thread1of1ForFork2_#t~ite11_Out-2117813521|) (= |P0Thread1of1ForFork2_#t~ite12_Out-2117813521| |P0Thread1of1ForFork2_#t~ite11_Out-2117813521|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2117813521 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-2117813521 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-2117813521 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-2117813521 256) 0) .cse1)))) (and (= ~x$w_buff1~0_In-2117813521 |P0Thread1of1ForFork2_#t~ite12_Out-2117813521|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-2117813521| |P0Thread1of1ForFork2_#t~ite11_Out-2117813521|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2117813521, ~x$w_buff1~0=~x$w_buff1~0_In-2117813521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117813521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2117813521, ~weak$$choice2~0=~weak$$choice2~0_In-2117813521, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-2117813521|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2117813521} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2117813521, ~x$w_buff1~0=~x$w_buff1~0_In-2117813521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117813521, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2117813521, ~weak$$choice2~0=~weak$$choice2~0_In-2117813521, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-2117813521|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-2117813521|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2117813521} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 23:05:35,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-794903034 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out-794903034| |P0Thread1of1ForFork2_#t~ite15_Out-794903034|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-794903034 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-794903034 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-794903034 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-794903034 256)))) (= ~x$w_buff0_used~0_In-794903034 |P0Thread1of1ForFork2_#t~ite14_Out-794903034|)) (and (= ~x$w_buff0_used~0_In-794903034 |P0Thread1of1ForFork2_#t~ite15_Out-794903034|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-794903034| |P0Thread1of1ForFork2_#t~ite14_Out-794903034|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-794903034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-794903034, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-794903034, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-794903034|, ~weak$$choice2~0=~weak$$choice2~0_In-794903034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-794903034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-794903034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-794903034, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-794903034|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-794903034, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-794903034|, ~weak$$choice2~0=~weak$$choice2~0_In-794903034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-794903034} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 23:05:35,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_21, 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-18 23:05:35,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-498228362 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-498228362 256)))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In-498228362 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-498228362 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-498228362 256)))) (= ~x$r_buff1_thd1~0_In-498228362 |P0Thread1of1ForFork2_#t~ite23_Out-498228362|) (= |P0Thread1of1ForFork2_#t~ite24_Out-498228362| |P0Thread1of1ForFork2_#t~ite23_Out-498228362|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite24_Out-498228362| ~x$r_buff1_thd1~0_In-498228362) (= |P0Thread1of1ForFork2_#t~ite23_In-498228362| |P0Thread1of1ForFork2_#t~ite23_Out-498228362|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-498228362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498228362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-498228362, ~weak$$choice2~0=~weak$$choice2~0_In-498228362, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-498228362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498228362} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-498228362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498228362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-498228362, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-498228362|, ~weak$$choice2~0=~weak$$choice2~0_In-498228362, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-498228362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498228362} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 23:05:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_5 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~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_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 23:05:35,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1433012208 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1433012208 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1433012208| ~x$w_buff0_used~0_In-1433012208) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1433012208| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433012208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433012208} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433012208, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1433012208|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433012208} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 23:05:35,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In28046734 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In28046734 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In28046734 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In28046734 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out28046734| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In28046734 |P1Thread1of1ForFork0_#t~ite29_Out28046734|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In28046734, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In28046734, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In28046734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In28046734} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In28046734, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In28046734, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In28046734, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out28046734|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In28046734} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 23:05:35,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In313647618 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In313647618 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In313647618 ~x$r_buff0_thd2~0_Out313647618) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out313647618) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In313647618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In313647618} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out313647618|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out313647618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In313647618} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 23:05:35,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1043187248 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1043187248 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1043187248 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1043187248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1043187248|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1043187248| ~x$r_buff1_thd2~0_In1043187248) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1043187248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1043187248, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1043187248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1043187248} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1043187248|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1043187248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1043187248, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1043187248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1043187248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 23:05:35,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L777-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 23:05:35,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:05:35,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1043719303 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1043719303 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1043719303| |ULTIMATE.start_main_#t~ite41_Out-1043719303|))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In-1043719303 |ULTIMATE.start_main_#t~ite41_Out-1043719303|) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1043719303| ~x~0_In-1043719303)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1043719303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043719303, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1043719303, ~x~0=~x~0_In-1043719303} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1043719303|, ~x$w_buff1~0=~x$w_buff1~0_In-1043719303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043719303, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1043719303, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1043719303|, ~x~0=~x~0_In-1043719303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 23:05:35,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In124054626 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In124054626 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out124054626| ~x$w_buff0_used~0_In124054626) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out124054626| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In124054626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In124054626} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In124054626, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out124054626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In124054626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 23:05:35,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-194361416 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-194361416 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-194361416 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-194361416 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-194361416|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-194361416 |ULTIMATE.start_main_#t~ite44_Out-194361416|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-194361416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-194361416, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-194361416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-194361416} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-194361416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-194361416, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-194361416, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-194361416|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-194361416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 23:05:35,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1405106314 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1405106314 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1405106314| ~x$r_buff0_thd0~0_In-1405106314) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1405106314| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1405106314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405106314} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1405106314, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1405106314|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405106314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 23:05:35,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In684669573 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In684669573 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In684669573 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In684669573 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out684669573| 0)) (and (= ~x$r_buff1_thd0~0_In684669573 |ULTIMATE.start_main_#t~ite46_Out684669573|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684669573, ~x$w_buff1_used~0=~x$w_buff1_used~0_In684669573, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In684669573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684669573} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In684669573, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out684669573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In684669573, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In684669573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In684669573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 23:05:35,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_19 |v_ULTIMATE.start_main_#t~ite46_13|) (= 2 v_~z~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, 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-18 23:05:35,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:05:35 BasicIcfg [2019-12-18 23:05:35,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:05:35,650 INFO L168 Benchmark]: Toolchain (without parser) took 77549.83 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 912.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,651 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.11 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.11 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,653 INFO L168 Benchmark]: Boogie Preprocessor took 45.99 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,653 INFO L168 Benchmark]: RCFGBuilder took 789.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 105.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,654 INFO L168 Benchmark]: TraceAbstraction took 75836.12 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 858.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:35,662 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.11 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.11 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.99 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 105.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75836.12 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 858.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 162 ProgramPointsBefore, 85 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 6364 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75290 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L818] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 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, 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=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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, 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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=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=2, z=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=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=2, z=2] [L773] 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) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 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 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4586 SDtfs, 4749 SDslu, 11433 SDs, 0 SdLazy, 7483 SolverSat, 293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 58 SyntacticMatches, 17 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120798occurred 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.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 182243 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 974 NumberOfCodeBlocks, 974 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 895 ConstructedInterpolants, 0 QuantifiedInterpolants, 141810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...