/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:23:52,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:23:52,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:23:52,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:23:52,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:23:52,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:23:52,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:23:52,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:23:52,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:23:52,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:23:52,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:23:52,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:23:52,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:23:52,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:23:52,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:23:52,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:23:52,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:23:52,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:23:52,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:23:52,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:23:52,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:23:52,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:23:52,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:23:52,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:23:52,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:23:52,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:23:52,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:23:52,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:23:52,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:23:52,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:23:52,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:23:52,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:23:52,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:23:52,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:23:52,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:23:52,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:23:52,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:23:52,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:23:52,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:23:52,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:23:52,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:23:52,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:23:52,241 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:23:52,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:23:52,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:23:52,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:23:52,243 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:23:52,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:23:52,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:23:52,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:23:52,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:23:52,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:23:52,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:23:52,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:23:52,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:23:52,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:23:52,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:23:52,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:23:52,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:23:52,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:23:52,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:23:52,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:23:52,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:23:52,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:23:52,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:23:52,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:23:52,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:23:52,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:23:52,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:23:52,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:23:52,248 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:23:52,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:23:52,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:23:52,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:23:52,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:23:52,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:23:52,551 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:23:52,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-26 22:23:52,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0c39f9/134e517608374e7a991496ee6cad30cc/FLAGa8047143e [2019-12-26 22:23:53,196 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:23:53,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-26 22:23:53,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0c39f9/134e517608374e7a991496ee6cad30cc/FLAGa8047143e [2019-12-26 22:23:53,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0c39f9/134e517608374e7a991496ee6cad30cc [2019-12-26 22:23:53,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:23:53,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:23:53,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:53,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:23:53,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:23:53,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:53" (1/1) ... [2019-12-26 22:23:53,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c41393e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:53, skipping insertion in model container [2019-12-26 22:23:53,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:53" (1/1) ... [2019-12-26 22:23:53,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:23:53,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:23:54,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:54,227 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:23:54,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:54,421 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:23:54,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54 WrapperNode [2019-12-26 22:23:54,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:54,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:54,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:23:54,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:23:54,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:54,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:23:54,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:23:54,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:23:54,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (1/1) ... [2019-12-26 22:23:54,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:23:54,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:23:54,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:23:54,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:23:54,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (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-26 22:23:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:23:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:23:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:23:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:23:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:23:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:23:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:23:54,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:23:54,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:23:54,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:23:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:23:54,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:23:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:23:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:23:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:23:54,657 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:23:55,402 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:23:55,403 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:23:55,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:55 BoogieIcfgContainer [2019-12-26 22:23:55,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:23:55,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:23:55,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:23:55,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:23:55,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:23:53" (1/3) ... [2019-12-26 22:23:55,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140c43a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:55, skipping insertion in model container [2019-12-26 22:23:55,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:54" (2/3) ... [2019-12-26 22:23:55,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140c43a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:55, skipping insertion in model container [2019-12-26 22:23:55,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:55" (3/3) ... [2019-12-26 22:23:55,413 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i [2019-12-26 22:23:55,425 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:23:55,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:23:55,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:23:55,435 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:23:55,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,484 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,484 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,556 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,556 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,567 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:55,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:23:55,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:23:55,621 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:23:55,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:23:55,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:23:55,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:23:55,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:23:55,622 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:23:55,622 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:23:55,639 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-26 22:23:55,641 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-26 22:23:55,780 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-26 22:23:55,780 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:55,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:23:55,832 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-26 22:23:55,891 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-26 22:23:55,892 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:55,901 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:23:55,927 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-26 22:23:55,928 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:24:01,814 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 22:24:02,242 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-26 22:24:02,393 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-26 22:24:02,414 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74129 [2019-12-26 22:24:02,414 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 22:24:02,418 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-26 22:24:34,574 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-26 22:24:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-26 22:24:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:24:34,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:34,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:34,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash -74872892, now seen corresponding path program 1 times [2019-12-26 22:24:34,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:34,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92040992] [2019-12-26 22:24:34,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:34,861 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-26 22:24:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92040992] [2019-12-26 22:24:34,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:34,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:24:34,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077307424] [2019-12-26 22:24:34,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:34,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:34,886 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-26 22:24:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:39,960 INFO L93 Difference]: Finished difference Result 158186 states and 763682 transitions. [2019-12-26 22:24:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:39,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:24:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:41,048 INFO L225 Difference]: With dead ends: 158186 [2019-12-26 22:24:41,048 INFO L226 Difference]: Without dead ends: 149138 [2019-12-26 22:24:41,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149138 states. [2019-12-26 22:24:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149138 to 149138. [2019-12-26 22:24:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149138 states. [2019-12-26 22:24:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149138 states to 149138 states and 719092 transitions. [2019-12-26 22:24:56,922 INFO L78 Accepts]: Start accepts. Automaton has 149138 states and 719092 transitions. Word has length 7 [2019-12-26 22:24:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:56,923 INFO L462 AbstractCegarLoop]: Abstraction has 149138 states and 719092 transitions. [2019-12-26 22:24:56,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 149138 states and 719092 transitions. [2019-12-26 22:24:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:24:56,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:56,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:56,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 117436716, now seen corresponding path program 1 times [2019-12-26 22:24:56,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:56,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590757100] [2019-12-26 22:24:56,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:57,011 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-26 22:24:57,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590757100] [2019-12-26 22:24:57,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:57,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:57,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432944261] [2019-12-26 22:24:57,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:57,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:57,016 INFO L87 Difference]: Start difference. First operand 149138 states and 719092 transitions. Second operand 3 states. [2019-12-26 22:24:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:57,586 INFO L93 Difference]: Finished difference Result 94514 states and 411493 transitions. [2019-12-26 22:24:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:57,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:24:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:57,893 INFO L225 Difference]: With dead ends: 94514 [2019-12-26 22:24:57,894 INFO L226 Difference]: Without dead ends: 94514 [2019-12-26 22:24:57,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94514 states. [2019-12-26 22:25:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94514 to 94514. [2019-12-26 22:25:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94514 states. [2019-12-26 22:25:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94514 states to 94514 states and 411493 transitions. [2019-12-26 22:25:08,415 INFO L78 Accepts]: Start accepts. Automaton has 94514 states and 411493 transitions. Word has length 15 [2019-12-26 22:25:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:08,416 INFO L462 AbstractCegarLoop]: Abstraction has 94514 states and 411493 transitions. [2019-12-26 22:25:08,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:25:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94514 states and 411493 transitions. [2019-12-26 22:25:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:25:08,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:08,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:08,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 860387736, now seen corresponding path program 1 times [2019-12-26 22:25:08,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:08,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293284589] [2019-12-26 22:25:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:08,555 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-26 22:25:08,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293284589] [2019-12-26 22:25:08,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505491016] [2019-12-26 22:25:08,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:08,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:08,558 INFO L87 Difference]: Start difference. First operand 94514 states and 411493 transitions. Second operand 4 states. [2019-12-26 22:25:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:10,368 INFO L93 Difference]: Finished difference Result 147815 states and 617388 transitions. [2019-12-26 22:25:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:10,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:25:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:10,963 INFO L225 Difference]: With dead ends: 147815 [2019-12-26 22:25:10,963 INFO L226 Difference]: Without dead ends: 147703 [2019-12-26 22:25:10,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147703 states. [2019-12-26 22:25:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147703 to 135599. [2019-12-26 22:25:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135599 states. [2019-12-26 22:25:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135599 states to 135599 states and 571971 transitions. [2019-12-26 22:25:23,946 INFO L78 Accepts]: Start accepts. Automaton has 135599 states and 571971 transitions. Word has length 15 [2019-12-26 22:25:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:23,946 INFO L462 AbstractCegarLoop]: Abstraction has 135599 states and 571971 transitions. [2019-12-26 22:25:23,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 135599 states and 571971 transitions. [2019-12-26 22:25:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:23,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:23,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:23,951 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1758547198, now seen corresponding path program 1 times [2019-12-26 22:25:23,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:23,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976628154] [2019-12-26 22:25:23,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:24,028 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-26 22:25:24,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976628154] [2019-12-26 22:25:24,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:24,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:24,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259240402] [2019-12-26 22:25:24,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:24,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:24,031 INFO L87 Difference]: Start difference. First operand 135599 states and 571971 transitions. Second operand 4 states. [2019-12-26 22:25:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:24,205 INFO L93 Difference]: Finished difference Result 37047 states and 132608 transitions. [2019-12-26 22:25:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:24,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:24,278 INFO L225 Difference]: With dead ends: 37047 [2019-12-26 22:25:24,279 INFO L226 Difference]: Without dead ends: 37047 [2019-12-26 22:25:24,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2019-12-26 22:25:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 37047. [2019-12-26 22:25:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37047 states. [2019-12-26 22:25:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37047 states to 37047 states and 132608 transitions. [2019-12-26 22:25:25,991 INFO L78 Accepts]: Start accepts. Automaton has 37047 states and 132608 transitions. Word has length 16 [2019-12-26 22:25:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:25,992 INFO L462 AbstractCegarLoop]: Abstraction has 37047 states and 132608 transitions. [2019-12-26 22:25:25,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37047 states and 132608 transitions. [2019-12-26 22:25:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:25,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:25,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:25,996 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash -293201311, now seen corresponding path program 1 times [2019-12-26 22:25:25,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:25,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090961502] [2019-12-26 22:25:25,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:26,087 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-26 22:25:26,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090961502] [2019-12-26 22:25:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:26,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:26,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029382172] [2019-12-26 22:25:26,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:26,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:26,089 INFO L87 Difference]: Start difference. First operand 37047 states and 132608 transitions. Second operand 4 states. [2019-12-26 22:25:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:26,505 INFO L93 Difference]: Finished difference Result 48238 states and 170644 transitions. [2019-12-26 22:25:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:26,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:26,639 INFO L225 Difference]: With dead ends: 48238 [2019-12-26 22:25:26,639 INFO L226 Difference]: Without dead ends: 48227 [2019-12-26 22:25:26,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2019-12-26 22:25:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 42563. [2019-12-26 22:25:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42563 states. [2019-12-26 22:25:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42563 states to 42563 states and 151744 transitions. [2019-12-26 22:25:27,471 INFO L78 Accepts]: Start accepts. Automaton has 42563 states and 151744 transitions. Word has length 16 [2019-12-26 22:25:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:27,471 INFO L462 AbstractCegarLoop]: Abstraction has 42563 states and 151744 transitions. [2019-12-26 22:25:27,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42563 states and 151744 transitions. [2019-12-26 22:25:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:25:27,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:27,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:27,474 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -293081279, now seen corresponding path program 1 times [2019-12-26 22:25:27,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:27,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773770749] [2019-12-26 22:25:27,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:27,572 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-26 22:25:27,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773770749] [2019-12-26 22:25:27,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:27,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:27,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485312963] [2019-12-26 22:25:27,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:27,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:27,575 INFO L87 Difference]: Start difference. First operand 42563 states and 151744 transitions. Second operand 4 states. [2019-12-26 22:25:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:30,183 INFO L93 Difference]: Finished difference Result 52709 states and 186086 transitions. [2019-12-26 22:25:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:30,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:25:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:30,294 INFO L225 Difference]: With dead ends: 52709 [2019-12-26 22:25:30,295 INFO L226 Difference]: Without dead ends: 52698 [2019-12-26 22:25:30,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52698 states. [2019-12-26 22:25:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52698 to 42470. [2019-12-26 22:25:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-12-26 22:25:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 151203 transitions. [2019-12-26 22:25:31,157 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 151203 transitions. Word has length 16 [2019-12-26 22:25:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:31,157 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 151203 transitions. [2019-12-26 22:25:31,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 151203 transitions. [2019-12-26 22:25:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:25:31,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:31,174 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] [2019-12-26 22:25:31,174 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash 127408811, now seen corresponding path program 1 times [2019-12-26 22:25:31,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:31,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404476019] [2019-12-26 22:25:31,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:31,257 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-26 22:25:31,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404476019] [2019-12-26 22:25:31,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:31,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:31,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927340958] [2019-12-26 22:25:31,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:31,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:31,260 INFO L87 Difference]: Start difference. First operand 42470 states and 151203 transitions. Second operand 5 states. [2019-12-26 22:25:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:32,312 INFO L93 Difference]: Finished difference Result 61996 states and 217115 transitions. [2019-12-26 22:25:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:25:32,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:25:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:32,473 INFO L225 Difference]: With dead ends: 61996 [2019-12-26 22:25:32,474 INFO L226 Difference]: Without dead ends: 61973 [2019-12-26 22:25:32,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61973 states. [2019-12-26 22:25:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61973 to 45286. [2019-12-26 22:25:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45286 states. [2019-12-26 22:25:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 161233 transitions. [2019-12-26 22:25:33,468 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 161233 transitions. Word has length 24 [2019-12-26 22:25:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 45286 states and 161233 transitions. [2019-12-26 22:25:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 161233 transitions. [2019-12-26 22:25:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:25:33,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:33,482 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] [2019-12-26 22:25:33,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 127528843, now seen corresponding path program 1 times [2019-12-26 22:25:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:33,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155795761] [2019-12-26 22:25:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:33,569 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-26 22:25:33,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155795761] [2019-12-26 22:25:33,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:33,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:33,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253913258] [2019-12-26 22:25:33,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:33,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:33,571 INFO L87 Difference]: Start difference. First operand 45286 states and 161233 transitions. Second operand 5 states. [2019-12-26 22:25:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:34,653 INFO L93 Difference]: Finished difference Result 63893 states and 223312 transitions. [2019-12-26 22:25:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:25:34,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:25:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:34,817 INFO L225 Difference]: With dead ends: 63893 [2019-12-26 22:25:34,817 INFO L226 Difference]: Without dead ends: 63870 [2019-12-26 22:25:34,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-26 22:25:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 41796. [2019-12-26 22:25:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-26 22:25:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 148592 transitions. [2019-12-26 22:25:35,775 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 148592 transitions. Word has length 24 [2019-12-26 22:25:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:35,776 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 148592 transitions. [2019-12-26 22:25:35,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 148592 transitions. [2019-12-26 22:25:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:25:35,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:35,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:35,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2134071175, now seen corresponding path program 1 times [2019-12-26 22:25:35,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:35,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047542782] [2019-12-26 22:25:35,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:35,854 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-26 22:25:35,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047542782] [2019-12-26 22:25:35,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:35,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:25:35,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251688162] [2019-12-26 22:25:35,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:25:35,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:25:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:35,856 INFO L87 Difference]: Start difference. First operand 41796 states and 148592 transitions. Second operand 5 states. [2019-12-26 22:25:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:36,194 INFO L93 Difference]: Finished difference Result 21524 states and 77465 transitions. [2019-12-26 22:25:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:25:36,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:25:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:36,257 INFO L225 Difference]: With dead ends: 21524 [2019-12-26 22:25:36,258 INFO L226 Difference]: Without dead ends: 21524 [2019-12-26 22:25:36,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21524 states. [2019-12-26 22:25:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21524 to 21220. [2019-12-26 22:25:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-26 22:25:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 76433 transitions. [2019-12-26 22:25:36,663 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 76433 transitions. Word has length 28 [2019-12-26 22:25:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:36,664 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 76433 transitions. [2019-12-26 22:25:36,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:25:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 76433 transitions. [2019-12-26 22:25:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:36,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:36,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:36,703 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash -16126003, now seen corresponding path program 1 times [2019-12-26 22:25:36,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:36,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809354243] [2019-12-26 22:25:36,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:36,781 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-26 22:25:36,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809354243] [2019-12-26 22:25:36,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:36,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:36,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034147765] [2019-12-26 22:25:36,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:36,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:36,783 INFO L87 Difference]: Start difference. First operand 21220 states and 76433 transitions. Second operand 4 states. [2019-12-26 22:25:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:36,960 INFO L93 Difference]: Finished difference Result 34004 states and 122814 transitions. [2019-12-26 22:25:36,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:36,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-26 22:25:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:36,996 INFO L225 Difference]: With dead ends: 34004 [2019-12-26 22:25:36,996 INFO L226 Difference]: Without dead ends: 18095 [2019-12-26 22:25:36,997 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-26 22:25:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-26 22:25:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17989. [2019-12-26 22:25:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17989 states. [2019-12-26 22:25:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17989 states to 17989 states and 64168 transitions. [2019-12-26 22:25:37,329 INFO L78 Accepts]: Start accepts. Automaton has 17989 states and 64168 transitions. Word has length 42 [2019-12-26 22:25:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:37,329 INFO L462 AbstractCegarLoop]: Abstraction has 17989 states and 64168 transitions. [2019-12-26 22:25:37,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 17989 states and 64168 transitions. [2019-12-26 22:25:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:37,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:37,360 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] [2019-12-26 22:25:37,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash 932410289, now seen corresponding path program 2 times [2019-12-26 22:25:37,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:37,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762139580] [2019-12-26 22:25:37,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:37,423 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-26 22:25:37,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762139580] [2019-12-26 22:25:37,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:37,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:37,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964663263] [2019-12-26 22:25:37,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:37,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:37,425 INFO L87 Difference]: Start difference. First operand 17989 states and 64168 transitions. Second operand 4 states. [2019-12-26 22:25:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:37,551 INFO L93 Difference]: Finished difference Result 25858 states and 88081 transitions. [2019-12-26 22:25:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:37,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-26 22:25:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:37,586 INFO L225 Difference]: With dead ends: 25858 [2019-12-26 22:25:37,586 INFO L226 Difference]: Without dead ends: 18303 [2019-12-26 22:25:37,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-26 22:25:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 18207. [2019-12-26 22:25:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-26 22:25:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 64042 transitions. [2019-12-26 22:25:38,048 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 64042 transitions. Word has length 42 [2019-12-26 22:25:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:38,048 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 64042 transitions. [2019-12-26 22:25:38,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 64042 transitions. [2019-12-26 22:25:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 22:25:38,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:38,074 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] [2019-12-26 22:25:38,074 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 10474927, now seen corresponding path program 3 times [2019-12-26 22:25:38,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:38,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248341008] [2019-12-26 22:25:38,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:38,141 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-26 22:25:38,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248341008] [2019-12-26 22:25:38,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:38,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:25:38,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864155845] [2019-12-26 22:25:38,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:25:38,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:25:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:25:38,144 INFO L87 Difference]: Start difference. First operand 18207 states and 64042 transitions. Second operand 6 states. [2019-12-26 22:25:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:38,313 INFO L93 Difference]: Finished difference Result 16970 states and 60901 transitions. [2019-12-26 22:25:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:25:38,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 22:25:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:38,349 INFO L225 Difference]: With dead ends: 16970 [2019-12-26 22:25:38,349 INFO L226 Difference]: Without dead ends: 13359 [2019-12-26 22:25:38,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:25:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13359 states. [2019-12-26 22:25:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13359 to 12959. [2019-12-26 22:25:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12959 states. [2019-12-26 22:25:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 47493 transitions. [2019-12-26 22:25:38,653 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 47493 transitions. Word has length 42 [2019-12-26 22:25:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:38,654 INFO L462 AbstractCegarLoop]: Abstraction has 12959 states and 47493 transitions. [2019-12-26 22:25:38,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:25:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 47493 transitions. [2019-12-26 22:25:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:38,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:38,672 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] [2019-12-26 22:25:38,673 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -888538317, now seen corresponding path program 1 times [2019-12-26 22:25:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:38,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113538746] [2019-12-26 22:25:38,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:38,752 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-26 22:25:38,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113538746] [2019-12-26 22:25:38,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:38,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:25:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717286867] [2019-12-26 22:25:38,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:25:38,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:25:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:25:38,754 INFO L87 Difference]: Start difference. First operand 12959 states and 47493 transitions. Second operand 4 states. [2019-12-26 22:25:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:38,852 INFO L93 Difference]: Finished difference Result 16679 states and 59939 transitions. [2019-12-26 22:25:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:25:38,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-26 22:25:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:38,861 INFO L225 Difference]: With dead ends: 16679 [2019-12-26 22:25:38,861 INFO L226 Difference]: Without dead ends: 4031 [2019-12-26 22:25:38,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:25:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-12-26 22:25:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-12-26 22:25:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-26 22:25:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13323 transitions. [2019-12-26 22:25:38,951 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13323 transitions. Word has length 57 [2019-12-26 22:25:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:38,951 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13323 transitions. [2019-12-26 22:25:38,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:25:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13323 transitions. [2019-12-26 22:25:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:38,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:38,956 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] [2019-12-26 22:25:38,956 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1824422047, now seen corresponding path program 2 times [2019-12-26 22:25:38,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:38,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695692007] [2019-12-26 22:25:38,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:39,041 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-26 22:25:39,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695692007] [2019-12-26 22:25:39,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:39,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:25:39,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172293690] [2019-12-26 22:25:39,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:25:39,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:39,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:25:39,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:25:39,043 INFO L87 Difference]: Start difference. First operand 4031 states and 13323 transitions. Second operand 7 states. [2019-12-26 22:25:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:39,298 INFO L93 Difference]: Finished difference Result 8074 states and 26146 transitions. [2019-12-26 22:25:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:25:39,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:25:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:39,310 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 22:25:39,310 INFO L226 Difference]: Without dead ends: 5854 [2019-12-26 22:25:39,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:25:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-26 22:25:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5208. [2019-12-26 22:25:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-12-26 22:25:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 17102 transitions. [2019-12-26 22:25:39,445 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 17102 transitions. Word has length 57 [2019-12-26 22:25:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:39,445 INFO L462 AbstractCegarLoop]: Abstraction has 5208 states and 17102 transitions. [2019-12-26 22:25:39,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:25:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 17102 transitions. [2019-12-26 22:25:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:39,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:39,455 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] [2019-12-26 22:25:39,455 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1398547123, now seen corresponding path program 3 times [2019-12-26 22:25:39,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:39,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664044893] [2019-12-26 22:25:39,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:25:39,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664044893] [2019-12-26 22:25:39,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:39,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:25:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284539909] [2019-12-26 22:25:39,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:25:39,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:25:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:25:39,560 INFO L87 Difference]: Start difference. First operand 5208 states and 17102 transitions. Second operand 7 states. [2019-12-26 22:25:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:39,820 INFO L93 Difference]: Finished difference Result 9670 states and 31030 transitions. [2019-12-26 22:25:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:25:39,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:25:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:39,836 INFO L225 Difference]: With dead ends: 9670 [2019-12-26 22:25:39,837 INFO L226 Difference]: Without dead ends: 7088 [2019-12-26 22:25:39,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:25:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-26 22:25:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6224. [2019-12-26 22:25:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-12-26 22:25:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 20237 transitions. [2019-12-26 22:25:39,958 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 20237 transitions. Word has length 57 [2019-12-26 22:25:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:39,958 INFO L462 AbstractCegarLoop]: Abstraction has 6224 states and 20237 transitions. [2019-12-26 22:25:39,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:25:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 20237 transitions. [2019-12-26 22:25:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:39,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:39,967 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] [2019-12-26 22:25:39,967 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash -182184551, now seen corresponding path program 4 times [2019-12-26 22:25:39,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:39,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222507573] [2019-12-26 22:25:39,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:40,095 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-26 22:25:40,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222507573] [2019-12-26 22:25:40,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:40,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:40,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138270863] [2019-12-26 22:25:40,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:25:40,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:25:40,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:40,099 INFO L87 Difference]: Start difference. First operand 6224 states and 20237 transitions. Second operand 9 states. [2019-12-26 22:25:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:42,060 INFO L93 Difference]: Finished difference Result 45824 states and 151598 transitions. [2019-12-26 22:25:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 22:25:42,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 22:25:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:42,148 INFO L225 Difference]: With dead ends: 45824 [2019-12-26 22:25:42,149 INFO L226 Difference]: Without dead ends: 36272 [2019-12-26 22:25:42,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 22:25:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36272 states. [2019-12-26 22:25:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36272 to 8997. [2019-12-26 22:25:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2019-12-26 22:25:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 29720 transitions. [2019-12-26 22:25:42,574 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 29720 transitions. Word has length 57 [2019-12-26 22:25:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:42,575 INFO L462 AbstractCegarLoop]: Abstraction has 8997 states and 29720 transitions. [2019-12-26 22:25:42,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:25:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 29720 transitions. [2019-12-26 22:25:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:42,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:42,586 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] [2019-12-26 22:25:42,586 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1662360063, now seen corresponding path program 5 times [2019-12-26 22:25:42,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:42,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092194864] [2019-12-26 22:25:42,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:42,701 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-26 22:25:42,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092194864] [2019-12-26 22:25:42,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:42,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:42,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204554471] [2019-12-26 22:25:42,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:25:42,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:42,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:25:42,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:25:42,704 INFO L87 Difference]: Start difference. First operand 8997 states and 29720 transitions. Second operand 9 states. [2019-12-26 22:25:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:44,217 INFO L93 Difference]: Finished difference Result 41251 states and 134371 transitions. [2019-12-26 22:25:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 22:25:44,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 22:25:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:44,275 INFO L225 Difference]: With dead ends: 41251 [2019-12-26 22:25:44,276 INFO L226 Difference]: Without dead ends: 33787 [2019-12-26 22:25:44,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 22:25:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33787 states. [2019-12-26 22:25:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33787 to 9093. [2019-12-26 22:25:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-12-26 22:25:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 30186 transitions. [2019-12-26 22:25:44,742 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 30186 transitions. Word has length 57 [2019-12-26 22:25:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 9093 states and 30186 transitions. [2019-12-26 22:25:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:25:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 30186 transitions. [2019-12-26 22:25:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:25:44,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:44,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:25:44,754 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:44,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:44,754 INFO L82 PathProgramCache]: Analyzing trace with hash 955367681, now seen corresponding path program 6 times [2019-12-26 22:25:44,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:44,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246110681] [2019-12-26 22:25:44,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:44,866 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-26 22:25:44,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246110681] [2019-12-26 22:25:44,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:44,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:44,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907958584] [2019-12-26 22:25:44,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:25:44,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:25:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:44,868 INFO L87 Difference]: Start difference. First operand 9093 states and 30186 transitions. Second operand 3 states. [2019-12-26 22:25:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:44,923 INFO L93 Difference]: Finished difference Result 9091 states and 30181 transitions. [2019-12-26 22:25:44,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:25:44,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 22:25:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:44,941 INFO L225 Difference]: With dead ends: 9091 [2019-12-26 22:25:44,942 INFO L226 Difference]: Without dead ends: 9091 [2019-12-26 22:25:44,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2019-12-26 22:25:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9091. [2019-12-26 22:25:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2019-12-26 22:25:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 30181 transitions. [2019-12-26 22:25:45,202 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 30181 transitions. Word has length 57 [2019-12-26 22:25:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:45,202 INFO L462 AbstractCegarLoop]: Abstraction has 9091 states and 30181 transitions. [2019-12-26 22:25:45,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:25:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 30181 transitions. [2019-12-26 22:25:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:25:45,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:45,218 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-26 22:25:45,218 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2044839876, now seen corresponding path program 1 times [2019-12-26 22:25:45,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:45,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863698879] [2019-12-26 22:25:45,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:45,327 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-26 22:25:45,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863698879] [2019-12-26 22:25:45,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:45,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:25:45,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227782745] [2019-12-26 22:25:45,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:25:45,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:25:45,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:45,329 INFO L87 Difference]: Start difference. First operand 9091 states and 30181 transitions. Second operand 3 states. [2019-12-26 22:25:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:45,378 INFO L93 Difference]: Finished difference Result 8322 states and 26789 transitions. [2019-12-26 22:25:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:25:45,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:25:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:45,395 INFO L225 Difference]: With dead ends: 8322 [2019-12-26 22:25:45,395 INFO L226 Difference]: Without dead ends: 8322 [2019-12-26 22:25:45,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:25:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-26 22:25:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 7922. [2019-12-26 22:25:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2019-12-26 22:25:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 25358 transitions. [2019-12-26 22:25:45,590 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 25358 transitions. Word has length 58 [2019-12-26 22:25:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:45,591 INFO L462 AbstractCegarLoop]: Abstraction has 7922 states and 25358 transitions. [2019-12-26 22:25:45,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:25:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 25358 transitions. [2019-12-26 22:25:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:45,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:45,604 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-26 22:25:45,604 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1949196794, now seen corresponding path program 1 times [2019-12-26 22:25:45,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:45,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104315495] [2019-12-26 22:25:45,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:45,800 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-26 22:25:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104315495] [2019-12-26 22:25:45,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:45,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485600782] [2019-12-26 22:25:45,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:25:45,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:45,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:25:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:25:45,802 INFO L87 Difference]: Start difference. First operand 7922 states and 25358 transitions. Second operand 10 states. [2019-12-26 22:25:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:46,957 INFO L93 Difference]: Finished difference Result 13172 states and 41555 transitions. [2019-12-26 22:25:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:25:46,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:25:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:46,973 INFO L225 Difference]: With dead ends: 13172 [2019-12-26 22:25:46,973 INFO L226 Difference]: Without dead ends: 9622 [2019-12-26 22:25:46,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:25:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2019-12-26 22:25:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 8338. [2019-12-26 22:25:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8338 states. [2019-12-26 22:25:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8338 states to 8338 states and 26488 transitions. [2019-12-26 22:25:47,113 INFO L78 Accepts]: Start accepts. Automaton has 8338 states and 26488 transitions. Word has length 59 [2019-12-26 22:25:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:47,113 INFO L462 AbstractCegarLoop]: Abstraction has 8338 states and 26488 transitions. [2019-12-26 22:25:47,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:25:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8338 states and 26488 transitions. [2019-12-26 22:25:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:47,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:47,122 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-26 22:25:47,122 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1854145516, now seen corresponding path program 2 times [2019-12-26 22:25:47,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:47,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51358454] [2019-12-26 22:25:47,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:47,309 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-26 22:25:47,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51358454] [2019-12-26 22:25:47,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:47,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:47,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063233095] [2019-12-26 22:25:47,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:25:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:25:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:25:47,311 INFO L87 Difference]: Start difference. First operand 8338 states and 26488 transitions. Second operand 10 states. [2019-12-26 22:25:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:48,388 INFO L93 Difference]: Finished difference Result 13004 states and 40435 transitions. [2019-12-26 22:25:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:25:48,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:25:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:48,405 INFO L225 Difference]: With dead ends: 13004 [2019-12-26 22:25:48,405 INFO L226 Difference]: Without dead ends: 10294 [2019-12-26 22:25:48,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:25:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2019-12-26 22:25:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8538. [2019-12-26 22:25:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-12-26 22:25:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 27032 transitions. [2019-12-26 22:25:48,642 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 27032 transitions. Word has length 59 [2019-12-26 22:25:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:48,642 INFO L462 AbstractCegarLoop]: Abstraction has 8538 states and 27032 transitions. [2019-12-26 22:25:48,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:25:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 27032 transitions. [2019-12-26 22:25:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:48,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:48,651 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-26 22:25:48,652 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:48,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1277650624, now seen corresponding path program 3 times [2019-12-26 22:25:48,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:48,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31625454] [2019-12-26 22:25:48,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:48,833 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-26 22:25:48,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31625454] [2019-12-26 22:25:48,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:48,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:25:48,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548092680] [2019-12-26 22:25:48,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:25:48,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:25:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:25:48,840 INFO L87 Difference]: Start difference. First operand 8538 states and 27032 transitions. Second operand 11 states. [2019-12-26 22:25:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:50,089 INFO L93 Difference]: Finished difference Result 12388 states and 38418 transitions. [2019-12-26 22:25:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:25:50,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 22:25:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:50,106 INFO L225 Difference]: With dead ends: 12388 [2019-12-26 22:25:50,106 INFO L226 Difference]: Without dead ends: 9914 [2019-12-26 22:25:50,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:25:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-12-26 22:25:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8234. [2019-12-26 22:25:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8234 states. [2019-12-26 22:25:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8234 states to 8234 states and 26156 transitions. [2019-12-26 22:25:50,251 INFO L78 Accepts]: Start accepts. Automaton has 8234 states and 26156 transitions. Word has length 59 [2019-12-26 22:25:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:50,251 INFO L462 AbstractCegarLoop]: Abstraction has 8234 states and 26156 transitions. [2019-12-26 22:25:50,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:25:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8234 states and 26156 transitions. [2019-12-26 22:25:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:50,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:50,260 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-26 22:25:50,261 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash -794252350, now seen corresponding path program 4 times [2019-12-26 22:25:50,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:50,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914736665] [2019-12-26 22:25:50,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:50,903 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-26 22:25:50,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914736665] [2019-12-26 22:25:50,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:50,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 22:25:50,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233794516] [2019-12-26 22:25:50,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 22:25:50,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 22:25:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:25:50,906 INFO L87 Difference]: Start difference. First operand 8234 states and 26156 transitions. Second operand 17 states. [2019-12-26 22:25:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:54,504 INFO L93 Difference]: Finished difference Result 12391 states and 38179 transitions. [2019-12-26 22:25:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 22:25:54,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-26 22:25:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:54,521 INFO L225 Difference]: With dead ends: 12391 [2019-12-26 22:25:54,522 INFO L226 Difference]: Without dead ends: 10436 [2019-12-26 22:25:54,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 22:25:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10436 states. [2019-12-26 22:25:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10436 to 8958. [2019-12-26 22:25:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8958 states. [2019-12-26 22:25:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8958 states to 8958 states and 28065 transitions. [2019-12-26 22:25:54,668 INFO L78 Accepts]: Start accepts. Automaton has 8958 states and 28065 transitions. Word has length 59 [2019-12-26 22:25:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:54,668 INFO L462 AbstractCegarLoop]: Abstraction has 8958 states and 28065 transitions. [2019-12-26 22:25:54,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 22:25:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8958 states and 28065 transitions. [2019-12-26 22:25:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:54,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:54,677 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-26 22:25:54,677 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash 611854610, now seen corresponding path program 5 times [2019-12-26 22:25:54,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:54,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986050941] [2019-12-26 22:25:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:54,930 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-26 22:25:54,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986050941] [2019-12-26 22:25:54,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:54,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:54,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188374373] [2019-12-26 22:25:54,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:25:54,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:25:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:25:54,934 INFO L87 Difference]: Start difference. First operand 8958 states and 28065 transitions. Second operand 10 states. [2019-12-26 22:25:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:55,714 INFO L93 Difference]: Finished difference Result 11251 states and 34940 transitions. [2019-12-26 22:25:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:25:55,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:25:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:55,736 INFO L225 Difference]: With dead ends: 11251 [2019-12-26 22:25:55,736 INFO L226 Difference]: Without dead ends: 10941 [2019-12-26 22:25:55,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:25:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10941 states. [2019-12-26 22:25:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10941 to 9949. [2019-12-26 22:25:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9949 states. [2019-12-26 22:25:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9949 states to 9949 states and 31134 transitions. [2019-12-26 22:25:55,958 INFO L78 Accepts]: Start accepts. Automaton has 9949 states and 31134 transitions. Word has length 59 [2019-12-26 22:25:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:55,958 INFO L462 AbstractCegarLoop]: Abstraction has 9949 states and 31134 transitions. [2019-12-26 22:25:55,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:25:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 9949 states and 31134 transitions. [2019-12-26 22:25:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:55,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:55,970 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-26 22:25:55,970 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1428960402, now seen corresponding path program 6 times [2019-12-26 22:25:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:55,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61235983] [2019-12-26 22:25:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:25:56,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61235983] [2019-12-26 22:25:56,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:56,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:25:56,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725527664] [2019-12-26 22:25:56,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:25:56,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:25:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:25:56,124 INFO L87 Difference]: Start difference. First operand 9949 states and 31134 transitions. Second operand 10 states. [2019-12-26 22:25:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:25:56,684 INFO L93 Difference]: Finished difference Result 11165 states and 34433 transitions. [2019-12-26 22:25:56,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:25:56,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 22:25:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:25:56,700 INFO L225 Difference]: With dead ends: 11165 [2019-12-26 22:25:56,701 INFO L226 Difference]: Without dead ends: 9718 [2019-12-26 22:25:56,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:25:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9718 states. [2019-12-26 22:25:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9718 to 8604. [2019-12-26 22:25:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2019-12-26 22:25:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 27068 transitions. [2019-12-26 22:25:56,840 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 27068 transitions. Word has length 59 [2019-12-26 22:25:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:25:56,840 INFO L462 AbstractCegarLoop]: Abstraction has 8604 states and 27068 transitions. [2019-12-26 22:25:56,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:25:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 27068 transitions. [2019-12-26 22:25:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:25:56,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:25:56,850 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-26 22:25:56,850 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:25:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:25:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1656101628, now seen corresponding path program 7 times [2019-12-26 22:25:56,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:25:56,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500926572] [2019-12-26 22:25:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:25:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:25:57,450 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-26 22:25:57,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500926572] [2019-12-26 22:25:57,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:25:57,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 22:25:57,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327942219] [2019-12-26 22:25:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 22:25:57,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:25:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 22:25:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:25:57,452 INFO L87 Difference]: Start difference. First operand 8604 states and 27068 transitions. Second operand 18 states. [2019-12-26 22:26:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:00,426 INFO L93 Difference]: Finished difference Result 11250 states and 34885 transitions. [2019-12-26 22:26:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 22:26:00,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-26 22:26:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:00,442 INFO L225 Difference]: With dead ends: 11250 [2019-12-26 22:26:00,442 INFO L226 Difference]: Without dead ends: 9836 [2019-12-26 22:26:00,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 22:26:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2019-12-26 22:26:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 8743. [2019-12-26 22:26:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8743 states. [2019-12-26 22:26:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8743 states to 8743 states and 27422 transitions. [2019-12-26 22:26:00,652 INFO L78 Accepts]: Start accepts. Automaton has 8743 states and 27422 transitions. Word has length 59 [2019-12-26 22:26:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:00,652 INFO L462 AbstractCegarLoop]: Abstraction has 8743 states and 27422 transitions. [2019-12-26 22:26:00,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 22:26:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8743 states and 27422 transitions. [2019-12-26 22:26:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:00,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:00,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:26:00,662 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1232758708, now seen corresponding path program 8 times [2019-12-26 22:26:00,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:00,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685762444] [2019-12-26 22:26:00,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:26:01,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685762444] [2019-12-26 22:26:01,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:01,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 22:26:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874189162] [2019-12-26 22:26:01,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 22:26:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 22:26:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:26:01,255 INFO L87 Difference]: Start difference. First operand 8743 states and 27422 transitions. Second operand 19 states. [2019-12-26 22:26:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:04,370 INFO L93 Difference]: Finished difference Result 11270 states and 34851 transitions. [2019-12-26 22:26:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 22:26:04,371 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-12-26 22:26:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:04,387 INFO L225 Difference]: With dead ends: 11270 [2019-12-26 22:26:04,387 INFO L226 Difference]: Without dead ends: 10232 [2019-12-26 22:26:04,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1332, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 22:26:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2019-12-26 22:26:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8787. [2019-12-26 22:26:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8787 states. [2019-12-26 22:26:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 27535 transitions. [2019-12-26 22:26:04,538 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 27535 transitions. Word has length 59 [2019-12-26 22:26:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 8787 states and 27535 transitions. [2019-12-26 22:26:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 22:26:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 27535 transitions. [2019-12-26 22:26:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:04,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:04,548 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-26 22:26:04,548 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash 795174344, now seen corresponding path program 9 times [2019-12-26 22:26:04,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:04,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652304919] [2019-12-26 22:26:04,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:04,995 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-26 22:26:04,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652304919] [2019-12-26 22:26:04,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:04,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 22:26:04,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137912008] [2019-12-26 22:26:04,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 22:26:04,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 22:26:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:26:04,997 INFO L87 Difference]: Start difference. First operand 8787 states and 27535 transitions. Second operand 17 states. [2019-12-26 22:26:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:08,350 INFO L93 Difference]: Finished difference Result 12345 states and 37904 transitions. [2019-12-26 22:26:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 22:26:08,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-26 22:26:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:08,369 INFO L225 Difference]: With dead ends: 12345 [2019-12-26 22:26:08,369 INFO L226 Difference]: Without dead ends: 12107 [2019-12-26 22:26:08,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2019-12-26 22:26:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12107 states. [2019-12-26 22:26:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12107 to 10168. [2019-12-26 22:26:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2019-12-26 22:26:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 31743 transitions. [2019-12-26 22:26:08,545 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 31743 transitions. Word has length 59 [2019-12-26 22:26:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:08,545 INFO L462 AbstractCegarLoop]: Abstraction has 10168 states and 31743 transitions. [2019-12-26 22:26:08,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 22:26:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 31743 transitions. [2019-12-26 22:26:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:08,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:08,557 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-26 22:26:08,557 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1612280136, now seen corresponding path program 10 times [2019-12-26 22:26:08,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:08,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794870164] [2019-12-26 22:26:08,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:09,332 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-26 22:26:09,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794870164] [2019-12-26 22:26:09,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:09,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 22:26:09,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27184875] [2019-12-26 22:26:09,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 22:26:09,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:09,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 22:26:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:26:09,334 INFO L87 Difference]: Start difference. First operand 10168 states and 31743 transitions. Second operand 19 states. [2019-12-26 22:26:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:13,095 INFO L93 Difference]: Finished difference Result 12035 states and 36925 transitions. [2019-12-26 22:26:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 22:26:13,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-12-26 22:26:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:13,113 INFO L225 Difference]: With dead ends: 12035 [2019-12-26 22:26:13,114 INFO L226 Difference]: Without dead ends: 11669 [2019-12-26 22:26:13,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 22:26:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11669 states. [2019-12-26 22:26:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11669 to 10132. [2019-12-26 22:26:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2019-12-26 22:26:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 31648 transitions. [2019-12-26 22:26:13,281 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 31648 transitions. Word has length 59 [2019-12-26 22:26:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:13,281 INFO L462 AbstractCegarLoop]: Abstraction has 10132 states and 31648 transitions. [2019-12-26 22:26:13,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 22:26:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 31648 transitions. [2019-12-26 22:26:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:13,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:13,293 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-26 22:26:13,293 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:13,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2033440416, now seen corresponding path program 11 times [2019-12-26 22:26:13,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:13,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687128560] [2019-12-26 22:26:13,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:13,479 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-26 22:26:13,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687128560] [2019-12-26 22:26:13,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:13,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:26:13,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71338250] [2019-12-26 22:26:13,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:26:13,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:26:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:26:13,481 INFO L87 Difference]: Start difference. First operand 10132 states and 31648 transitions. Second operand 11 states. [2019-12-26 22:26:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:14,360 INFO L93 Difference]: Finished difference Result 13140 states and 40487 transitions. [2019-12-26 22:26:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:26:14,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 22:26:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:14,375 INFO L225 Difference]: With dead ends: 13140 [2019-12-26 22:26:14,375 INFO L226 Difference]: Without dead ends: 9392 [2019-12-26 22:26:14,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-26 22:26:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9392 states. [2019-12-26 22:26:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9392 to 8490. [2019-12-26 22:26:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8490 states. [2019-12-26 22:26:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8490 states to 8490 states and 26680 transitions. [2019-12-26 22:26:14,513 INFO L78 Accepts]: Start accepts. Automaton has 8490 states and 26680 transitions. Word has length 59 [2019-12-26 22:26:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:14,513 INFO L462 AbstractCegarLoop]: Abstraction has 8490 states and 26680 transitions. [2019-12-26 22:26:14,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:26:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8490 states and 26680 transitions. [2019-12-26 22:26:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:14,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:14,523 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-26 22:26:14,523 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1556260520, now seen corresponding path program 12 times [2019-12-26 22:26:14,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:14,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322632389] [2019-12-26 22:26:14,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:26:14,713 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-26 22:26:14,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322632389] [2019-12-26 22:26:14,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:26:14,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:26:14,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318298966] [2019-12-26 22:26:14,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:26:14,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:26:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:26:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:26:14,715 INFO L87 Difference]: Start difference. First operand 8490 states and 26680 transitions. Second operand 12 states. [2019-12-26 22:26:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:26:15,365 INFO L93 Difference]: Finished difference Result 9542 states and 29484 transitions. [2019-12-26 22:26:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:26:15,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 22:26:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:26:15,380 INFO L225 Difference]: With dead ends: 9542 [2019-12-26 22:26:15,381 INFO L226 Difference]: Without dead ends: 9360 [2019-12-26 22:26:15,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:26:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9360 states. [2019-12-26 22:26:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9360 to 8350. [2019-12-26 22:26:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8350 states. [2019-12-26 22:26:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 26307 transitions. [2019-12-26 22:26:15,523 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 26307 transitions. Word has length 59 [2019-12-26 22:26:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:26:15,523 INFO L462 AbstractCegarLoop]: Abstraction has 8350 states and 26307 transitions. [2019-12-26 22:26:15,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:26:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 26307 transitions. [2019-12-26 22:26:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:26:15,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:26:15,532 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-26 22:26:15,533 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:26:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:26:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash -765256248, now seen corresponding path program 13 times [2019-12-26 22:26:15,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:26:15,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207239259] [2019-12-26 22:26:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:26:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:26:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:26:15,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:26:15,636 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:26:15,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$r_buff1_thd4~0_204) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~main$tmp_guard1~0_50 0) (= v_~a~0_15 0) (= 0 v_~y$w_buff0~0_524) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t941~0.base_26| 1)) (= 0 v_~y$r_buff0_thd3~0_184) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff0_thd4~0_132) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t941~0.base_26| 4) |v_#length_29|) (= v_~y$w_buff0_used~0_906 0) (= |v_#NULL.offset_3| 0) (= v_~weak$$choice2~0_152 0) (= v_~y$r_buff1_thd0~0_180 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_26|) |v_ULTIMATE.start_main_~#t941~0.offset_17| 0)) |v_#memory_int_27|) (= 0 v_~__unbuffered_p0_EAX~0_69) (= 0 v_~y$r_buff0_thd2~0_313) (= v_~y~0_171 0) (= v_~x~0_48 0) (= v_~y$mem_tmp~0_33 0) (= 0 v_~__unbuffered_p1_EAX~0_59) (= 0 v_~__unbuffered_p3_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_47) (= 0 |v_ULTIMATE.start_main_~#t941~0.offset_17|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t941~0.base_26|) (= 0 v_~weak$$choice0~0_21) (= (select .cse0 |v_ULTIMATE.start_main_~#t941~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_124) (= 0 v_~y$flush_delayed~0_62) (= 0 v_~y$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_20|) (= v_~y$w_buff1~0_331 0) (= v_~z~0_40 0) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd2~0_274) (= v_~__unbuffered_cnt~0_218 0) (= v_~y$r_buff0_thd1~0_33 0) (= v_~b~0_43 0) (= 0 v_~y$r_buff1_thd3~0_153) (= v_~y$w_buff1_used~0_620 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_97|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_200|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, ULTIMATE.start_main_~#t941~0.offset=|v_ULTIMATE.start_main_~#t941~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ULTIMATE.start_main_~#t941~0.base=|v_ULTIMATE.start_main_~#t941~0.base_26|, ~y$flush_delayed~0=v_~y$flush_delayed~0_62, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_47, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_24|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_28|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_331, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_40|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_524, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ~y~0=v_~y~0_171, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_47, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_17|, ~b~0=v_~b~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_152, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t941~0.offset, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t941~0.base, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t944~0.base, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t943~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t942~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t942~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t943~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t944~0.offset, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:26:15,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-1-->L852: Formula: (and (= |v_ULTIMATE.start_main_~#t942~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t942~0.base_12|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12|) |v_ULTIMATE.start_main_~#t942~0.offset_11| 1))) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t942~0.base_12| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t942~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t942~0.offset, #length, ULTIMATE.start_main_~#t942~0.base] because there is no mapped edge [2019-12-26 22:26:15,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L852-1-->L854: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t943~0.base_13|)) (= |v_ULTIMATE.start_main_~#t943~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13|) |v_ULTIMATE.start_main_~#t943~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t943~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t943~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_11|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t943~0.offset, ULTIMATE.start_main_~#t943~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 22:26:15,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L854-1-->L856: Formula: (and (= |v_ULTIMATE.start_main_~#t944~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t944~0.base_12| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t944~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12|) |v_ULTIMATE.start_main_~#t944~0.offset_10| 3)) |v_#memory_int_21|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t944~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t944~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t944~0.base] because there is no mapped edge [2019-12-26 22:26:15,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_13) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_36) (= v_~y$r_buff0_thd3~0_35 v_~y$r_buff1_thd3~0_31) (= v_~y$r_buff0_thd4~0_32 v_~y$r_buff1_thd4~0_28) (= v_~y$r_buff1_thd1~0_9 v_~y$r_buff0_thd1~0_9) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48 0)) (= v_~y$r_buff0_thd2~0_103 v_~y$r_buff1_thd2~0_52) (= v_~y$r_buff0_thd3~0_34 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~z~0=v_~z~0_12} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z~0=v_~z~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:26:15,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_20 1) (= v_~x~0_26 v_~__unbuffered_p0_EAX~0_24) (= |v_P0Thread1of1ForFork1_#in~arg.base_18| v_P0Thread1of1ForFork1_~arg.base_18) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_18|) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~b~0=v_~b~0_20, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 22:26:15,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out2082782696| |P3Thread1of1ForFork0_#t~ite33_Out2082782696|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2082782696 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In2082782696 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out2082782696| ~y$w_buff1~0_In2082782696)) (and .cse2 (or .cse1 .cse0) (= ~y~0_In2082782696 |P3Thread1of1ForFork0_#t~ite32_Out2082782696|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In2082782696, ~y$w_buff1~0=~y$w_buff1~0_In2082782696, ~y~0=~y~0_In2082782696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2082782696} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In2082782696, ~y$w_buff1~0=~y$w_buff1~0_In2082782696, ~y~0=~y~0_In2082782696, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out2082782696|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out2082782696|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2082782696} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 22:26:15,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-1140118602 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1140118602 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-1140118602|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1140118602 |P3Thread1of1ForFork0_#t~ite34_Out-1140118602|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1140118602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140118602} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1140118602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140118602, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1140118602|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-26 22:26:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-609831187 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-609831187 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-609831187|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-609831187 |P2Thread1of1ForFork3_#t~ite28_Out-609831187|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-609831187, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-609831187} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-609831187, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-609831187, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-609831187|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-26 22:26:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd4~0_In-1940297336 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1940297336 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1940297336 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1940297336 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out-1940297336| 0)) (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1940297336| ~y$w_buff1_used~0_In-1940297336) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1940297336, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1940297336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940297336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940297336} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1940297336, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1940297336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940297336, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1940297336|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940297336} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-26 22:26:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-130154570 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-130154570 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-130154570 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-130154570 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-130154570| ~y$w_buff1_used~0_In-130154570) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite29_Out-130154570| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-130154570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-130154570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-130154570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-130154570} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-130154570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-130154570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-130154570, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-130154570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-130154570} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-26 22:26:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In536216889 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In536216889 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In536216889 ~y$r_buff0_thd3~0_Out536216889)) (and (= ~y$r_buff0_thd3~0_Out536216889 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In536216889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In536216889} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out536216889|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In536216889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out536216889} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:26:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In464628505 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In464628505 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In464628505 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In464628505 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out464628505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite31_Out464628505| ~y$r_buff1_thd3~0_In464628505) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In464628505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In464628505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In464628505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464628505} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In464628505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In464628505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In464628505, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out464628505|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464628505} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 22:26:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_46) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_46, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:26:15,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1593690149 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In-1593690149| |P1Thread1of1ForFork2_#t~ite8_Out-1593690149|) (not .cse0) (= ~y$w_buff0~0_In-1593690149 |P1Thread1of1ForFork2_#t~ite9_Out-1593690149|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1593690149 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1593690149 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1593690149 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In-1593690149 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1593690149| ~y$w_buff0~0_In-1593690149) (= |P1Thread1of1ForFork2_#t~ite8_Out-1593690149| |P1Thread1of1ForFork2_#t~ite9_Out-1593690149|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1593690149, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1593690149, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1593690149|, ~y$w_buff0~0=~y$w_buff0~0_In-1593690149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1593690149, ~weak$$choice2~0=~weak$$choice2~0_In-1593690149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1593690149} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1593690149, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1593690149|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1593690149, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1593690149|, ~y$w_buff0~0=~y$w_buff0~0_In-1593690149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1593690149, ~weak$$choice2~0=~weak$$choice2~0_In-1593690149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1593690149} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:26:15,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1291864321 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1291864321| |P1Thread1of1ForFork2_#t~ite11_Out-1291864321|) (= |P1Thread1of1ForFork2_#t~ite11_Out-1291864321| ~y$w_buff1~0_In-1291864321) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1291864321 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-1291864321 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1291864321 256) 0)) (= (mod ~y$w_buff0_used~0_In-1291864321 256) 0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-1291864321| |P1Thread1of1ForFork2_#t~ite11_Out-1291864321|) (= |P1Thread1of1ForFork2_#t~ite12_Out-1291864321| ~y$w_buff1~0_In-1291864321)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1291864321, ~y$w_buff1~0=~y$w_buff1~0_In-1291864321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1291864321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1291864321, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1291864321|, ~weak$$choice2~0=~weak$$choice2~0_In-1291864321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1291864321} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1291864321, ~y$w_buff1~0=~y$w_buff1~0_In-1291864321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1291864321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1291864321, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1291864321|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1291864321|, ~weak$$choice2~0=~weak$$choice2~0_In-1291864321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1291864321} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:26:15,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_11|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 22:26:15,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-159295706 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-159295706| ~y$r_buff1_thd2~0_In-159295706) (= |P1Thread1of1ForFork2_#t~ite23_In-159295706| |P1Thread1of1ForFork2_#t~ite23_Out-159295706|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-159295706 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-159295706 256) 0)) (= (mod ~y$w_buff0_used~0_In-159295706 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-159295706 256)) .cse1))) (= ~y$r_buff1_thd2~0_In-159295706 |P1Thread1of1ForFork2_#t~ite23_Out-159295706|) .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-159295706| |P1Thread1of1ForFork2_#t~ite23_Out-159295706|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159295706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159295706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159295706, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-159295706|, ~weak$$choice2~0=~weak$$choice2~0_In-159295706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159295706} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159295706, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159295706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159295706, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-159295706|, ~weak$$choice2~0=~weak$$choice2~0_In-159295706, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-159295706|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159295706} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 22:26:15,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= v_~y~0_26 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_26, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 22:26:15,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-292827937 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-292827937 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-292827937|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd4~0_In-292827937 |P3Thread1of1ForFork0_#t~ite36_Out-292827937|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-292827937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-292827937} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-292827937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-292827937, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-292827937|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-26 22:26:15,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1173053655 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1173053655 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In1173053655 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1173053655 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1173053655|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out1173053655| ~y$r_buff1_thd4~0_In1173053655) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1173053655, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1173053655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1173053655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1173053655} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1173053655, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1173053655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1173053655, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1173053655|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1173053655} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-26 22:26:15,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_146 (+ v_~__unbuffered_cnt~0_147 1)) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_66| v_~y$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_66|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_141, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_65|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:26:15,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= v_~main$tmp_guard0~0_12 1) (= 4 v_~__unbuffered_cnt~0_38)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:26:15,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In882642633 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In882642633 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In882642633 |ULTIMATE.start_main_#t~ite42_Out882642633|)) (and (= ~y$w_buff1~0_In882642633 |ULTIMATE.start_main_#t~ite42_Out882642633|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In882642633, ~y~0=~y~0_In882642633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In882642633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In882642633} OutVars{~y$w_buff1~0=~y$w_buff1~0_In882642633, ~y~0=~y~0_In882642633, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out882642633|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In882642633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In882642633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:26:15,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:26:15,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1486372339 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1486372339 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1486372339| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1486372339| ~y$w_buff0_used~0_In1486372339) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1486372339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1486372339} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1486372339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1486372339, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1486372339|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:26:15,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-211225678 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-211225678 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-211225678 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-211225678 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-211225678 |ULTIMATE.start_main_#t~ite45_Out-211225678|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-211225678|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-211225678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211225678, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211225678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211225678} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-211225678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211225678, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211225678, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-211225678|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211225678} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:26:15,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1288565658 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1288565658 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1288565658|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1288565658 |ULTIMATE.start_main_#t~ite46_Out-1288565658|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288565658, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1288565658} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288565658, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1288565658, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1288565658|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 22:26:15,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In167957586 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In167957586 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In167957586 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In167957586 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In167957586 |ULTIMATE.start_main_#t~ite47_Out167957586|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite47_Out167957586| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In167957586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167957586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167957586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167957586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In167957586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167957586, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out167957586|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167957586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167957586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:26:15,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_23) (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~y$r_buff1_thd0~0_137 |v_ULTIMATE.start_main_#t~ite47_48|) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_92) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 1 v_~__unbuffered_p3_EAX~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:26:15,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:26:15 BasicIcfg [2019-12-26 22:26:15,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:26:15,753 INFO L168 Benchmark]: Toolchain (without parser) took 142262.44 ms. Allocated memory was 142.6 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,760 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 928.98 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.3 MB in the beginning and 152.1 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.98 ms. Allocated memory is still 199.2 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,761 INFO L168 Benchmark]: Boogie Preprocessor took 35.47 ms. Allocated memory is still 199.2 MB. Free memory was 149.3 MB in the beginning and 147.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,762 INFO L168 Benchmark]: RCFGBuilder took 845.44 ms. Allocated memory is still 199.2 MB. Free memory was 147.2 MB in the beginning and 97.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,762 INFO L168 Benchmark]: TraceAbstraction took 140345.96 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:26:15,767 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.47 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 928.98 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.3 MB in the beginning and 152.1 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.98 ms. Allocated memory is still 199.2 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.47 ms. Allocated memory is still 199.2 MB. Free memory was 149.3 MB in the beginning and 147.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.44 ms. Allocated memory is still 199.2 MB. Free memory was 147.2 MB in the beginning and 97.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140345.96 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 96.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 183 ProgramPointsBefore, 88 ProgramPointsAfterwards, 211 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 7374 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 74129 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5939 SDtfs, 11013 SDslu, 25333 SDs, 0 SdLazy, 23185 SolverSat, 789 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 35 SyntacticMatches, 19 SemanticMatches, 488 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160086occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 137772 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1454 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1364 ConstructedInterpolants, 0 QuantifiedInterpolants, 372172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...