/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:01:05,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:01:05,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:01:06,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:01:06,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:01:06,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:01:06,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:01:06,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:01:06,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:01:06,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:01:06,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:01:06,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:01:06,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:01:06,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:01:06,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:01:06,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:01:06,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:01:06,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:01:06,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:01:06,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:01:06,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:01:06,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:01:06,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:01:06,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:01:06,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:01:06,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:01:06,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:01:06,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:01:06,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:01:06,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:01:06,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:01:06,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:01:06,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:01:06,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:01:06,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:01:06,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:01:06,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:01:06,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:01:06,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:01:06,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:01:06,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:01:06,077 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-NoLbe.epf [2019-12-19 02:01:06,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:01:06,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:01:06,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:01:06,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:01:06,105 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:01:06,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:01:06,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:01:06,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:01:06,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:01:06,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:01:06,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:01:06,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:01:06,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:01:06,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:01:06,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:01:06,107 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:01:06,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:01:06,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:01:06,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:01:06,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:01:06,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:01:06,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:01:06,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:01:06,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:01:06,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:01:06,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:01:06,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:01:06,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:01:06,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:01:06,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:01:06,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:01:06,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:01:06,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:01:06,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:01:06,404 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:01:06,405 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-19 02:01:06,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabca2bfc/0b443073e549483da7b6c008404f41fe/FLAG4bb8ba842 [2019-12-19 02:01:07,030 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:01:07,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-19 02:01:07,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabca2bfc/0b443073e549483da7b6c008404f41fe/FLAG4bb8ba842 [2019-12-19 02:01:07,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabca2bfc/0b443073e549483da7b6c008404f41fe [2019-12-19 02:01:07,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:01:07,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:01:07,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:01:07,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:01:07,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:01:07,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:01:07" (1/1) ... [2019-12-19 02:01:07,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614afbea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:07, skipping insertion in model container [2019-12-19 02:01:07,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:01:07" (1/1) ... [2019-12-19 02:01:07,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:01:07,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:01:07,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:01:08,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:01:08,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:01:08,158 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:01:08,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08 WrapperNode [2019-12-19 02:01:08,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:01:08,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:01:08,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:01:08,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:01:08,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:01:08,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:01:08,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:01:08,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:01:08,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (1/1) ... [2019-12-19 02:01:08,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:01:08,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:01:08,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:01:08,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:01:08,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (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-19 02:01:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:01:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:01:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:01:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:01:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:01:08,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:01:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:01:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:01:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-19 02:01:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-19 02:01:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:01:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:01:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:01:08,342 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:01:09,069 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:01:09,070 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:01:09,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:01:09 BoogieIcfgContainer [2019-12-19 02:01:09,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:01:09,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:01:09,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:01:09,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:01:09,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:01:07" (1/3) ... [2019-12-19 02:01:09,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46996da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:01:09, skipping insertion in model container [2019-12-19 02:01:09,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:01:08" (2/3) ... [2019-12-19 02:01:09,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46996da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:01:09, skipping insertion in model container [2019-12-19 02:01:09,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:01:09" (3/3) ... [2019-12-19 02:01:09,079 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-12-19 02:01:09,089 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:01:09,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:01:09,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:01:09,098 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:01:09,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,175 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,175 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,206 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:01:09,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-19 02:01:09,248 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:01:09,248 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:01:09,248 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:01:09,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:01:09,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:01:09,248 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:01:09,248 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:01:09,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:01:09,261 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 181 transitions [2019-12-19 02:01:26,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111191 states. [2019-12-19 02:01:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 111191 states. [2019-12-19 02:01:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 02:01:26,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:26,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:26,918 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1481943775, now seen corresponding path program 1 times [2019-12-19 02:01:26,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:26,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357290342] [2019-12-19 02:01:26,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:27,229 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-19 02:01:27,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357290342] [2019-12-19 02:01:27,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:27,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:27,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094749386] [2019-12-19 02:01:27,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:27,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:27,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:27,257 INFO L87 Difference]: Start difference. First operand 111191 states. Second operand 4 states. [2019-12-19 02:01:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:28,460 INFO L93 Difference]: Finished difference Result 114119 states and 522355 transitions. [2019-12-19 02:01:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:01:28,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-19 02:01:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:29,014 INFO L225 Difference]: With dead ends: 114119 [2019-12-19 02:01:29,014 INFO L226 Difference]: Without dead ends: 82839 [2019-12-19 02:01:29,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82839 states. [2019-12-19 02:01:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82839 to 82839. [2019-12-19 02:01:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82839 states. [2019-12-19 02:01:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82839 states to 82839 states and 380415 transitions. [2019-12-19 02:01:36,117 INFO L78 Accepts]: Start accepts. Automaton has 82839 states and 380415 transitions. Word has length 50 [2019-12-19 02:01:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:36,119 INFO L462 AbstractCegarLoop]: Abstraction has 82839 states and 380415 transitions. [2019-12-19 02:01:36,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 82839 states and 380415 transitions. [2019-12-19 02:01:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:01:36,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:36,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:36,137 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1380811791, now seen corresponding path program 1 times [2019-12-19 02:01:36,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:36,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620739686] [2019-12-19 02:01:36,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:39,268 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-19 02:01:39,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620739686] [2019-12-19 02:01:39,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:39,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:39,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955087313] [2019-12-19 02:01:39,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:39,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:39,274 INFO L87 Difference]: Start difference. First operand 82839 states and 380415 transitions. Second operand 5 states. [2019-12-19 02:01:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:40,536 INFO L93 Difference]: Finished difference Result 129239 states and 566707 transitions. [2019-12-19 02:01:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:40,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-19 02:01:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:41,665 INFO L225 Difference]: With dead ends: 129239 [2019-12-19 02:01:41,665 INFO L226 Difference]: Without dead ends: 126479 [2019-12-19 02:01:41,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126479 states. [2019-12-19 02:01:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126479 to 119963. [2019-12-19 02:01:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119963 states. [2019-12-19 02:01:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119963 states to 119963 states and 531554 transitions. [2019-12-19 02:01:48,693 INFO L78 Accepts]: Start accepts. Automaton has 119963 states and 531554 transitions. Word has length 58 [2019-12-19 02:01:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:48,693 INFO L462 AbstractCegarLoop]: Abstraction has 119963 states and 531554 transitions. [2019-12-19 02:01:48,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 119963 states and 531554 transitions. [2019-12-19 02:01:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 02:01:48,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:48,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:48,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -447711961, now seen corresponding path program 1 times [2019-12-19 02:01:48,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:48,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801049780] [2019-12-19 02:01:48,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:48,872 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-19 02:01:48,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801049780] [2019-12-19 02:01:48,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:48,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:48,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790056526] [2019-12-19 02:01:48,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:48,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:48,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:48,875 INFO L87 Difference]: Start difference. First operand 119963 states and 531554 transitions. Second operand 5 states. [2019-12-19 02:01:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:54,876 INFO L93 Difference]: Finished difference Result 156375 states and 680703 transitions. [2019-12-19 02:01:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:54,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-19 02:01:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:55,398 INFO L225 Difference]: With dead ends: 156375 [2019-12-19 02:01:55,398 INFO L226 Difference]: Without dead ends: 154135 [2019-12-19 02:01:55,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154135 states. [2019-12-19 02:01:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154135 to 132947. [2019-12-19 02:01:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132947 states. [2019-12-19 02:02:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132947 states to 132947 states and 585328 transitions. [2019-12-19 02:02:00,286 INFO L78 Accepts]: Start accepts. Automaton has 132947 states and 585328 transitions. Word has length 59 [2019-12-19 02:02:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:02:00,287 INFO L462 AbstractCegarLoop]: Abstraction has 132947 states and 585328 transitions. [2019-12-19 02:02:00,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:02:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 132947 states and 585328 transitions. [2019-12-19 02:02:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 02:02:00,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:02:00,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:02:00,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:02:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:02:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -429000659, now seen corresponding path program 1 times [2019-12-19 02:02:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:02:00,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258477293] [2019-12-19 02:02:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:02:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:02:00,386 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-19 02:02:00,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258477293] [2019-12-19 02:02:00,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:02:00,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:02:00,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631243786] [2019-12-19 02:02:00,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:02:00,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:02:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:02:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:02:00,389 INFO L87 Difference]: Start difference. First operand 132947 states and 585328 transitions. Second operand 3 states. [2019-12-19 02:02:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:02:07,083 INFO L93 Difference]: Finished difference Result 171279 states and 741345 transitions. [2019-12-19 02:02:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:02:07,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 02:02:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:02:07,665 INFO L225 Difference]: With dead ends: 171279 [2019-12-19 02:02:07,665 INFO L226 Difference]: Without dead ends: 171279 [2019-12-19 02:02:07,666 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-19 02:02:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171279 states. [2019-12-19 02:02:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171279 to 152003. [2019-12-19 02:02:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152003 states. [2019-12-19 02:02:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152003 states to 152003 states and 663356 transitions. [2019-12-19 02:02:12,601 INFO L78 Accepts]: Start accepts. Automaton has 152003 states and 663356 transitions. Word has length 61 [2019-12-19 02:02:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:02:12,602 INFO L462 AbstractCegarLoop]: Abstraction has 152003 states and 663356 transitions. [2019-12-19 02:02:12,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:02:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 152003 states and 663356 transitions. [2019-12-19 02:02:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:02:12,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:02:12,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:02:12,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:02:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:02:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -246058056, now seen corresponding path program 1 times [2019-12-19 02:02:12,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:02:12,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590955486] [2019-12-19 02:02:12,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:02:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:02:12,730 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-19 02:02:12,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590955486] [2019-12-19 02:02:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:02:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:02:12,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180697479] [2019-12-19 02:02:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:02:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:02:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:02:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:02:12,732 INFO L87 Difference]: Start difference. First operand 152003 states and 663356 transitions. Second operand 6 states. [2019-12-19 02:02:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:02:20,184 INFO L93 Difference]: Finished difference Result 196527 states and 843641 transitions. [2019-12-19 02:02:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:02:20,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 02:02:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:02:20,832 INFO L225 Difference]: With dead ends: 196527 [2019-12-19 02:02:20,833 INFO L226 Difference]: Without dead ends: 193927 [2019-12-19 02:02:20,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:02:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193927 states. [2019-12-19 02:02:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193927 to 153899. [2019-12-19 02:02:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153899 states. [2019-12-19 02:02:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153899 states to 153899 states and 672398 transitions. [2019-12-19 02:02:26,691 INFO L78 Accepts]: Start accepts. Automaton has 153899 states and 672398 transitions. Word has length 65 [2019-12-19 02:02:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:02:26,691 INFO L462 AbstractCegarLoop]: Abstraction has 153899 states and 672398 transitions. [2019-12-19 02:02:26,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:02:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 153899 states and 672398 transitions. [2019-12-19 02:02:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:02:26,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:02:26,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:02:26,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:02:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:02:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 445459117, now seen corresponding path program 1 times [2019-12-19 02:02:26,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:02:26,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292670881] [2019-12-19 02:02:26,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:02:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:02:26,874 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-19 02:02:26,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292670881] [2019-12-19 02:02:26,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:02:26,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:02:26,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437519768] [2019-12-19 02:02:26,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:02:26,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:02:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:02:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:02:26,876 INFO L87 Difference]: Start difference. First operand 153899 states and 672398 transitions. Second operand 6 states. [2019-12-19 02:02:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:02:34,695 INFO L93 Difference]: Finished difference Result 213003 states and 921030 transitions. [2019-12-19 02:02:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:02:34,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 02:02:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:02:35,422 INFO L225 Difference]: With dead ends: 213003 [2019-12-19 02:02:35,422 INFO L226 Difference]: Without dead ends: 209099 [2019-12-19 02:02:35,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:02:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209099 states. [2019-12-19 02:02:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209099 to 196111. [2019-12-19 02:02:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196111 states. [2019-12-19 02:02:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196111 states to 196111 states and 850981 transitions. [2019-12-19 02:02:41,633 INFO L78 Accepts]: Start accepts. Automaton has 196111 states and 850981 transitions. Word has length 65 [2019-12-19 02:02:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:02:41,633 INFO L462 AbstractCegarLoop]: Abstraction has 196111 states and 850981 transitions. [2019-12-19 02:02:41,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:02:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 196111 states and 850981 transitions. [2019-12-19 02:02:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:02:41,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:02:41,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:02:41,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:02:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:02:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1351492242, now seen corresponding path program 1 times [2019-12-19 02:02:41,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:02:41,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595682620] [2019-12-19 02:02:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:02:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:02:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:02:41,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595682620] [2019-12-19 02:02:41,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:02:41,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:02:41,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842467020] [2019-12-19 02:02:41,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:02:41,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:02:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:02:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:02:41,799 INFO L87 Difference]: Start difference. First operand 196111 states and 850981 transitions. Second operand 7 states. [2019-12-19 02:02:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:02:49,986 INFO L93 Difference]: Finished difference Result 284571 states and 1194514 transitions. [2019-12-19 02:02:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:02:49,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 02:02:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:02:50,946 INFO L225 Difference]: With dead ends: 284571 [2019-12-19 02:02:50,946 INFO L226 Difference]: Without dead ends: 284571 [2019-12-19 02:02:50,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:02:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284571 states. [2019-12-19 02:03:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284571 to 232543. [2019-12-19 02:03:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232543 states. [2019-12-19 02:03:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232543 states to 232543 states and 990001 transitions. [2019-12-19 02:03:04,109 INFO L78 Accepts]: Start accepts. Automaton has 232543 states and 990001 transitions. Word has length 65 [2019-12-19 02:03:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:04,110 INFO L462 AbstractCegarLoop]: Abstraction has 232543 states and 990001 transitions. [2019-12-19 02:03:04,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:03:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 232543 states and 990001 transitions. [2019-12-19 02:03:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:03:04,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:04,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:04,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash -463988561, now seen corresponding path program 1 times [2019-12-19 02:03:04,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:04,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198617095] [2019-12-19 02:03:04,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:04,285 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-19 02:03:04,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198617095] [2019-12-19 02:03:04,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:04,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:03:04,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526390886] [2019-12-19 02:03:04,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:03:04,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:03:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:03:04,288 INFO L87 Difference]: Start difference. First operand 232543 states and 990001 transitions. Second operand 4 states. [2019-12-19 02:03:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:11,796 INFO L93 Difference]: Finished difference Result 189770 states and 786511 transitions. [2019-12-19 02:03:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:03:11,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 02:03:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:12,368 INFO L225 Difference]: With dead ends: 189770 [2019-12-19 02:03:12,369 INFO L226 Difference]: Without dead ends: 183774 [2019-12-19 02:03:12,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:03:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183774 states. [2019-12-19 02:03:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183774 to 183774. [2019-12-19 02:03:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183774 states. [2019-12-19 02:03:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183774 states to 183774 states and 765841 transitions. [2019-12-19 02:03:18,159 INFO L78 Accepts]: Start accepts. Automaton has 183774 states and 765841 transitions. Word has length 65 [2019-12-19 02:03:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:18,160 INFO L462 AbstractCegarLoop]: Abstraction has 183774 states and 765841 transitions. [2019-12-19 02:03:18,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:03:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 183774 states and 765841 transitions. [2019-12-19 02:03:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 02:03:18,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:18,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:18,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1777887569, now seen corresponding path program 1 times [2019-12-19 02:03:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:18,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454204512] [2019-12-19 02:03:18,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:18,268 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-19 02:03:18,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454204512] [2019-12-19 02:03:18,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:18,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:03:18,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955754883] [2019-12-19 02:03:18,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:03:18,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:03:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:03:18,270 INFO L87 Difference]: Start difference. First operand 183774 states and 765841 transitions. Second operand 3 states. [2019-12-19 02:03:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:20,275 INFO L93 Difference]: Finished difference Result 139581 states and 577901 transitions. [2019-12-19 02:03:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:03:20,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 02:03:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:20,692 INFO L225 Difference]: With dead ends: 139581 [2019-12-19 02:03:20,692 INFO L226 Difference]: Without dead ends: 138069 [2019-12-19 02:03:20,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:03:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138069 states. [2019-12-19 02:03:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138069 to 133155. [2019-12-19 02:03:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133155 states. [2019-12-19 02:03:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133155 states to 133155 states and 553583 transitions. [2019-12-19 02:03:30,677 INFO L78 Accepts]: Start accepts. Automaton has 133155 states and 553583 transitions. Word has length 66 [2019-12-19 02:03:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:30,677 INFO L462 AbstractCegarLoop]: Abstraction has 133155 states and 553583 transitions. [2019-12-19 02:03:30,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:03:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 133155 states and 553583 transitions. [2019-12-19 02:03:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:03:30,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:30,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:30,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash -356129489, now seen corresponding path program 1 times [2019-12-19 02:03:30,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:30,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079353541] [2019-12-19 02:03:30,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:30,840 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-19 02:03:30,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079353541] [2019-12-19 02:03:30,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:30,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:03:30,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793037313] [2019-12-19 02:03:30,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:03:30,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:03:30,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:03:30,842 INFO L87 Difference]: Start difference. First operand 133155 states and 553583 transitions. Second operand 6 states. [2019-12-19 02:03:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:32,982 INFO L93 Difference]: Finished difference Result 171144 states and 693299 transitions. [2019-12-19 02:03:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:03:32,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 02:03:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:33,494 INFO L225 Difference]: With dead ends: 171144 [2019-12-19 02:03:33,494 INFO L226 Difference]: Without dead ends: 171144 [2019-12-19 02:03:33,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:03:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171144 states. [2019-12-19 02:03:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171144 to 145080. [2019-12-19 02:03:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145080 states. [2019-12-19 02:03:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145080 states to 145080 states and 595922 transitions. [2019-12-19 02:03:43,491 INFO L78 Accepts]: Start accepts. Automaton has 145080 states and 595922 transitions. Word has length 67 [2019-12-19 02:03:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:43,491 INFO L462 AbstractCegarLoop]: Abstraction has 145080 states and 595922 transitions. [2019-12-19 02:03:43,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:03:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 145080 states and 595922 transitions. [2019-12-19 02:03:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:03:43,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:43,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:03:43,520 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash 531374192, now seen corresponding path program 1 times [2019-12-19 02:03:43,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:43,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251035827] [2019-12-19 02:03:43,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:03:43,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251035827] [2019-12-19 02:03:43,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:43,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:03:43,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202868629] [2019-12-19 02:03:43,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:03:43,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:03:43,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:03:43,605 INFO L87 Difference]: Start difference. First operand 145080 states and 595922 transitions. Second operand 5 states. [2019-12-19 02:03:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:43,762 INFO L93 Difference]: Finished difference Result 26547 states and 98280 transitions. [2019-12-19 02:03:43,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:03:43,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 02:03:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:43,804 INFO L225 Difference]: With dead ends: 26547 [2019-12-19 02:03:43,804 INFO L226 Difference]: Without dead ends: 22041 [2019-12-19 02:03:43,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 02:03:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22041 states. [2019-12-19 02:03:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22041 to 21849. [2019-12-19 02:03:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21849 states. [2019-12-19 02:03:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21849 states to 21849 states and 79588 transitions. [2019-12-19 02:03:44,156 INFO L78 Accepts]: Start accepts. Automaton has 21849 states and 79588 transitions. Word has length 67 [2019-12-19 02:03:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:44,156 INFO L462 AbstractCegarLoop]: Abstraction has 21849 states and 79588 transitions. [2019-12-19 02:03:44,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:03:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21849 states and 79588 transitions. [2019-12-19 02:03:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 02:03:44,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:44,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:44,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1222369499, now seen corresponding path program 1 times [2019-12-19 02:03:44,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:44,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415413994] [2019-12-19 02:03:44,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:44,254 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-19 02:03:44,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415413994] [2019-12-19 02:03:44,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:44,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:03:44,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043841982] [2019-12-19 02:03:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:03:44,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:03:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:03:44,256 INFO L87 Difference]: Start difference. First operand 21849 states and 79588 transitions. Second operand 4 states. [2019-12-19 02:03:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:44,503 INFO L93 Difference]: Finished difference Result 25695 states and 92964 transitions. [2019-12-19 02:03:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:03:44,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-19 02:03:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:44,554 INFO L225 Difference]: With dead ends: 25695 [2019-12-19 02:03:44,554 INFO L226 Difference]: Without dead ends: 25695 [2019-12-19 02:03:44,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:03:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25695 states. [2019-12-19 02:03:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25695 to 23607. [2019-12-19 02:03:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2019-12-19 02:03:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 85590 transitions. [2019-12-19 02:03:45,904 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 85590 transitions. Word has length 76 [2019-12-19 02:03:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:45,904 INFO L462 AbstractCegarLoop]: Abstraction has 23607 states and 85590 transitions. [2019-12-19 02:03:45,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:03:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 85590 transitions. [2019-12-19 02:03:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 02:03:45,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:45,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:45,918 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash 520440836, now seen corresponding path program 1 times [2019-12-19 02:03:45,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:45,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975279344] [2019-12-19 02:03:45,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:46,018 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-19 02:03:46,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975279344] [2019-12-19 02:03:46,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:46,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:03:46,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806406690] [2019-12-19 02:03:46,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:03:46,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:46,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:03:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:03:46,021 INFO L87 Difference]: Start difference. First operand 23607 states and 85590 transitions. Second operand 6 states. [2019-12-19 02:03:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:46,455 INFO L93 Difference]: Finished difference Result 30243 states and 108463 transitions. [2019-12-19 02:03:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:03:46,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-19 02:03:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:46,511 INFO L225 Difference]: With dead ends: 30243 [2019-12-19 02:03:46,511 INFO L226 Difference]: Without dead ends: 30063 [2019-12-19 02:03:46,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:03:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30063 states. [2019-12-19 02:03:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30063 to 26285. [2019-12-19 02:03:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26285 states. [2019-12-19 02:03:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26285 states to 26285 states and 94910 transitions. [2019-12-19 02:03:46,958 INFO L78 Accepts]: Start accepts. Automaton has 26285 states and 94910 transitions. Word has length 76 [2019-12-19 02:03:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:46,958 INFO L462 AbstractCegarLoop]: Abstraction has 26285 states and 94910 transitions. [2019-12-19 02:03:46,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:03:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26285 states and 94910 transitions. [2019-12-19 02:03:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:46,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:46,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:46,977 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1316883782, now seen corresponding path program 1 times [2019-12-19 02:03:46,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070205561] [2019-12-19 02:03:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:47,042 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-19 02:03:47,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070205561] [2019-12-19 02:03:47,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:47,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:03:47,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650154109] [2019-12-19 02:03:47,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:03:47,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:47,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:03:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:03:47,045 INFO L87 Difference]: Start difference. First operand 26285 states and 94910 transitions. Second operand 4 states. [2019-12-19 02:03:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:49,039 INFO L93 Difference]: Finished difference Result 34919 states and 124771 transitions. [2019-12-19 02:03:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:03:49,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 02:03:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:49,106 INFO L225 Difference]: With dead ends: 34919 [2019-12-19 02:03:49,107 INFO L226 Difference]: Without dead ends: 34919 [2019-12-19 02:03:49,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:03:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34919 states. [2019-12-19 02:03:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34919 to 29738. [2019-12-19 02:03:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29738 states. [2019-12-19 02:03:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29738 states to 29738 states and 106663 transitions. [2019-12-19 02:03:49,627 INFO L78 Accepts]: Start accepts. Automaton has 29738 states and 106663 transitions. Word has length 80 [2019-12-19 02:03:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:49,628 INFO L462 AbstractCegarLoop]: Abstraction has 29738 states and 106663 transitions. [2019-12-19 02:03:49,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:03:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29738 states and 106663 transitions. [2019-12-19 02:03:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:49,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:49,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:49,652 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1733319033, now seen corresponding path program 1 times [2019-12-19 02:03:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:49,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912883470] [2019-12-19 02:03:49,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:49,742 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-19 02:03:49,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912883470] [2019-12-19 02:03:49,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:49,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:03:49,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734935992] [2019-12-19 02:03:49,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:03:49,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:03:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:03:49,745 INFO L87 Difference]: Start difference. First operand 29738 states and 106663 transitions. Second operand 6 states. [2019-12-19 02:03:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:50,456 INFO L93 Difference]: Finished difference Result 34483 states and 121692 transitions. [2019-12-19 02:03:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:03:50,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 02:03:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:50,526 INFO L225 Difference]: With dead ends: 34483 [2019-12-19 02:03:50,527 INFO L226 Difference]: Without dead ends: 34483 [2019-12-19 02:03:50,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:03:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34483 states. [2019-12-19 02:03:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34483 to 33418. [2019-12-19 02:03:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33418 states. [2019-12-19 02:03:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33418 states to 33418 states and 118241 transitions. [2019-12-19 02:03:51,399 INFO L78 Accepts]: Start accepts. Automaton has 33418 states and 118241 transitions. Word has length 80 [2019-12-19 02:03:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:51,399 INFO L462 AbstractCegarLoop]: Abstraction has 33418 states and 118241 transitions. [2019-12-19 02:03:51,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:03:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 33418 states and 118241 transitions. [2019-12-19 02:03:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:51,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:51,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:51,427 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 484438920, now seen corresponding path program 1 times [2019-12-19 02:03:51,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:51,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508103052] [2019-12-19 02:03:51,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:51,549 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-19 02:03:51,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508103052] [2019-12-19 02:03:51,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:51,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:03:51,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261441827] [2019-12-19 02:03:51,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:03:51,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:03:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:03:51,552 INFO L87 Difference]: Start difference. First operand 33418 states and 118241 transitions. Second operand 6 states. [2019-12-19 02:03:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:52,140 INFO L93 Difference]: Finished difference Result 39886 states and 137569 transitions. [2019-12-19 02:03:52,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:03:52,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 02:03:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:52,212 INFO L225 Difference]: With dead ends: 39886 [2019-12-19 02:03:52,213 INFO L226 Difference]: Without dead ends: 39886 [2019-12-19 02:03:52,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:03:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39886 states. [2019-12-19 02:03:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39886 to 34246. [2019-12-19 02:03:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34246 states. [2019-12-19 02:03:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34246 states to 34246 states and 119107 transitions. [2019-12-19 02:03:52,803 INFO L78 Accepts]: Start accepts. Automaton has 34246 states and 119107 transitions. Word has length 80 [2019-12-19 02:03:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:52,803 INFO L462 AbstractCegarLoop]: Abstraction has 34246 states and 119107 transitions. [2019-12-19 02:03:52,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:03:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 34246 states and 119107 transitions. [2019-12-19 02:03:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:52,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:52,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:52,830 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 695789833, now seen corresponding path program 1 times [2019-12-19 02:03:52,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:52,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003753003] [2019-12-19 02:03:52,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:52,922 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-19 02:03:52,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003753003] [2019-12-19 02:03:52,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:52,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:03:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77145175] [2019-12-19 02:03:52,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:03:52,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:52,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:03:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:03:52,924 INFO L87 Difference]: Start difference. First operand 34246 states and 119107 transitions. Second operand 5 states. [2019-12-19 02:03:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:53,549 INFO L93 Difference]: Finished difference Result 41651 states and 144391 transitions. [2019-12-19 02:03:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:03:53,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 02:03:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:53,641 INFO L225 Difference]: With dead ends: 41651 [2019-12-19 02:03:53,641 INFO L226 Difference]: Without dead ends: 41651 [2019-12-19 02:03:53,641 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-19 02:03:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41651 states. [2019-12-19 02:03:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41651 to 36968. [2019-12-19 02:03:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36968 states. [2019-12-19 02:03:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36968 states to 36968 states and 127710 transitions. [2019-12-19 02:03:54,268 INFO L78 Accepts]: Start accepts. Automaton has 36968 states and 127710 transitions. Word has length 80 [2019-12-19 02:03:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:54,268 INFO L462 AbstractCegarLoop]: Abstraction has 36968 states and 127710 transitions. [2019-12-19 02:03:54,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:03:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36968 states and 127710 transitions. [2019-12-19 02:03:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:54,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:54,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:54,297 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 185255656, now seen corresponding path program 1 times [2019-12-19 02:03:54,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:54,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972243581] [2019-12-19 02:03:54,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:54,357 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-19 02:03:54,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972243581] [2019-12-19 02:03:54,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:54,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:03:54,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439962842] [2019-12-19 02:03:54,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:03:54,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:03:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:03:54,359 INFO L87 Difference]: Start difference. First operand 36968 states and 127710 transitions. Second operand 4 states. [2019-12-19 02:03:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:54,904 INFO L93 Difference]: Finished difference Result 44717 states and 154917 transitions. [2019-12-19 02:03:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:03:54,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 02:03:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:54,985 INFO L225 Difference]: With dead ends: 44717 [2019-12-19 02:03:54,985 INFO L226 Difference]: Without dead ends: 43574 [2019-12-19 02:03:54,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:03:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43574 states. [2019-12-19 02:03:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43574 to 41927. [2019-12-19 02:03:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41927 states. [2019-12-19 02:03:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41927 states to 41927 states and 144888 transitions. [2019-12-19 02:03:56,008 INFO L78 Accepts]: Start accepts. Automaton has 41927 states and 144888 transitions. Word has length 80 [2019-12-19 02:03:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:56,009 INFO L462 AbstractCegarLoop]: Abstraction has 41927 states and 144888 transitions. [2019-12-19 02:03:56,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:03:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 41927 states and 144888 transitions. [2019-12-19 02:03:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:56,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:56,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:56,040 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1611695703, now seen corresponding path program 1 times [2019-12-19 02:03:56,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:56,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877342715] [2019-12-19 02:03:56,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:56,192 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-19 02:03:56,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877342715] [2019-12-19 02:03:56,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:56,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:03:56,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347100166] [2019-12-19 02:03:56,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:03:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:03:56,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:03:56,195 INFO L87 Difference]: Start difference. First operand 41927 states and 144888 transitions. Second operand 7 states. [2019-12-19 02:03:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:57,077 INFO L93 Difference]: Finished difference Result 50830 states and 173172 transitions. [2019-12-19 02:03:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:03:57,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 02:03:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:57,216 INFO L225 Difference]: With dead ends: 50830 [2019-12-19 02:03:57,216 INFO L226 Difference]: Without dead ends: 50830 [2019-12-19 02:03:57,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:03:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50830 states. [2019-12-19 02:03:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50830 to 39793. [2019-12-19 02:03:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39793 states. [2019-12-19 02:03:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39793 states to 39793 states and 135816 transitions. [2019-12-19 02:03:58,345 INFO L78 Accepts]: Start accepts. Automaton has 39793 states and 135816 transitions. Word has length 80 [2019-12-19 02:03:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:58,346 INFO L462 AbstractCegarLoop]: Abstraction has 39793 states and 135816 transitions. [2019-12-19 02:03:58,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:03:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 39793 states and 135816 transitions. [2019-12-19 02:03:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:03:58,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:58,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:03:58,373 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash -724192022, now seen corresponding path program 1 times [2019-12-19 02:03:58,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:58,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831386802] [2019-12-19 02:03:58,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:58,462 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-19 02:03:58,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831386802] [2019-12-19 02:03:58,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:58,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:03:58,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447232554] [2019-12-19 02:03:58,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:03:58,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:03:58,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:03:58,465 INFO L87 Difference]: Start difference. First operand 39793 states and 135816 transitions. Second operand 6 states. [2019-12-19 02:03:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:58,574 INFO L93 Difference]: Finished difference Result 15205 states and 46377 transitions. [2019-12-19 02:03:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:03:58,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 02:03:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:58,593 INFO L225 Difference]: With dead ends: 15205 [2019-12-19 02:03:58,593 INFO L226 Difference]: Without dead ends: 13056 [2019-12-19 02:03:58,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:03:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2019-12-19 02:03:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 12016. [2019-12-19 02:03:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12016 states. [2019-12-19 02:03:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 36483 transitions. [2019-12-19 02:03:58,760 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 36483 transitions. Word has length 80 [2019-12-19 02:03:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:58,760 INFO L462 AbstractCegarLoop]: Abstraction has 12016 states and 36483 transitions. [2019-12-19 02:03:58,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:03:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 36483 transitions. [2019-12-19 02:03:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:03:58,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:58,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:03:58,774 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1499343217, now seen corresponding path program 1 times [2019-12-19 02:03:58,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:58,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821456919] [2019-12-19 02:03:58,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:03:58,885 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-19 02:03:58,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821456919] [2019-12-19 02:03:58,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:03:58,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:03:58,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084041638] [2019-12-19 02:03:58,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:03:58,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:03:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:03:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:03:58,895 INFO L87 Difference]: Start difference. First operand 12016 states and 36483 transitions. Second operand 7 states. [2019-12-19 02:03:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:03:59,654 INFO L93 Difference]: Finished difference Result 14509 states and 43625 transitions. [2019-12-19 02:03:59,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 02:03:59,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:03:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:03:59,687 INFO L225 Difference]: With dead ends: 14509 [2019-12-19 02:03:59,687 INFO L226 Difference]: Without dead ends: 14385 [2019-12-19 02:03:59,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:03:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14385 states. [2019-12-19 02:03:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14385 to 12632. [2019-12-19 02:03:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12632 states. [2019-12-19 02:03:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12632 states to 12632 states and 38237 transitions. [2019-12-19 02:03:59,881 INFO L78 Accepts]: Start accepts. Automaton has 12632 states and 38237 transitions. Word has length 97 [2019-12-19 02:03:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:03:59,881 INFO L462 AbstractCegarLoop]: Abstraction has 12632 states and 38237 transitions. [2019-12-19 02:03:59,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:03:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12632 states and 38237 transitions. [2019-12-19 02:03:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:03:59,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:03:59,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:03:59,895 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:03:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:03:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -577866126, now seen corresponding path program 1 times [2019-12-19 02:03:59,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:03:59,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448448605] [2019-12-19 02:03:59,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:03:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:00,051 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-19 02:04:00,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448448605] [2019-12-19 02:04:00,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:00,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:04:00,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616582335] [2019-12-19 02:04:00,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:04:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:04:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:04:00,056 INFO L87 Difference]: Start difference. First operand 12632 states and 38237 transitions. Second operand 7 states. [2019-12-19 02:04:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:00,413 INFO L93 Difference]: Finished difference Result 20723 states and 62342 transitions. [2019-12-19 02:04:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:04:00,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:04:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:00,442 INFO L225 Difference]: With dead ends: 20723 [2019-12-19 02:04:00,442 INFO L226 Difference]: Without dead ends: 19025 [2019-12-19 02:04:00,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:04:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19025 states. [2019-12-19 02:04:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19025 to 12392. [2019-12-19 02:04:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12392 states. [2019-12-19 02:04:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 37469 transitions. [2019-12-19 02:04:00,638 INFO L78 Accepts]: Start accepts. Automaton has 12392 states and 37469 transitions. Word has length 97 [2019-12-19 02:04:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:00,638 INFO L462 AbstractCegarLoop]: Abstraction has 12392 states and 37469 transitions. [2019-12-19 02:04:00,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:04:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12392 states and 37469 transitions. [2019-12-19 02:04:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:00,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:00,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:00,653 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1737016014, now seen corresponding path program 2 times [2019-12-19 02:04:00,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:00,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227177312] [2019-12-19 02:04:00,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:00,814 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-19 02:04:00,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227177312] [2019-12-19 02:04:00,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:00,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:04:00,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147683568] [2019-12-19 02:04:00,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:04:00,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:00,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:04:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:04:00,816 INFO L87 Difference]: Start difference. First operand 12392 states and 37469 transitions. Second operand 9 states. [2019-12-19 02:04:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:01,408 INFO L93 Difference]: Finished difference Result 32511 states and 98492 transitions. [2019-12-19 02:04:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 02:04:01,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-19 02:04:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:01,443 INFO L225 Difference]: With dead ends: 32511 [2019-12-19 02:04:01,443 INFO L226 Difference]: Without dead ends: 23874 [2019-12-19 02:04:01,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-19 02:04:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23874 states. [2019-12-19 02:04:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23874 to 14205. [2019-12-19 02:04:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14205 states. [2019-12-19 02:04:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14205 states to 14205 states and 42026 transitions. [2019-12-19 02:04:01,696 INFO L78 Accepts]: Start accepts. Automaton has 14205 states and 42026 transitions. Word has length 97 [2019-12-19 02:04:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:01,696 INFO L462 AbstractCegarLoop]: Abstraction has 14205 states and 42026 transitions. [2019-12-19 02:04:01,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:04:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 14205 states and 42026 transitions. [2019-12-19 02:04:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:01,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:01,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:01,713 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1491212102, now seen corresponding path program 3 times [2019-12-19 02:04:01,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:01,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037274236] [2019-12-19 02:04:01,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:01,869 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-19 02:04:01,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037274236] [2019-12-19 02:04:01,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:01,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:04:01,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598702977] [2019-12-19 02:04:01,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:04:01,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:04:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:04:01,872 INFO L87 Difference]: Start difference. First operand 14205 states and 42026 transitions. Second operand 8 states. [2019-12-19 02:04:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:02,104 INFO L93 Difference]: Finished difference Result 22671 states and 67101 transitions. [2019-12-19 02:04:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:04:02,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 02:04:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:02,129 INFO L225 Difference]: With dead ends: 22671 [2019-12-19 02:04:02,129 INFO L226 Difference]: Without dead ends: 12837 [2019-12-19 02:04:02,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:04:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12837 states. [2019-12-19 02:04:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12837 to 12837. [2019-12-19 02:04:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12837 states. [2019-12-19 02:04:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12837 states to 12837 states and 37652 transitions. [2019-12-19 02:04:02,304 INFO L78 Accepts]: Start accepts. Automaton has 12837 states and 37652 transitions. Word has length 97 [2019-12-19 02:04:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:02,304 INFO L462 AbstractCegarLoop]: Abstraction has 12837 states and 37652 transitions. [2019-12-19 02:04:02,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:04:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12837 states and 37652 transitions. [2019-12-19 02:04:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:02,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:02,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:02,320 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 198905834, now seen corresponding path program 4 times [2019-12-19 02:04:02,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:02,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019361622] [2019-12-19 02:04:02,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:02,412 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-19 02:04:02,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019361622] [2019-12-19 02:04:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:04:02,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068302884] [2019-12-19 02:04:02,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:04:02,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:04:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:04:02,414 INFO L87 Difference]: Start difference. First operand 12837 states and 37652 transitions. Second operand 7 states. [2019-12-19 02:04:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:02,581 INFO L93 Difference]: Finished difference Result 19614 states and 57704 transitions. [2019-12-19 02:04:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:04:02,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:04:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:02,595 INFO L225 Difference]: With dead ends: 19614 [2019-12-19 02:04:02,595 INFO L226 Difference]: Without dead ends: 7017 [2019-12-19 02:04:02,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:04:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2019-12-19 02:04:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7017. [2019-12-19 02:04:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7017 states. [2019-12-19 02:04:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7017 states to 7017 states and 20608 transitions. [2019-12-19 02:04:02,687 INFO L78 Accepts]: Start accepts. Automaton has 7017 states and 20608 transitions. Word has length 97 [2019-12-19 02:04:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:02,687 INFO L462 AbstractCegarLoop]: Abstraction has 7017 states and 20608 transitions. [2019-12-19 02:04:02,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:04:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7017 states and 20608 transitions. [2019-12-19 02:04:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:02,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:02,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:02,695 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1595895500, now seen corresponding path program 1 times [2019-12-19 02:04:02,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:02,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571105232] [2019-12-19 02:04:02,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:02,875 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-19 02:04:02,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571105232] [2019-12-19 02:04:02,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:02,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:04:02,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704188331] [2019-12-19 02:04:02,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:04:02,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:04:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:04:02,878 INFO L87 Difference]: Start difference. First operand 7017 states and 20608 transitions. Second operand 5 states. [2019-12-19 02:04:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:03,100 INFO L93 Difference]: Finished difference Result 7914 states and 23063 transitions. [2019-12-19 02:04:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:04:03,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 02:04:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:03,112 INFO L225 Difference]: With dead ends: 7914 [2019-12-19 02:04:03,113 INFO L226 Difference]: Without dead ends: 7848 [2019-12-19 02:04:03,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:04:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2019-12-19 02:04:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7089. [2019-12-19 02:04:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7089 states. [2019-12-19 02:04:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7089 states to 7089 states and 20827 transitions. [2019-12-19 02:04:03,208 INFO L78 Accepts]: Start accepts. Automaton has 7089 states and 20827 transitions. Word has length 97 [2019-12-19 02:04:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:03,209 INFO L462 AbstractCegarLoop]: Abstraction has 7089 states and 20827 transitions. [2019-12-19 02:04:03,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:04:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7089 states and 20827 transitions. [2019-12-19 02:04:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:03,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:03,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:03,217 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1353524780, now seen corresponding path program 1 times [2019-12-19 02:04:03,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:03,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324861455] [2019-12-19 02:04:03,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:03,338 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-19 02:04:03,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324861455] [2019-12-19 02:04:03,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:03,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:04:03,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839181726] [2019-12-19 02:04:03,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:04:03,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:04:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:04:03,340 INFO L87 Difference]: Start difference. First operand 7089 states and 20827 transitions. Second operand 6 states. [2019-12-19 02:04:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:03,765 INFO L93 Difference]: Finished difference Result 7690 states and 22533 transitions. [2019-12-19 02:04:03,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:04:03,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:04:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:03,781 INFO L225 Difference]: With dead ends: 7690 [2019-12-19 02:04:03,781 INFO L226 Difference]: Without dead ends: 7690 [2019-12-19 02:04:03,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:04:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7690 states. [2019-12-19 02:04:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7690 to 6913. [2019-12-19 02:04:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-12-19 02:04:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 20341 transitions. [2019-12-19 02:04:03,979 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 20341 transitions. Word has length 97 [2019-12-19 02:04:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:03,980 INFO L462 AbstractCegarLoop]: Abstraction has 6913 states and 20341 transitions. [2019-12-19 02:04:03,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:04:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 20341 transitions. [2019-12-19 02:04:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:03,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:03,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:03,993 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:03,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash -848906966, now seen corresponding path program 1 times [2019-12-19 02:04:03,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:03,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474920896] [2019-12-19 02:04:03,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:04,149 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-19 02:04:04,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474920896] [2019-12-19 02:04:04,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:04:04,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488241011] [2019-12-19 02:04:04,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:04:04,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:04:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:04:04,151 INFO L87 Difference]: Start difference. First operand 6913 states and 20341 transitions. Second operand 7 states. [2019-12-19 02:04:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:04,436 INFO L93 Difference]: Finished difference Result 7237 states and 21118 transitions. [2019-12-19 02:04:04,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:04:04,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:04:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:04,449 INFO L225 Difference]: With dead ends: 7237 [2019-12-19 02:04:04,449 INFO L226 Difference]: Without dead ends: 7237 [2019-12-19 02:04:04,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:04:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2019-12-19 02:04:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 6943. [2019-12-19 02:04:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6943 states. [2019-12-19 02:04:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 20334 transitions. [2019-12-19 02:04:04,566 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 20334 transitions. Word has length 97 [2019-12-19 02:04:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:04,567 INFO L462 AbstractCegarLoop]: Abstraction has 6943 states and 20334 transitions. [2019-12-19 02:04:04,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:04:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 20334 transitions. [2019-12-19 02:04:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:04,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:04,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:04,575 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash -637556053, now seen corresponding path program 1 times [2019-12-19 02:04:04,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:04,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156307661] [2019-12-19 02:04:04,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:04:04,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156307661] [2019-12-19 02:04:04,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:04,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:04:04,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041561626] [2019-12-19 02:04:04,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:04:04,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:04,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:04:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:04:04,726 INFO L87 Difference]: Start difference. First operand 6943 states and 20334 transitions. Second operand 8 states. [2019-12-19 02:04:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:05,088 INFO L93 Difference]: Finished difference Result 7702 states and 22442 transitions. [2019-12-19 02:04:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:04:05,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 02:04:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:05,100 INFO L225 Difference]: With dead ends: 7702 [2019-12-19 02:04:05,101 INFO L226 Difference]: Without dead ends: 7702 [2019-12-19 02:04:05,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:04:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7702 states. [2019-12-19 02:04:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7702 to 6970. [2019-12-19 02:04:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states. [2019-12-19 02:04:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 20391 transitions. [2019-12-19 02:04:05,194 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 20391 transitions. Word has length 97 [2019-12-19 02:04:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:05,194 INFO L462 AbstractCegarLoop]: Abstraction has 6970 states and 20391 transitions. [2019-12-19 02:04:05,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:04:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 20391 transitions. [2019-12-19 02:04:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:05,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:05,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:05,202 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 249947628, now seen corresponding path program 5 times [2019-12-19 02:04:05,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:05,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440429272] [2019-12-19 02:04:05,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:04:05,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-19 02:04:05,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440429272] [2019-12-19 02:04:05,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:04:05,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:04:05,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350531784] [2019-12-19 02:04:05,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:04:05,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:04:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:04:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:04:05,338 INFO L87 Difference]: Start difference. First operand 6970 states and 20391 transitions. Second operand 10 states. [2019-12-19 02:04:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:04:05,694 INFO L93 Difference]: Finished difference Result 11677 states and 34167 transitions. [2019-12-19 02:04:05,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:04:05,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-19 02:04:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:04:05,709 INFO L225 Difference]: With dead ends: 11677 [2019-12-19 02:04:05,709 INFO L226 Difference]: Without dead ends: 7597 [2019-12-19 02:04:05,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:04:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2019-12-19 02:04:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 6907. [2019-12-19 02:04:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6907 states. [2019-12-19 02:04:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 20223 transitions. [2019-12-19 02:04:05,848 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 20223 transitions. Word has length 97 [2019-12-19 02:04:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:04:05,849 INFO L462 AbstractCegarLoop]: Abstraction has 6907 states and 20223 transitions. [2019-12-19 02:04:05,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:04:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 20223 transitions. [2019-12-19 02:04:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:04:05,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:04:05,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:04:05,860 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:04:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:04:05,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1668225924, now seen corresponding path program 6 times [2019-12-19 02:04:05,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:04:05,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260071697] [2019-12-19 02:04:05,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:04:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:04:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:04:05,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:04:05,963 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:04:06,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:04:06 BasicIcfg [2019-12-19 02:04:06,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:04:06,160 INFO L168 Benchmark]: Toolchain (without parser) took 178826.12 ms. Allocated memory was 145.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,164 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.73 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,167 INFO L168 Benchmark]: Boogie Preprocessor took 47.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,168 INFO L168 Benchmark]: RCFGBuilder took 795.41 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 106.5 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,168 INFO L168 Benchmark]: TraceAbstraction took 177085.20 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 106.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 02:04:06,172 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.38 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.73 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.41 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 106.5 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 177085.20 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 106.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L705] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L707] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L709] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t852; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t853; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t854; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$w_buff1 = z$w_buff0 [L789] 3 z$w_buff0 = 1 [L790] 3 z$w_buff1_used = z$w_buff0_used [L791] 3 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 [L742] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z = z$flush_delayed ? z$mem_tmp : z [L776] 2 z$flush_delayed = (_Bool)0 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 176.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 67.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8476 SDtfs, 10189 SDslu, 22901 SDs, 0 SdLazy, 6083 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 75 SyntacticMatches, 18 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232543occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 83.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 240660 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2467 NumberOfCodeBlocks, 2467 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2340 ConstructedInterpolants, 0 QuantifiedInterpolants, 572085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...