/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/mix003_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:10:59,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:10:59,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:10:59,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:10:59,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:10:59,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:10:59,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:10:59,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:10:59,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:10:59,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:10:59,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:10:59,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:10:59,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:10:59,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:10:59,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:10:59,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:10:59,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:10:59,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:10:59,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:10:59,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:10:59,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:10:59,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:10:59,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:10:59,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:10:59,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:10:59,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:10:59,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:10:59,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:10:59,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:10:59,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:10:59,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:10:59,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:10:59,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:10:59,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:10:59,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:10:59,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:10:59,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:10:59,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:10:59,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:10:59,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:10:59,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:10:59,274 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 21:10:59,288 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:10:59,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:10:59,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:10:59,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:10:59,290 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:10:59,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:10:59,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:10:59,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:10:59,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:10:59,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:10:59,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:10:59,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:10:59,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:10:59,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:10:59,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:10:59,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:10:59,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:10:59,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:10:59,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:10:59,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:10:59,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:10:59,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:10:59,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:10:59,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:10:59,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:10:59,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:10:59,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:10:59,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:10:59,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:10:59,583 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:10:59,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-26 21:10:59,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83d1ba4f/c5994d529de74793a044738ad0c0e136/FLAGc95f6cb97 [2019-12-26 21:11:00,145 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:11:00,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-26 21:11:00,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83d1ba4f/c5994d529de74793a044738ad0c0e136/FLAGc95f6cb97 [2019-12-26 21:11:00,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83d1ba4f/c5994d529de74793a044738ad0c0e136 [2019-12-26 21:11:00,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:11:00,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:11:00,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:11:00,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:11:00,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:11:00,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:11:00" (1/1) ... [2019-12-26 21:11:00,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:00, skipping insertion in model container [2019-12-26 21:11:00,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:11:00" (1/1) ... [2019-12-26 21:11:00,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:11:00,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:11:01,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:11:01,121 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:11:01,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:11:01,281 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:11:01,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01 WrapperNode [2019-12-26 21:11:01,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:11:01,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:11:01,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:11:01,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:11:01,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:11:01,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:11:01,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:11:01,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:11:01,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (1/1) ... [2019-12-26 21:11:01,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:11:01,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:11:01,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:11:01,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:11:01,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (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 21:11:01,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:11:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:11:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:11:01,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:11:01,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:11:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:11:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:11:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:11:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:11:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:11:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:11:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:11:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:11:01,483 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 21:11:02,474 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:11:02,474 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:11:02,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:11:02 BoogieIcfgContainer [2019-12-26 21:11:02,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:11:02,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:11:02,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:11:02,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:11:02,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:11:00" (1/3) ... [2019-12-26 21:11:02,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:11:02, skipping insertion in model container [2019-12-26 21:11:02,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:11:01" (2/3) ... [2019-12-26 21:11:02,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:11:02, skipping insertion in model container [2019-12-26 21:11:02,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:11:02" (3/3) ... [2019-12-26 21:11:02,485 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_pso.oepc.i [2019-12-26 21:11:02,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:11:02,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:11:02,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:11:02,505 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:11:02,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:11:02,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:11:02,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:11:02,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:11:02,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:11:02,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:11:02,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:11:02,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:11:02,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:11:02,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:11:02,696 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:11:02,698 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:11:02,807 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:11:02,808 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:11:02,824 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:11:02,852 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:11:02,908 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:11:02,908 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:11:02,917 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:11:02,938 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:11:02,940 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:11:08,415 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:11:08,563 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:11:08,922 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-26 21:11:08,923 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:11:08,927 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 21:11:29,735 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:11:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:11:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:11:29,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:29,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:11:29,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:11:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-26 21:11:29,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:29,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853983475] [2019-12-26 21:11:29,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:29,970 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 21:11:29,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853983475] [2019-12-26 21:11:29,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:29,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:11:29,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226138761] [2019-12-26 21:11:29,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:29,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:29,992 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:11:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:31,588 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-26 21:11:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:31,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:11:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:32,370 INFO L225 Difference]: With dead ends: 119613 [2019-12-26 21:11:32,370 INFO L226 Difference]: Without dead ends: 105755 [2019-12-26 21:11:32,372 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 21:11:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-26 21:11:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-26 21:11:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-26 21:11:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-26 21:11:46,233 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-26 21:11:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:46,233 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-26 21:11:46,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-26 21:11:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:11:46,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:46,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:46,238 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:11:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-26 21:11:46,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:46,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837949222] [2019-12-26 21:11:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:46,341 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 21:11:46,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837949222] [2019-12-26 21:11:46,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:46,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:46,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944242839] [2019-12-26 21:11:46,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:46,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:46,345 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-26 21:11:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:52,544 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-26 21:11:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:52,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:11:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:53,242 INFO L225 Difference]: With dead ends: 168845 [2019-12-26 21:11:53,242 INFO L226 Difference]: Without dead ends: 168747 [2019-12-26 21:11:53,243 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 21:11:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-26 21:12:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-26 21:12:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-26 21:12:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-26 21:12:01,852 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-26 21:12:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:01,853 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-26 21:12:01,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-26 21:12:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:12:01,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:01,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:01,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-26 21:12:07,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069022362] [2019-12-26 21:12:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:07,658 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 21:12:07,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069022362] [2019-12-26 21:12:07,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:07,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:07,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325509185] [2019-12-26 21:12:07,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:07,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:07,660 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-26 21:12:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:07,795 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-26 21:12:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:07,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:12:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:07,900 INFO L225 Difference]: With dead ends: 33476 [2019-12-26 21:12:07,900 INFO L226 Difference]: Without dead ends: 33476 [2019-12-26 21:12:07,900 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 21:12:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-26 21:12:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-26 21:12:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-26 21:12:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-26 21:12:08,576 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-26 21:12:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:08,576 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-26 21:12:08,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-26 21:12:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:12:08,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:08,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:08,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-26 21:12:08,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:08,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757675155] [2019-12-26 21:12:08,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:12:08,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757675155] [2019-12-26 21:12:08,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:08,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:08,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55840227] [2019-12-26 21:12:08,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:08,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:08,697 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-26 21:12:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:09,078 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-26 21:12:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:12:09,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:12:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:09,157 INFO L225 Difference]: With dead ends: 41508 [2019-12-26 21:12:09,158 INFO L226 Difference]: Without dead ends: 41508 [2019-12-26 21:12:09,158 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 21:12:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-26 21:12:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-26 21:12:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-26 21:12:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-26 21:12:10,299 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-26 21:12:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:10,300 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-26 21:12:10,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-26 21:12:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:12:10,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:10,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:10,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-26 21:12:10,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:10,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790214383] [2019-12-26 21:12:10,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:10,354 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 21:12:10,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790214383] [2019-12-26 21:12:10,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:10,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:10,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531184622] [2019-12-26 21:12:10,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:10,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:10,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:10,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:10,357 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-26 21:12:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:10,574 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-26 21:12:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:10,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:12:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:10,683 INFO L225 Difference]: With dead ends: 54855 [2019-12-26 21:12:10,683 INFO L226 Difference]: Without dead ends: 54855 [2019-12-26 21:12:10,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-26 21:12:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-26 21:12:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-26 21:12:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-26 21:12:11,707 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-26 21:12:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:11,707 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-26 21:12:11,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-26 21:12:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:12:11,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:11,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:11,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-26 21:12:11,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:11,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427706324] [2019-12-26 21:12:11,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:12:11,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427706324] [2019-12-26 21:12:11,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:11,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:11,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475981459] [2019-12-26 21:12:11,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:11,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:11,770 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-26 21:12:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:12,128 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-26 21:12:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:12:12,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:12:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:12,214 INFO L225 Difference]: With dead ends: 49903 [2019-12-26 21:12:12,215 INFO L226 Difference]: Without dead ends: 49903 [2019-12-26 21:12:12,215 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 21:12:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-26 21:12:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-26 21:12:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-26 21:12:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-26 21:12:13,401 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-26 21:12:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:13,402 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-26 21:12:13,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-26 21:12:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:12:13,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:13,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:13,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-26 21:12:13,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:13,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746553981] [2019-12-26 21:12:13,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:13,498 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 21:12:13,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746553981] [2019-12-26 21:12:13,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:13,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:13,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579261110] [2019-12-26 21:12:13,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:13,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:13,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:13,500 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-26 21:12:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:14,184 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-26 21:12:14,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:12:14,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:12:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:14,289 INFO L225 Difference]: With dead ends: 59763 [2019-12-26 21:12:14,290 INFO L226 Difference]: Without dead ends: 59749 [2019-12-26 21:12:14,290 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 21:12:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-26 21:12:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-26 21:12:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-26 21:12:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-26 21:12:15,157 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-26 21:12:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:15,158 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-26 21:12:15,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-26 21:12:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:12:15,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:15,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:15,167 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-26 21:12:15,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:15,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576857952] [2019-12-26 21:12:15,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:12:15,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576857952] [2019-12-26 21:12:15,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:15,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:15,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817910500] [2019-12-26 21:12:15,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:15,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:15,242 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-26 21:12:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:16,069 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-26 21:12:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:12:16,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:12:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:16,180 INFO L225 Difference]: With dead ends: 62779 [2019-12-26 21:12:16,180 INFO L226 Difference]: Without dead ends: 62765 [2019-12-26 21:12:16,181 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 21:12:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-26 21:12:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-26 21:12:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-26 21:12:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-26 21:12:17,052 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-26 21:12:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:17,053 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-26 21:12:17,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-26 21:12:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:12:17,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:17,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:17,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-26 21:12:17,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:17,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046637479] [2019-12-26 21:12:17,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:17,121 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 21:12:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046637479] [2019-12-26 21:12:17,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:17,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:17,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658669142] [2019-12-26 21:12:17,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:17,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:17,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:17,124 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-26 21:12:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:17,216 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-26 21:12:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:12:17,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:12:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:17,248 INFO L225 Difference]: With dead ends: 17503 [2019-12-26 21:12:17,249 INFO L226 Difference]: Without dead ends: 17503 [2019-12-26 21:12:17,249 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 21:12:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-26 21:12:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-26 21:12:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:12:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-26 21:12:17,527 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-26 21:12:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:17,527 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-26 21:12:17,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-26 21:12:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:12:17,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:17,541 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] [2019-12-26 21:12:17,541 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-26 21:12:17,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:17,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764068294] [2019-12-26 21:12:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:17,587 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 21:12:17,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764068294] [2019-12-26 21:12:17,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:17,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:17,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184617362] [2019-12-26 21:12:17,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:17,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:17,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:17,589 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-26 21:12:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:17,684 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-26 21:12:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:17,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:12:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:17,714 INFO L225 Difference]: With dead ends: 22571 [2019-12-26 21:12:17,714 INFO L226 Difference]: Without dead ends: 22571 [2019-12-26 21:12:17,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-26 21:12:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-26 21:12:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-26 21:12:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-26 21:12:18,014 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-26 21:12:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:18,014 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-26 21:12:18,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-26 21:12:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:12:18,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:18,027 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] [2019-12-26 21:12:18,027 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-26 21:12:18,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:18,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405369194] [2019-12-26 21:12:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:18,229 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-26 21:12:18,241 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 21:12:18,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405369194] [2019-12-26 21:12:18,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:18,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:18,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643070554] [2019-12-26 21:12:18,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:18,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:18,243 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-26 21:12:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:18,590 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-26 21:12:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:12:18,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:12:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:18,627 INFO L225 Difference]: With dead ends: 21146 [2019-12-26 21:12:18,628 INFO L226 Difference]: Without dead ends: 21146 [2019-12-26 21:12:18,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-26 21:12:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-26 21:12:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-26 21:12:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-26 21:12:19,065 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-26 21:12:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:19,066 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-26 21:12:19,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-26 21:12:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:12:19,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:19,088 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 21:12:19,088 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-26 21:12:19,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:19,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77443491] [2019-12-26 21:12:19,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:19,197 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 21:12:19,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77443491] [2019-12-26 21:12:19,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:19,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:19,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147924760] [2019-12-26 21:12:19,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:19,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:19,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:19,200 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-26 21:12:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:19,523 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-26 21:12:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:12:19,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:12:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:19,557 INFO L225 Difference]: With dead ends: 23192 [2019-12-26 21:12:19,557 INFO L226 Difference]: Without dead ends: 23192 [2019-12-26 21:12:19,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-26 21:12:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-26 21:12:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-26 21:12:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-26 21:12:19,872 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-26 21:12:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:19,872 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-26 21:12:19,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-26 21:12:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:12:19,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:19,892 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] [2019-12-26 21:12:19,892 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-26 21:12:19,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:19,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189716944] [2019-12-26 21:12:19,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:12:19,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189716944] [2019-12-26 21:12:19,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:19,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:12:19,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596995876] [2019-12-26 21:12:19,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:12:19,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:12:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:12:19,994 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-26 21:12:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:20,661 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-26 21:12:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:12:20,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 21:12:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:20,699 INFO L225 Difference]: With dead ends: 26785 [2019-12-26 21:12:20,699 INFO L226 Difference]: Without dead ends: 26785 [2019-12-26 21:12:20,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:12:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-26 21:12:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-26 21:12:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-26 21:12:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-26 21:12:21,052 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-26 21:12:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:21,053 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-26 21:12:21,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:12:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-26 21:12:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:12:21,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:21,075 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] [2019-12-26 21:12:21,075 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-26 21:12:21,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:21,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387947697] [2019-12-26 21:12:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:21,165 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 21:12:21,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387947697] [2019-12-26 21:12:21,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:21,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:12:21,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652458705] [2019-12-26 21:12:21,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:12:21,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:12:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:12:21,168 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-26 21:12:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:21,872 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-26 21:12:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:12:21,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 21:12:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:21,908 INFO L225 Difference]: With dead ends: 25915 [2019-12-26 21:12:21,909 INFO L226 Difference]: Without dead ends: 25915 [2019-12-26 21:12:21,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:12:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-26 21:12:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-26 21:12:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-26 21:12:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-26 21:12:22,341 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-26 21:12:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-26 21:12:22,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:12:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-26 21:12:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:12:22,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:22,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:22,359 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-26 21:12:22,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:22,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688821470] [2019-12-26 21:12:22,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:22,424 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 21:12:22,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688821470] [2019-12-26 21:12:22,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:22,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:12:22,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118492018] [2019-12-26 21:12:22,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:22,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:22,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:22,426 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-26 21:12:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:22,491 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-26 21:12:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:22,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:12:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:22,522 INFO L225 Difference]: With dead ends: 17953 [2019-12-26 21:12:22,522 INFO L226 Difference]: Without dead ends: 17953 [2019-12-26 21:12:22,524 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 21:12:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-26 21:12:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-26 21:12:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-26 21:12:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-26 21:12:22,798 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-26 21:12:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:22,798 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-26 21:12:22,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-26 21:12:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:12:22,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:22,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:22,814 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-26 21:12:22,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:22,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697968410] [2019-12-26 21:12:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:22,863 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 21:12:22,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697968410] [2019-12-26 21:12:22,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:22,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:12:22,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385383681] [2019-12-26 21:12:22,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:22,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:22,865 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 5 states. [2019-12-26 21:12:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:22,944 INFO L93 Difference]: Finished difference Result 16745 states and 50707 transitions. [2019-12-26 21:12:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:12:22,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:12:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:22,975 INFO L225 Difference]: With dead ends: 16745 [2019-12-26 21:12:22,976 INFO L226 Difference]: Without dead ends: 16745 [2019-12-26 21:12:22,976 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 21:12:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2019-12-26 21:12:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 16164. [2019-12-26 21:12:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16164 states. [2019-12-26 21:12:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16164 states to 16164 states and 49138 transitions. [2019-12-26 21:12:23,267 INFO L78 Accepts]: Start accepts. Automaton has 16164 states and 49138 transitions. Word has length 40 [2019-12-26 21:12:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:23,268 INFO L462 AbstractCegarLoop]: Abstraction has 16164 states and 49138 transitions. [2019-12-26 21:12:23,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16164 states and 49138 transitions. [2019-12-26 21:12:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:23,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:23,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:23,290 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash -707354115, now seen corresponding path program 1 times [2019-12-26 21:12:23,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:23,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940185407] [2019-12-26 21:12:23,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:23,371 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 21:12:23,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940185407] [2019-12-26 21:12:23,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:23,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:12:23,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298961061] [2019-12-26 21:12:23,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:23,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:23,373 INFO L87 Difference]: Start difference. First operand 16164 states and 49138 transitions. Second operand 7 states. [2019-12-26 21:12:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:23,862 INFO L93 Difference]: Finished difference Result 47597 states and 143647 transitions. [2019-12-26 21:12:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:12:23,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:23,909 INFO L225 Difference]: With dead ends: 47597 [2019-12-26 21:12:23,909 INFO L226 Difference]: Without dead ends: 36910 [2019-12-26 21:12:23,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36910 states. [2019-12-26 21:12:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36910 to 19812. [2019-12-26 21:12:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19812 states. [2019-12-26 21:12:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19812 states to 19812 states and 60413 transitions. [2019-12-26 21:12:24,347 INFO L78 Accepts]: Start accepts. Automaton has 19812 states and 60413 transitions. Word has length 64 [2019-12-26 21:12:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:24,348 INFO L462 AbstractCegarLoop]: Abstraction has 19812 states and 60413 transitions. [2019-12-26 21:12:24,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19812 states and 60413 transitions. [2019-12-26 21:12:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:24,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:24,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:24,375 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash -919693373, now seen corresponding path program 2 times [2019-12-26 21:12:24,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:24,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71993327] [2019-12-26 21:12:24,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:24,470 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 21:12:24,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71993327] [2019-12-26 21:12:24,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:24,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:12:24,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252923769] [2019-12-26 21:12:24,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:24,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:24,473 INFO L87 Difference]: Start difference. First operand 19812 states and 60413 transitions. Second operand 7 states. [2019-12-26 21:12:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:25,051 INFO L93 Difference]: Finished difference Result 54647 states and 162905 transitions. [2019-12-26 21:12:25,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:12:25,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:25,123 INFO L225 Difference]: With dead ends: 54647 [2019-12-26 21:12:25,123 INFO L226 Difference]: Without dead ends: 39740 [2019-12-26 21:12:25,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39740 states. [2019-12-26 21:12:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39740 to 23243. [2019-12-26 21:12:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-26 21:12:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 70535 transitions. [2019-12-26 21:12:26,041 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 70535 transitions. Word has length 64 [2019-12-26 21:12:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 70535 transitions. [2019-12-26 21:12:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 70535 transitions. [2019-12-26 21:12:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:26,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:26,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:26,069 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1837972597, now seen corresponding path program 3 times [2019-12-26 21:12:26,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788227944] [2019-12-26 21:12:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:26,154 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 21:12:26,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788227944] [2019-12-26 21:12:26,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:26,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:12:26,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622623816] [2019-12-26 21:12:26,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:26,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:26,156 INFO L87 Difference]: Start difference. First operand 23243 states and 70535 transitions. Second operand 7 states. [2019-12-26 21:12:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:26,772 INFO L93 Difference]: Finished difference Result 45600 states and 136196 transitions. [2019-12-26 21:12:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:12:26,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:26,871 INFO L225 Difference]: With dead ends: 45600 [2019-12-26 21:12:26,871 INFO L226 Difference]: Without dead ends: 42889 [2019-12-26 21:12:26,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:12:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42889 states. [2019-12-26 21:12:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42889 to 23339. [2019-12-26 21:12:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23339 states. [2019-12-26 21:12:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23339 states to 23339 states and 70879 transitions. [2019-12-26 21:12:27,725 INFO L78 Accepts]: Start accepts. Automaton has 23339 states and 70879 transitions. Word has length 64 [2019-12-26 21:12:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 23339 states and 70879 transitions. [2019-12-26 21:12:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23339 states and 70879 transitions. [2019-12-26 21:12:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:27,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:27,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:27,748 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1711686189, now seen corresponding path program 4 times [2019-12-26 21:12:27,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:27,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26536127] [2019-12-26 21:12:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:12:27,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26536127] [2019-12-26 21:12:27,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:27,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:12:27,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416482655] [2019-12-26 21:12:27,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:12:27,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:12:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:12:27,842 INFO L87 Difference]: Start difference. First operand 23339 states and 70879 transitions. Second operand 5 states. [2019-12-26 21:12:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:28,201 INFO L93 Difference]: Finished difference Result 25262 states and 76238 transitions. [2019-12-26 21:12:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:12:28,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 21:12:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:28,240 INFO L225 Difference]: With dead ends: 25262 [2019-12-26 21:12:28,240 INFO L226 Difference]: Without dead ends: 25262 [2019-12-26 21:12:28,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:12:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25262 states. [2019-12-26 21:12:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25262 to 23767. [2019-12-26 21:12:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23767 states. [2019-12-26 21:12:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23767 states to 23767 states and 72154 transitions. [2019-12-26 21:12:28,626 INFO L78 Accepts]: Start accepts. Automaton has 23767 states and 72154 transitions. Word has length 64 [2019-12-26 21:12:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:28,627 INFO L462 AbstractCegarLoop]: Abstraction has 23767 states and 72154 transitions. [2019-12-26 21:12:28,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:12:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23767 states and 72154 transitions. [2019-12-26 21:12:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:28,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:28,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:28,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1053051045, now seen corresponding path program 5 times [2019-12-26 21:12:28,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:28,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842128956] [2019-12-26 21:12:28,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:28,763 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 21:12:28,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842128956] [2019-12-26 21:12:28,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:28,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:12:28,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481066052] [2019-12-26 21:12:28,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:12:28,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:28,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:12:28,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:12:28,765 INFO L87 Difference]: Start difference. First operand 23767 states and 72154 transitions. Second operand 7 states. [2019-12-26 21:12:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:30,079 INFO L93 Difference]: Finished difference Result 45527 states and 136651 transitions. [2019-12-26 21:12:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:12:30,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:12:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:30,139 INFO L225 Difference]: With dead ends: 45527 [2019-12-26 21:12:30,139 INFO L226 Difference]: Without dead ends: 45359 [2019-12-26 21:12:30,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:12:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45359 states. [2019-12-26 21:12:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45359 to 29967. [2019-12-26 21:12:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-26 21:12:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 89774 transitions. [2019-12-26 21:12:30,691 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 89774 transitions. Word has length 64 [2019-12-26 21:12:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:30,691 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 89774 transitions. [2019-12-26 21:12:30,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:12:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 89774 transitions. [2019-12-26 21:12:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:12:30,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:30,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:30,731 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash -747078789, now seen corresponding path program 6 times [2019-12-26 21:12:30,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:30,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035299309] [2019-12-26 21:12:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:30,834 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 21:12:30,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035299309] [2019-12-26 21:12:30,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:30,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:30,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901157455] [2019-12-26 21:12:30,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:30,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:30,845 INFO L87 Difference]: Start difference. First operand 29967 states and 89774 transitions. Second operand 3 states. [2019-12-26 21:12:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:30,960 INFO L93 Difference]: Finished difference Result 29967 states and 89773 transitions. [2019-12-26 21:12:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:30,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:12:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:31,000 INFO L225 Difference]: With dead ends: 29967 [2019-12-26 21:12:31,001 INFO L226 Difference]: Without dead ends: 29967 [2019-12-26 21:12:31,001 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 21:12:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29967 states. [2019-12-26 21:12:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29967 to 25556. [2019-12-26 21:12:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25556 states. [2019-12-26 21:12:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25556 states to 25556 states and 77501 transitions. [2019-12-26 21:12:31,418 INFO L78 Accepts]: Start accepts. Automaton has 25556 states and 77501 transitions. Word has length 64 [2019-12-26 21:12:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:31,418 INFO L462 AbstractCegarLoop]: Abstraction has 25556 states and 77501 transitions. [2019-12-26 21:12:31,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 25556 states and 77501 transitions. [2019-12-26 21:12:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:12:31,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:31,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:31,444 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 1 times [2019-12-26 21:12:31,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:31,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871110670] [2019-12-26 21:12:31,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:31,498 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 21:12:31,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871110670] [2019-12-26 21:12:31,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:31,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:12:31,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771207072] [2019-12-26 21:12:31,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:12:31,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:12:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:12:31,500 INFO L87 Difference]: Start difference. First operand 25556 states and 77501 transitions. Second operand 3 states. [2019-12-26 21:12:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:31,582 INFO L93 Difference]: Finished difference Result 19100 states and 57362 transitions. [2019-12-26 21:12:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:31,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:12:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:31,614 INFO L225 Difference]: With dead ends: 19100 [2019-12-26 21:12:31,614 INFO L226 Difference]: Without dead ends: 19100 [2019-12-26 21:12:31,615 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 21:12:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19100 states. [2019-12-26 21:12:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19100 to 17794. [2019-12-26 21:12:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17794 states. [2019-12-26 21:12:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17794 states to 17794 states and 53432 transitions. [2019-12-26 21:12:31,886 INFO L78 Accepts]: Start accepts. Automaton has 17794 states and 53432 transitions. Word has length 65 [2019-12-26 21:12:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:31,886 INFO L462 AbstractCegarLoop]: Abstraction has 17794 states and 53432 transitions. [2019-12-26 21:12:31,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:12:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17794 states and 53432 transitions. [2019-12-26 21:12:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:31,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:31,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:31,903 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1653836464, now seen corresponding path program 1 times [2019-12-26 21:12:31,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:31,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386834529] [2019-12-26 21:12:31,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:32,068 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 21:12:32,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386834529] [2019-12-26 21:12:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:32,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:12:32,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617783455] [2019-12-26 21:12:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:12:32,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:12:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:12:32,070 INFO L87 Difference]: Start difference. First operand 17794 states and 53432 transitions. Second operand 10 states. [2019-12-26 21:12:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:33,312 INFO L93 Difference]: Finished difference Result 26381 states and 78919 transitions. [2019-12-26 21:12:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:12:33,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:12:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:33,341 INFO L225 Difference]: With dead ends: 26381 [2019-12-26 21:12:33,341 INFO L226 Difference]: Without dead ends: 21542 [2019-12-26 21:12:33,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:12:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21542 states. [2019-12-26 21:12:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21542 to 18207. [2019-12-26 21:12:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-26 21:12:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 54571 transitions. [2019-12-26 21:12:33,626 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 54571 transitions. Word has length 66 [2019-12-26 21:12:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:33,627 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 54571 transitions. [2019-12-26 21:12:33,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:12:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 54571 transitions. [2019-12-26 21:12:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:33,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:33,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:33,644 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1892421244, now seen corresponding path program 2 times [2019-12-26 21:12:33,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:33,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270279404] [2019-12-26 21:12:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:33,856 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 21:12:33,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270279404] [2019-12-26 21:12:33,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:33,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:33,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431685047] [2019-12-26 21:12:33,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:33,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:33,858 INFO L87 Difference]: Start difference. First operand 18207 states and 54571 transitions. Second operand 11 states. [2019-12-26 21:12:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:35,159 INFO L93 Difference]: Finished difference Result 23793 states and 70934 transitions. [2019-12-26 21:12:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:12:35,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:12:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:35,188 INFO L225 Difference]: With dead ends: 23793 [2019-12-26 21:12:35,188 INFO L226 Difference]: Without dead ends: 21302 [2019-12-26 21:12:35,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:12:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21302 states. [2019-12-26 21:12:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21302 to 18127. [2019-12-26 21:12:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18127 states. [2019-12-26 21:12:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18127 states to 18127 states and 54331 transitions. [2019-12-26 21:12:35,472 INFO L78 Accepts]: Start accepts. Automaton has 18127 states and 54331 transitions. Word has length 66 [2019-12-26 21:12:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:35,472 INFO L462 AbstractCegarLoop]: Abstraction has 18127 states and 54331 transitions. [2019-12-26 21:12:35,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18127 states and 54331 transitions. [2019-12-26 21:12:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:35,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:35,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:35,491 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash 846611000, now seen corresponding path program 3 times [2019-12-26 21:12:35,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:35,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147121854] [2019-12-26 21:12:35,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:35,622 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 21:12:35,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147121854] [2019-12-26 21:12:35,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:35,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:35,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636835766] [2019-12-26 21:12:35,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:12:35,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:12:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:12:35,624 INFO L87 Difference]: Start difference. First operand 18127 states and 54331 transitions. Second operand 9 states. [2019-12-26 21:12:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:37,499 INFO L93 Difference]: Finished difference Result 31723 states and 93457 transitions. [2019-12-26 21:12:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:12:37,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:12:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:37,541 INFO L225 Difference]: With dead ends: 31723 [2019-12-26 21:12:37,541 INFO L226 Difference]: Without dead ends: 31507 [2019-12-26 21:12:37,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:12:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31507 states. [2019-12-26 21:12:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31507 to 21089. [2019-12-26 21:12:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21089 states. [2019-12-26 21:12:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21089 states to 21089 states and 62967 transitions. [2019-12-26 21:12:37,921 INFO L78 Accepts]: Start accepts. Automaton has 21089 states and 62967 transitions. Word has length 66 [2019-12-26 21:12:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:37,921 INFO L462 AbstractCegarLoop]: Abstraction has 21089 states and 62967 transitions. [2019-12-26 21:12:37,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:12:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21089 states and 62967 transitions. [2019-12-26 21:12:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:37,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:37,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:37,941 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1362505834, now seen corresponding path program 4 times [2019-12-26 21:12:37,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:37,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808690678] [2019-12-26 21:12:37,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:38,132 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 21:12:38,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808690678] [2019-12-26 21:12:38,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:38,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:12:38,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810734294] [2019-12-26 21:12:38,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:12:38,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:12:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:12:38,134 INFO L87 Difference]: Start difference. First operand 21089 states and 62967 transitions. Second operand 10 states. [2019-12-26 21:12:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:39,415 INFO L93 Difference]: Finished difference Result 32812 states and 96821 transitions. [2019-12-26 21:12:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:12:39,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:12:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:39,454 INFO L225 Difference]: With dead ends: 32812 [2019-12-26 21:12:39,454 INFO L226 Difference]: Without dead ends: 27410 [2019-12-26 21:12:39,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:12:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27410 states. [2019-12-26 21:12:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27410 to 21670. [2019-12-26 21:12:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21670 states. [2019-12-26 21:12:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21670 states to 21670 states and 64322 transitions. [2019-12-26 21:12:39,805 INFO L78 Accepts]: Start accepts. Automaton has 21670 states and 64322 transitions. Word has length 66 [2019-12-26 21:12:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:39,805 INFO L462 AbstractCegarLoop]: Abstraction has 21670 states and 64322 transitions. [2019-12-26 21:12:39,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:12:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21670 states and 64322 transitions. [2019-12-26 21:12:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:39,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:39,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:39,825 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:39,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash 40066062, now seen corresponding path program 5 times [2019-12-26 21:12:39,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:39,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062508274] [2019-12-26 21:12:39,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:40,014 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 21:12:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062508274] [2019-12-26 21:12:40,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:40,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:40,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744063988] [2019-12-26 21:12:40,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:40,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:40,017 INFO L87 Difference]: Start difference. First operand 21670 states and 64322 transitions. Second operand 11 states. [2019-12-26 21:12:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:41,339 INFO L93 Difference]: Finished difference Result 31456 states and 92594 transitions. [2019-12-26 21:12:41,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:12:41,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:12:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:41,375 INFO L225 Difference]: With dead ends: 31456 [2019-12-26 21:12:41,375 INFO L226 Difference]: Without dead ends: 27097 [2019-12-26 21:12:41,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:12:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27097 states. [2019-12-26 21:12:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27097 to 21220. [2019-12-26 21:12:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-26 21:12:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 63019 transitions. [2019-12-26 21:12:41,727 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 63019 transitions. Word has length 66 [2019-12-26 21:12:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:41,727 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 63019 transitions. [2019-12-26 21:12:41,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 63019 transitions. [2019-12-26 21:12:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:41,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:41,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:41,747 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 132262848, now seen corresponding path program 6 times [2019-12-26 21:12:41,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:41,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461273724] [2019-12-26 21:12:41,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:41,950 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 21:12:41,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461273724] [2019-12-26 21:12:41,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:41,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:12:41,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733092967] [2019-12-26 21:12:41,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:12:41,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:12:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:12:41,953 INFO L87 Difference]: Start difference. First operand 21220 states and 63019 transitions. Second operand 12 states. [2019-12-26 21:12:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:44,073 INFO L93 Difference]: Finished difference Result 31210 states and 92376 transitions. [2019-12-26 21:12:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:12:44,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:12:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:44,110 INFO L225 Difference]: With dead ends: 31210 [2019-12-26 21:12:44,110 INFO L226 Difference]: Without dead ends: 26983 [2019-12-26 21:12:44,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:12:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26983 states. [2019-12-26 21:12:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26983 to 21562. [2019-12-26 21:12:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21562 states. [2019-12-26 21:12:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21562 states to 21562 states and 63857 transitions. [2019-12-26 21:12:44,635 INFO L78 Accepts]: Start accepts. Automaton has 21562 states and 63857 transitions. Word has length 66 [2019-12-26 21:12:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:44,635 INFO L462 AbstractCegarLoop]: Abstraction has 21562 states and 63857 transitions. [2019-12-26 21:12:44,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:12:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21562 states and 63857 transitions. [2019-12-26 21:12:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:44,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:44,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:44,658 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1172813812, now seen corresponding path program 7 times [2019-12-26 21:12:44,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:44,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18222789] [2019-12-26 21:12:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:44,812 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 21:12:44,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18222789] [2019-12-26 21:12:44,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:44,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:44,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063478895] [2019-12-26 21:12:44,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:44,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:44,814 INFO L87 Difference]: Start difference. First operand 21562 states and 63857 transitions. Second operand 11 states. [2019-12-26 21:12:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:46,049 INFO L93 Difference]: Finished difference Result 45939 states and 136185 transitions. [2019-12-26 21:12:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:12:46,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:12:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:46,103 INFO L225 Difference]: With dead ends: 45939 [2019-12-26 21:12:46,103 INFO L226 Difference]: Without dead ends: 43384 [2019-12-26 21:12:46,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:12:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43384 states. [2019-12-26 21:12:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43384 to 25320. [2019-12-26 21:12:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25320 states. [2019-12-26 21:12:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25320 states to 25320 states and 74507 transitions. [2019-12-26 21:12:46,603 INFO L78 Accepts]: Start accepts. Automaton has 25320 states and 74507 transitions. Word has length 66 [2019-12-26 21:12:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:46,603 INFO L462 AbstractCegarLoop]: Abstraction has 25320 states and 74507 transitions. [2019-12-26 21:12:46,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25320 states and 74507 transitions. [2019-12-26 21:12:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:46,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:46,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:46,629 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1318207092, now seen corresponding path program 8 times [2019-12-26 21:12:46,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:46,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432537505] [2019-12-26 21:12:46,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:46,779 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 21:12:46,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432537505] [2019-12-26 21:12:46,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:46,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:46,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795436012] [2019-12-26 21:12:46,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:46,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:46,781 INFO L87 Difference]: Start difference. First operand 25320 states and 74507 transitions. Second operand 11 states. [2019-12-26 21:12:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:47,955 INFO L93 Difference]: Finished difference Result 44000 states and 129031 transitions. [2019-12-26 21:12:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:12:47,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:12:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:48,000 INFO L225 Difference]: With dead ends: 44000 [2019-12-26 21:12:48,000 INFO L226 Difference]: Without dead ends: 35458 [2019-12-26 21:12:48,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:12:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35458 states. [2019-12-26 21:12:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35458 to 20200. [2019-12-26 21:12:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20200 states. [2019-12-26 21:12:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20200 states to 20200 states and 59867 transitions. [2019-12-26 21:12:48,398 INFO L78 Accepts]: Start accepts. Automaton has 20200 states and 59867 transitions. Word has length 66 [2019-12-26 21:12:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:48,398 INFO L462 AbstractCegarLoop]: Abstraction has 20200 states and 59867 transitions. [2019-12-26 21:12:48,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 20200 states and 59867 transitions. [2019-12-26 21:12:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:48,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:48,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:48,417 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -485440018, now seen corresponding path program 9 times [2019-12-26 21:12:48,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:48,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168252021] [2019-12-26 21:12:48,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:48,550 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 21:12:48,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168252021] [2019-12-26 21:12:48,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:48,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:48,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212335549] [2019-12-26 21:12:48,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:12:48,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:12:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:12:48,552 INFO L87 Difference]: Start difference. First operand 20200 states and 59867 transitions. Second operand 9 states. [2019-12-26 21:12:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:51,198 INFO L93 Difference]: Finished difference Result 35727 states and 103821 transitions. [2019-12-26 21:12:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:12:51,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:12:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:51,244 INFO L225 Difference]: With dead ends: 35727 [2019-12-26 21:12:51,244 INFO L226 Difference]: Without dead ends: 35343 [2019-12-26 21:12:51,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:12:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35343 states. [2019-12-26 21:12:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35343 to 21565. [2019-12-26 21:12:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21565 states. [2019-12-26 21:12:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21565 states to 21565 states and 64166 transitions. [2019-12-26 21:12:51,666 INFO L78 Accepts]: Start accepts. Automaton has 21565 states and 64166 transitions. Word has length 66 [2019-12-26 21:12:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:51,666 INFO L462 AbstractCegarLoop]: Abstraction has 21565 states and 64166 transitions. [2019-12-26 21:12:51,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:12:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21565 states and 64166 transitions. [2019-12-26 21:12:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:51,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:51,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:51,689 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash -30250858, now seen corresponding path program 10 times [2019-12-26 21:12:51,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:51,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91017130] [2019-12-26 21:12:51,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:51,916 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 21:12:51,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91017130] [2019-12-26 21:12:51,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:51,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:12:51,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252594661] [2019-12-26 21:12:51,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:12:51,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:12:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:12:51,918 INFO L87 Difference]: Start difference. First operand 21565 states and 64166 transitions. Second operand 10 states. [2019-12-26 21:12:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:54,525 INFO L93 Difference]: Finished difference Result 39704 states and 115969 transitions. [2019-12-26 21:12:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:12:54,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:12:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:54,578 INFO L225 Difference]: With dead ends: 39704 [2019-12-26 21:12:54,578 INFO L226 Difference]: Without dead ends: 39508 [2019-12-26 21:12:54,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-26 21:12:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39508 states. [2019-12-26 21:12:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39508 to 24391. [2019-12-26 21:12:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24391 states. [2019-12-26 21:12:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24391 states to 24391 states and 72254 transitions. [2019-12-26 21:12:55,067 INFO L78 Accepts]: Start accepts. Automaton has 24391 states and 72254 transitions. Word has length 66 [2019-12-26 21:12:55,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:55,067 INFO L462 AbstractCegarLoop]: Abstraction has 24391 states and 72254 transitions. [2019-12-26 21:12:55,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:12:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24391 states and 72254 transitions. [2019-12-26 21:12:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:12:55,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:55,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:55,095 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -222742524, now seen corresponding path program 11 times [2019-12-26 21:12:55,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:55,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511570977] [2019-12-26 21:12:55,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:55,182 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 21:12:55,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511570977] [2019-12-26 21:12:55,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:55,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:12:55,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331810654] [2019-12-26 21:12:55,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:12:55,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:12:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:12:55,184 INFO L87 Difference]: Start difference. First operand 24391 states and 72254 transitions. Second operand 4 states. [2019-12-26 21:12:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:55,375 INFO L93 Difference]: Finished difference Result 27961 states and 83192 transitions. [2019-12-26 21:12:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:12:55,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:12:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:55,439 INFO L225 Difference]: With dead ends: 27961 [2019-12-26 21:12:55,439 INFO L226 Difference]: Without dead ends: 27961 [2019-12-26 21:12:55,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 21:12:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27961 states. [2019-12-26 21:12:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27961 to 21387. [2019-12-26 21:12:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21387 states. [2019-12-26 21:12:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21387 states to 21387 states and 64177 transitions. [2019-12-26 21:12:56,221 INFO L78 Accepts]: Start accepts. Automaton has 21387 states and 64177 transitions. Word has length 66 [2019-12-26 21:12:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:56,222 INFO L462 AbstractCegarLoop]: Abstraction has 21387 states and 64177 transitions. [2019-12-26 21:12:56,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:12:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21387 states and 64177 transitions. [2019-12-26 21:12:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:56,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:56,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:56,245 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash -472703480, now seen corresponding path program 1 times [2019-12-26 21:12:56,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:56,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486077975] [2019-12-26 21:12:56,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:56,388 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 21:12:56,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486077975] [2019-12-26 21:12:56,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:56,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:56,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588691174] [2019-12-26 21:12:56,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:12:56,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:56,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:12:56,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:12:56,390 INFO L87 Difference]: Start difference. First operand 21387 states and 64177 transitions. Second operand 9 states. [2019-12-26 21:12:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:58,772 INFO L93 Difference]: Finished difference Result 33658 states and 98921 transitions. [2019-12-26 21:12:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:12:58,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 21:12:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:58,818 INFO L225 Difference]: With dead ends: 33658 [2019-12-26 21:12:58,818 INFO L226 Difference]: Without dead ends: 33658 [2019-12-26 21:12:58,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:12:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33658 states. [2019-12-26 21:12:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33658 to 22694. [2019-12-26 21:12:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22694 states. [2019-12-26 21:12:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22694 states to 22694 states and 67836 transitions. [2019-12-26 21:12:59,245 INFO L78 Accepts]: Start accepts. Automaton has 22694 states and 67836 transitions. Word has length 67 [2019-12-26 21:12:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:59,245 INFO L462 AbstractCegarLoop]: Abstraction has 22694 states and 67836 transitions. [2019-12-26 21:12:59,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:12:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22694 states and 67836 transitions. [2019-12-26 21:12:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:59,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:59,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:59,270 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:12:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1366538620, now seen corresponding path program 1 times [2019-12-26 21:12:59,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:59,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252742222] [2019-12-26 21:12:59,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:59,410 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 21:12:59,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252742222] [2019-12-26 21:12:59,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:59,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:59,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377534223] [2019-12-26 21:12:59,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:59,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:59,411 INFO L87 Difference]: Start difference. First operand 22694 states and 67836 transitions. Second operand 11 states. [2019-12-26 21:13:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:00,770 INFO L93 Difference]: Finished difference Result 27315 states and 80646 transitions. [2019-12-26 21:13:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:13:00,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:13:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:00,806 INFO L225 Difference]: With dead ends: 27315 [2019-12-26 21:13:00,807 INFO L226 Difference]: Without dead ends: 26676 [2019-12-26 21:13:00,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:13:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26676 states. [2019-12-26 21:13:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26676 to 22678. [2019-12-26 21:13:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22678 states. [2019-12-26 21:13:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22678 states to 22678 states and 67780 transitions. [2019-12-26 21:13:01,165 INFO L78 Accepts]: Start accepts. Automaton has 22678 states and 67780 transitions. Word has length 67 [2019-12-26 21:13:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:01,166 INFO L462 AbstractCegarLoop]: Abstraction has 22678 states and 67780 transitions. [2019-12-26 21:13:01,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:13:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 22678 states and 67780 transitions. [2019-12-26 21:13:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:01,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:01,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:01,190 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 2 times [2019-12-26 21:13:01,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947848958] [2019-12-26 21:13:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:13:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947848958] [2019-12-26 21:13:01,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:01,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:13:01,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83536838] [2019-12-26 21:13:01,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:13:01,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:13:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:13:01,354 INFO L87 Difference]: Start difference. First operand 22678 states and 67780 transitions. Second operand 12 states. [2019-12-26 21:13:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:02,398 INFO L93 Difference]: Finished difference Result 38334 states and 114850 transitions. [2019-12-26 21:13:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:13:02,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:13:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:02,447 INFO L225 Difference]: With dead ends: 38334 [2019-12-26 21:13:02,447 INFO L226 Difference]: Without dead ends: 37603 [2019-12-26 21:13:02,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:13:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2019-12-26 21:13:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 22218. [2019-12-26 21:13:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-26 21:13:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 66608 transitions. [2019-12-26 21:13:03,045 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 66608 transitions. Word has length 67 [2019-12-26 21:13:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:03,045 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 66608 transitions. [2019-12-26 21:13:03,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:13:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 66608 transitions. [2019-12-26 21:13:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:03,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:03,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:03,069 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash 63997864, now seen corresponding path program 2 times [2019-12-26 21:13:03,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:03,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781150819] [2019-12-26 21:13:03,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:03,249 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 21:13:03,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781150819] [2019-12-26 21:13:03,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:03,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:13:03,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838987301] [2019-12-26 21:13:03,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:13:03,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:13:03,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:13:03,251 INFO L87 Difference]: Start difference. First operand 22218 states and 66608 transitions. Second operand 10 states. [2019-12-26 21:13:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:05,574 INFO L93 Difference]: Finished difference Result 36977 states and 108578 transitions. [2019-12-26 21:13:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:13:05,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:13:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:05,624 INFO L225 Difference]: With dead ends: 36977 [2019-12-26 21:13:05,624 INFO L226 Difference]: Without dead ends: 36977 [2019-12-26 21:13:05,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-26 21:13:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36977 states. [2019-12-26 21:13:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36977 to 22220. [2019-12-26 21:13:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22220 states. [2019-12-26 21:13:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22220 states to 22220 states and 66501 transitions. [2019-12-26 21:13:06,080 INFO L78 Accepts]: Start accepts. Automaton has 22220 states and 66501 transitions. Word has length 67 [2019-12-26 21:13:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 22220 states and 66501 transitions. [2019-12-26 21:13:06,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:13:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 22220 states and 66501 transitions. [2019-12-26 21:13:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:06,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:06,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:06,105 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1827328022, now seen corresponding path program 3 times [2019-12-26 21:13:06,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:06,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477280941] [2019-12-26 21:13:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:13:06,203 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 21:13:06,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477280941] [2019-12-26 21:13:06,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:13:06,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:13:06,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464961931] [2019-12-26 21:13:06,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:13:06,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:13:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:13:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:13:06,204 INFO L87 Difference]: Start difference. First operand 22220 states and 66501 transitions. Second operand 5 states. [2019-12-26 21:13:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:13:06,351 INFO L93 Difference]: Finished difference Result 21822 states and 64982 transitions. [2019-12-26 21:13:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:13:06,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-26 21:13:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:13:06,379 INFO L225 Difference]: With dead ends: 21822 [2019-12-26 21:13:06,379 INFO L226 Difference]: Without dead ends: 21822 [2019-12-26 21:13:06,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:13:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2019-12-26 21:13:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 19176. [2019-12-26 21:13:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2019-12-26 21:13:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 57195 transitions. [2019-12-26 21:13:06,696 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 57195 transitions. Word has length 67 [2019-12-26 21:13:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:13:06,696 INFO L462 AbstractCegarLoop]: Abstraction has 19176 states and 57195 transitions. [2019-12-26 21:13:06,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:13:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 57195 transitions. [2019-12-26 21:13:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:13:06,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:13:06,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:13:06,718 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:13:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:13:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 3 times [2019-12-26 21:13:06,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:13:06,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288013556] [2019-12-26 21:13:06,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:13:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:13:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:13:06,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:13:06,859 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:13:06,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t68~0.base_32|) (= 0 v_~x~0_134) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_32|) |v_ULTIMATE.start_main_~#t68~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t68~0.base_32|)) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t68~0.base_32| 1)) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= |v_ULTIMATE.start_main_~#t68~0.offset_23| 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t68~0.base_32| 4)) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t68~0.offset=|v_ULTIMATE.start_main_~#t68~0.offset_23|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_16|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~y~0=v_~y~0_24, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t68~0.base=|v_ULTIMATE.start_main_~#t68~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t68~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t70~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t70~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t69~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t69~0.base, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t68~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:06,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff0_thd1~0_Out892430031 1) (= ~z$r_buff0_thd3~0_In892430031 ~z$r_buff1_thd3~0_Out892430031) (= ~z$r_buff0_thd2~0_In892430031 ~z$r_buff1_thd2~0_Out892430031) (= ~z$r_buff1_thd1~0_Out892430031 ~z$r_buff0_thd1~0_In892430031) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In892430031 0)) (= ~x~0_In892430031 ~__unbuffered_p0_EAX~0_Out892430031) (= ~z$r_buff1_thd0~0_Out892430031 ~z$r_buff0_thd0~0_In892430031)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In892430031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In892430031, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In892430031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In892430031, ~x~0=~x~0_In892430031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In892430031} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out892430031, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In892430031, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out892430031, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out892430031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out892430031, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out892430031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In892430031, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In892430031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out892430031, ~x~0=~x~0_In892430031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In892430031} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:06,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t69~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11|) 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t69~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11|) |v_ULTIMATE.start_main_~#t69~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t69~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t69~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t69~0.offset, #length, ULTIMATE.start_main_~#t69~0.base] because there is no mapped edge [2019-12-26 21:13:06,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1766931967 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1766931967| |P1Thread1of1ForFork2_#t~ite9_Out1766931967|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1766931967 256)))) (or (and (= ~z~0_In1766931967 |P1Thread1of1ForFork2_#t~ite9_Out1766931967|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1766931967| ~z$w_buff1~0_In1766931967) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1766931967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766931967, ~z$w_buff1~0=~z$w_buff1~0_In1766931967, ~z~0=~z~0_In1766931967} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1766931967|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1766931967, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1766931967|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766931967, ~z$w_buff1~0=~z$w_buff1~0_In1766931967, ~z~0=~z~0_In1766931967} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:13:06,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-150269462 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-150269462 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-150269462| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-150269462| ~z$w_buff0_used~0_In-150269462)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-150269462, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-150269462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-150269462, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-150269462|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-150269462} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:13:06,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (not (= |v_ULTIMATE.start_main_~#t70~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11|) |v_ULTIMATE.start_main_~#t70~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11| 1) |v_#valid_31|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t70~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t70~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t70~0.base_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t70~0.offset, ULTIMATE.start_main_~#t70~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 21:13:06,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-514585600 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-514585600 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-514585600 |P0Thread1of1ForFork1_#t~ite5_Out-514585600|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-514585600| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-514585600, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-514585600} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-514585600|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514585600, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-514585600} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:13:06,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In651510059 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In651510059 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In651510059 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In651510059 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out651510059|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In651510059 |P0Thread1of1ForFork1_#t~ite6_Out651510059|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In651510059, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In651510059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In651510059, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In651510059} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In651510059, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out651510059|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In651510059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In651510059, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In651510059} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:13:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-860431545 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-860431545 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-860431545)) (and (= ~z$r_buff0_thd1~0_In-860431545 ~z$r_buff0_thd1~0_Out-860431545) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-860431545, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-860431545} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-860431545, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-860431545|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-860431545} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:13:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1572020554 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1572020554 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1572020554 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1572020554 256)))) (or (and (= ~z$r_buff1_thd1~0_In1572020554 |P0Thread1of1ForFork1_#t~ite8_Out1572020554|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1572020554|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1572020554, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1572020554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1572020554, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1572020554} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1572020554|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1572020554, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1572020554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1572020554, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1572020554} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:13:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:13:06,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In449758443 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In449758443 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In449758443 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In449758443 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out449758443| ~z$w_buff1_used~0_In449758443) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out449758443|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In449758443, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In449758443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In449758443, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In449758443} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In449758443, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In449758443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In449758443, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out449758443|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In449758443} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:13:06,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1933081823 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1933081823 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1933081823| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1933081823| ~z$r_buff0_thd2~0_In-1933081823)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933081823, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933081823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933081823, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1933081823|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933081823} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:13:06,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1778089502 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1778089502 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1778089502 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1778089502 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1778089502|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In-1778089502 |P1Thread1of1ForFork2_#t~ite14_Out-1778089502|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1778089502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1778089502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778089502, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1778089502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1778089502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1778089502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778089502, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1778089502|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1778089502} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:13:06,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:13:06,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In677706599 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In677706599| |P2Thread1of1ForFork0_#t~ite29_Out677706599|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out677706599| ~z$w_buff1_used~0_In677706599)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In677706599 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In677706599 256)) (and (= (mod ~z$w_buff1_used~0_In677706599 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In677706599 256))))) (= |P2Thread1of1ForFork0_#t~ite29_Out677706599| |P2Thread1of1ForFork0_#t~ite30_Out677706599|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out677706599| ~z$w_buff1_used~0_In677706599)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In677706599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In677706599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677706599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677706599, ~weak$$choice2~0=~weak$$choice2~0_In677706599, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In677706599|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In677706599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In677706599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677706599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677706599, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out677706599|, ~weak$$choice2~0=~weak$$choice2~0_In677706599, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out677706599|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:13:06,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:13:06,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:13:06,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1610366420 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1610366420 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1610366420 |P2Thread1of1ForFork0_#t~ite38_Out1610366420|) (not .cse1)) (and (= ~z~0_In1610366420 |P2Thread1of1ForFork0_#t~ite38_Out1610366420|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1610366420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1610366420, ~z$w_buff1~0=~z$w_buff1~0_In1610366420, ~z~0=~z~0_In1610366420} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1610366420|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1610366420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1610366420, ~z$w_buff1~0=~z$w_buff1~0_In1610366420, ~z~0=~z~0_In1610366420} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:13:06,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:13:06,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1423187001 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1423187001 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1423187001|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1423187001 |P2Thread1of1ForFork0_#t~ite40_Out1423187001|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1423187001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1423187001} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1423187001, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1423187001|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1423187001} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:13:06,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1636305463 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1636305463 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1636305463 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1636305463 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1636305463| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1636305463| ~z$w_buff1_used~0_In1636305463) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1636305463, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1636305463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1636305463, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1636305463} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1636305463, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1636305463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1636305463, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1636305463, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1636305463|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:13:06,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1316257874 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1316257874 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1316257874| ~z$r_buff0_thd3~0_In-1316257874) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1316257874| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1316257874, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1316257874} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1316257874, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1316257874, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1316257874|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:13:06,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1834565387 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1834565387 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1834565387 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1834565387 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1834565387 |P2Thread1of1ForFork0_#t~ite43_Out-1834565387|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1834565387|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834565387, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834565387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834565387, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834565387} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1834565387|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834565387, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834565387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834565387, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834565387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:13:06,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:13:06,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:13:06,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1443395898 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1443395898 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1443395898| |ULTIMATE.start_main_#t~ite48_Out1443395898|))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1443395898| ~z$w_buff1~0_In1443395898)) (and (or .cse2 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1443395898| ~z~0_In1443395898) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1443395898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1443395898, ~z$w_buff1~0=~z$w_buff1~0_In1443395898, ~z~0=~z~0_In1443395898} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1443395898, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1443395898|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1443395898, ~z$w_buff1~0=~z$w_buff1~0_In1443395898, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1443395898|, ~z~0=~z~0_In1443395898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:13:06,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In159472598 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In159472598 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out159472598| ~z$w_buff0_used~0_In159472598) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out159472598| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In159472598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In159472598} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In159472598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In159472598, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out159472598|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:13:06,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-439061420 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-439061420 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-439061420 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-439061420 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-439061420|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-439061420 |ULTIMATE.start_main_#t~ite50_Out-439061420|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-439061420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-439061420, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-439061420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-439061420} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-439061420|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-439061420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-439061420, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-439061420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-439061420} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:13:06,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1875038035 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1875038035 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1875038035| ~z$r_buff0_thd0~0_In-1875038035)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1875038035| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1875038035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875038035} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1875038035, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1875038035|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1875038035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:13:06,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1261508802 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1261508802 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1261508802 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1261508802 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1261508802 |ULTIMATE.start_main_#t~ite52_Out1261508802|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1261508802|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261508802, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261508802, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1261508802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1261508802} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1261508802|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261508802, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261508802, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1261508802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1261508802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:13:06,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:13:06,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:13:06 BasicIcfg [2019-12-26 21:13:06,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:13:06,994 INFO L168 Benchmark]: Toolchain (without parser) took 126508.33 ms. Allocated memory was 138.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.8 MB in the beginning and 1.0 GB in the end (delta: -919.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,995 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.58 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.66 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,996 INFO L168 Benchmark]: Boogie Preprocessor took 38.94 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,996 INFO L168 Benchmark]: RCFGBuilder took 1089.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,997 INFO L168 Benchmark]: TraceAbstraction took 124514.95 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.7 MB in the beginning and 1.0 GB in the end (delta: -920.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-26 21:13:06,999 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.32 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.58 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 156.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.66 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.94 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1089.82 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 100.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124514.95 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.7 MB in the beginning and 1.0 GB in the end (delta: -920.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t68, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t69, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t70, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.1s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10769 SDtfs, 11611 SDslu, 40141 SDs, 0 SdLazy, 25421 SolverSat, 409 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 546 GetRequests, 69 SyntacticMatches, 38 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 325186 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1949 NumberOfCodeBlocks, 1949 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1843 ConstructedInterpolants, 0 QuantifiedInterpolants, 480698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...