/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:55:03,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:55:03,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:55:03,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:55:03,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:55:03,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:55:03,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:55:03,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:55:03,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:55:03,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:55:03,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:55:03,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:55:03,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:55:03,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:55:03,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:55:03,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:55:03,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:55:03,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:55:03,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:55:03,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:55:03,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:55:03,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:55:03,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:55:03,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:55:03,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:55:03,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:55:03,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:55:03,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:55:03,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:55:03,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:55:03,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:55:03,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:55:03,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:55:03,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:55:03,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:55:03,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:55:03,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:55:03,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:55:03,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:55:03,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:55:03,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:55:03,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:55:03,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:55:03,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:55:03,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:55:03,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:55:03,411 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:55:03,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:55:03,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:55:03,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:55:03,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:55:03,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:55:03,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:55:03,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:55:03,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:55:03,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:55:03,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:55:03,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:55:03,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:55:03,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:55:03,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:55:03,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:55:03,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:55:03,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:55:03,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:55:03,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:55:03,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:55:03,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:55:03,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:55:03,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:55:03,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:55:03,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:55:03,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:55:03,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:55:03,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:55:03,725 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:55:03,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i [2019-12-27 01:55:03,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce641da9/f678bac83ccf4650b01a00ab9dea668f/FLAGfa616af37 [2019-12-27 01:55:04,422 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:55:04,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i [2019-12-27 01:55:04,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce641da9/f678bac83ccf4650b01a00ab9dea668f/FLAGfa616af37 [2019-12-27 01:55:04,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce641da9/f678bac83ccf4650b01a00ab9dea668f [2019-12-27 01:55:04,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:55:04,706 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:55:04,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:55:04,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:55:04,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:55:04,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:55:04" (1/1) ... [2019-12-27 01:55:04,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75213e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:04, skipping insertion in model container [2019-12-27 01:55:04,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:55:04" (1/1) ... [2019-12-27 01:55:04,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:55:04,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:55:05,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:55:05,379 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:55:05,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:55:05,525 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:55:05,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05 WrapperNode [2019-12-27 01:55:05,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:55:05,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:55:05,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:55:05,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:55:05,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:55:05,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:55:05,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:55:05,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:55:05,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... [2019-12-27 01:55:05,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:55:05,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:55:05,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:55:05,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:55:05,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:55:05,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:55:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:55:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:55:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:55:05,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:55:05,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:55:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:55:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:55:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:55:05,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:55:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:55:05,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:55:05,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:55:05,712 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:55:06,458 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:55:06,458 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:55:06,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:55:06 BoogieIcfgContainer [2019-12-27 01:55:06,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:55:06,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:55:06,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:55:06,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:55:06,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:55:04" (1/3) ... [2019-12-27 01:55:06,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2f3ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:55:06, skipping insertion in model container [2019-12-27 01:55:06,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:55:05" (2/3) ... [2019-12-27 01:55:06,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2f3ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:55:06, skipping insertion in model container [2019-12-27 01:55:06,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:55:06" (3/3) ... [2019-12-27 01:55:06,470 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.oepc.i [2019-12-27 01:55:06,480 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:55:06,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:55:06,492 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:55:06,493 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:55:06,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,574 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:55:06,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:55:06,688 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:55:06,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:55:06,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:55:06,689 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:55:06,689 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:55:06,689 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:55:06,689 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:55:06,689 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:55:06,710 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:55:06,712 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:55:06,830 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:55:06,830 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:55:06,848 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 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:55:06,871 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:55:06,930 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:55:06,930 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:55:06,938 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 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:55:06,959 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:55:06,960 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:55:08,399 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 01:55:12,057 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 01:55:12,475 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:55:12,624 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:55:12,643 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-27 01:55:12,643 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 01:55:12,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 01:55:32,732 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 01:55:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 01:55:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:55:32,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:32,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:55:32,741 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-27 01:55:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 01:55:32,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698458313] [2019-12-27 01:55:32,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:32,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698458313] [2019-12-27 01:55:32,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:32,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:55:32,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108119166] [2019-12-27 01:55:32,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:32,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:32,990 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 01:55:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:34,807 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-27 01:55:34,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:34,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:55:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:35,650 INFO L225 Difference]: With dead ends: 114110 [2019-12-27 01:55:35,650 INFO L226 Difference]: Without dead ends: 107012 [2019-12-27 01:55:35,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-27 01:55:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-27 01:55:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-27 01:55:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-27 01:55:50,585 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-27 01:55:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:50,586 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-27 01:55:50,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-27 01:55:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:55:50,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:50,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:50,591 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-27 01:55:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-27 01:55:50,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:50,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889398117] [2019-12-27 01:55:50,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:50,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889398117] [2019-12-27 01:55:50,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:50,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:50,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567553496] [2019-12-27 01:55:50,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:50,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:50,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:50,696 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-27 01:55:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:52,759 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-27 01:55:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:52,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:55:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:53,299 INFO L225 Difference]: With dead ends: 166210 [2019-12-27 01:55:53,299 INFO L226 Difference]: Without dead ends: 166161 [2019-12-27 01:55:53,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-27 01:56:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-27 01:56:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-27 01:56:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-27 01:56:06,189 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-27 01:56:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:06,190 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-27 01:56:06,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-27 01:56:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:56:06,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:06,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:06,198 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-27 01:56:06,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-27 01:56:06,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:06,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532783566] [2019-12-27 01:56:06,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:06,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532783566] [2019-12-27 01:56:06,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:06,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:06,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77861059] [2019-12-27 01:56:06,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:06,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:06,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:06,277 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-27 01:56:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:06,397 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-27 01:56:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:06,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:56:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:06,465 INFO L225 Difference]: With dead ends: 33068 [2019-12-27 01:56:06,466 INFO L226 Difference]: Without dead ends: 33068 [2019-12-27 01:56:06,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-27 01:56:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-27 01:56:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 01:56:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-27 01:56:11,739 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-27 01:56:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:11,740 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-27 01:56:11,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-27 01:56:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:56:11,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:11,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:11,743 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-27 01:56:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-27 01:56:11,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:11,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486815834] [2019-12-27 01:56:11,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:11,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486815834] [2019-12-27 01:56:11,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:11,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:11,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001878493] [2019-12-27 01:56:11,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:56:11,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:11,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:56:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:11,878 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-27 01:56:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:12,350 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-27 01:56:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:56:12,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:56:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:12,440 INFO L225 Difference]: With dead ends: 45410 [2019-12-27 01:56:12,441 INFO L226 Difference]: Without dead ends: 45410 [2019-12-27 01:56:12,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-27 01:56:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-27 01:56:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-27 01:56:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-27 01:56:13,612 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-27 01:56:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:13,613 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-27 01:56:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:56:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-27 01:56:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:56:13,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:13,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:13,623 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-27 01:56:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-27 01:56:13,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:13,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017225459] [2019-12-27 01:56:13,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:13,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017225459] [2019-12-27 01:56:13,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:13,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:13,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129015151] [2019-12-27 01:56:13,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:56:13,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:56:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:56:13,721 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-27 01:56:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:14,725 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-27 01:56:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:56:14,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 01:56:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:14,825 INFO L225 Difference]: With dead ends: 56872 [2019-12-27 01:56:14,826 INFO L226 Difference]: Without dead ends: 56865 [2019-12-27 01:56:14,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:56:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-27 01:56:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-27 01:56:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-27 01:56:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-27 01:56:16,159 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-27 01:56:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:16,159 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-27 01:56:16,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:56:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-27 01:56:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:56:16,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:16,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:16,173 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-27 01:56:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-27 01:56:16,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:16,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220018135] [2019-12-27 01:56:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:16,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220018135] [2019-12-27 01:56:16,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:16,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:16,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159598507] [2019-12-27 01:56:16,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:16,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:16,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:16,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:16,287 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-27 01:56:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:16,350 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-27 01:56:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:56:16,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:56:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:16,375 INFO L225 Difference]: With dead ends: 16014 [2019-12-27 01:56:16,375 INFO L226 Difference]: Without dead ends: 16014 [2019-12-27 01:56:16,376 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-27 01:56:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-27 01:56:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-27 01:56:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 01:56:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-27 01:56:16,609 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-27 01:56:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:16,609 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-27 01:56:16,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-27 01:56:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:56:16,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:16,621 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-27 01:56:16,621 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-27 01:56:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-27 01:56:16,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:16,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042422541] [2019-12-27 01:56:16,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:16,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042422541] [2019-12-27 01:56:16,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:16,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:16,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396498467] [2019-12-27 01:56:16,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:56:16,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:56:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:56:16,719 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-27 01:56:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:17,298 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-27 01:56:17,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:56:17,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:56:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:17,341 INFO L225 Difference]: With dead ends: 22624 [2019-12-27 01:56:17,341 INFO L226 Difference]: Without dead ends: 22624 [2019-12-27 01:56:17,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:56:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-27 01:56:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-27 01:56:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-27 01:56:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-27 01:56:17,667 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-27 01:56:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:17,667 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-27 01:56:17,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:56:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-27 01:56:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:56:17,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:17,685 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-27 01:56:17,685 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-27 01:56:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-27 01:56:17,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:17,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598123455] [2019-12-27 01:56:17,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:17,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598123455] [2019-12-27 01:56:17,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:17,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:56:17,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365037174] [2019-12-27 01:56:17,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:17,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:17,794 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-27 01:56:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:18,972 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-27 01:56:18,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:56:18,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:56:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:19,010 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 01:56:19,011 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 01:56:19,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:56:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 01:56:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-27 01:56:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-27 01:56:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-27 01:56:19,567 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-27 01:56:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-27 01:56:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-27 01:56:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:56:19,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:19,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:19,591 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-27 01:56:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-27 01:56:19,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:19,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695650988] [2019-12-27 01:56:19,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695650988] [2019-12-27 01:56:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:19,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:19,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630622948] [2019-12-27 01:56:19,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:19,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:19,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:19,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:19,691 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-27 01:56:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:19,842 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-27 01:56:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:19,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:56:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:19,880 INFO L225 Difference]: With dead ends: 31245 [2019-12-27 01:56:19,880 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 01:56:19,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 01:56:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-27 01:56:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 01:56:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-27 01:56:20,293 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-27 01:56:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:20,293 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-27 01:56:20,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-27 01:56:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:56:20,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:20,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:20,325 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-27 01:56:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:20,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-27 01:56:20,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:20,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773383022] [2019-12-27 01:56:20,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:20,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-27 01:56:20,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773383022] [2019-12-27 01:56:20,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:20,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:20,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063579669] [2019-12-27 01:56:20,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:20,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:20,428 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-27 01:56:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:20,522 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-27 01:56:20,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:56:20,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:56:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:20,536 INFO L225 Difference]: With dead ends: 24032 [2019-12-27 01:56:20,536 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 01:56:20,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 01:56:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-27 01:56:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-27 01:56:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-27 01:56:20,684 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-27 01:56:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:20,685 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-27 01:56:20,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:56:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-27 01:56:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:56:20,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:20,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:20,698 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-27 01:56:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-27 01:56:20,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:20,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263955828] [2019-12-27 01:56:20,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:20,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263955828] [2019-12-27 01:56:20,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:20,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:56:20,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498705624] [2019-12-27 01:56:20,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:56:20,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:56:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:56:20,763 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-27 01:56:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:20,815 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-27 01:56:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:56:20,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:56:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:20,826 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 01:56:20,826 INFO L226 Difference]: Without dead ends: 6480 [2019-12-27 01:56:20,827 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-27 01:56:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-27 01:56:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-27 01:56:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-27 01:56:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-27 01:56:20,933 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-27 01:56:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:20,934 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-27 01:56:20,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:56:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-27 01:56:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:20,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:20,942 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-27 01:56:20,942 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-27 01:56:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-27 01:56:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769421446] [2019-12-27 01:56:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:21,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769421446] [2019-12-27 01:56:21,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:21,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:21,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003339095] [2019-12-27 01:56:21,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:21,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:21,004 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-27 01:56:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:21,076 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-27 01:56:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:21,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:56:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:21,093 INFO L225 Difference]: With dead ends: 9612 [2019-12-27 01:56:21,094 INFO L226 Difference]: Without dead ends: 9612 [2019-12-27 01:56:21,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-27 01:56:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-27 01:56:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-27 01:56:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-27 01:56:21,261 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-27 01:56:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:21,261 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-27 01:56:21,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-27 01:56:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:21,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:21,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] [2019-12-27 01:56:21,270 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-27 01:56:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-27 01:56:21,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:21,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425407132] [2019-12-27 01:56:21,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:21,522 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 01:56:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:21,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425407132] [2019-12-27 01:56:21,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:21,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:56:21,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391734695] [2019-12-27 01:56:21,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:21,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:21,554 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-27 01:56:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:21,849 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-27 01:56:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:56:21,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:56:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:21,867 INFO L225 Difference]: With dead ends: 14786 [2019-12-27 01:56:21,867 INFO L226 Difference]: Without dead ends: 11103 [2019-12-27 01:56:21,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-27 01:56:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-27 01:56:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-27 01:56:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-27 01:56:22,028 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-27 01:56:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:22,028 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-27 01:56:22,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-27 01:56:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:22,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:22,041 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-27 01:56:22,041 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-27 01:56:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-27 01:56:22,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:22,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977503036] [2019-12-27 01:56:22,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:22,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977503036] [2019-12-27 01:56:22,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:22,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:56:22,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710690644] [2019-12-27 01:56:22,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:56:22,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:56:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:56:22,133 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-27 01:56:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:22,445 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-27 01:56:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:56:22,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:56:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:22,476 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 01:56:22,476 INFO L226 Difference]: Without dead ends: 12623 [2019-12-27 01:56:22,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-27 01:56:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-27 01:56:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-27 01:56:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-27 01:56:22,785 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-27 01:56:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:22,785 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-27 01:56:22,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:56:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-27 01:56:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:22,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:22,801 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-27 01:56:22,801 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-27 01:56:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-27 01:56:22,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:22,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571852254] [2019-12-27 01:56:22,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:22,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571852254] [2019-12-27 01:56:22,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:22,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:22,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493538374] [2019-12-27 01:56:22,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:22,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:22,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:22,954 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-27 01:56:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:24,157 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-27 01:56:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:56:24,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:56:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:24,219 INFO L225 Difference]: With dead ends: 36233 [2019-12-27 01:56:24,219 INFO L226 Difference]: Without dead ends: 32009 [2019-12-27 01:56:24,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:56:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-27 01:56:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-27 01:56:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-27 01:56:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-27 01:56:24,611 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-27 01:56:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:24,611 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-27 01:56:24,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:56:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-27 01:56:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:24,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:24,626 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-27 01:56:24,626 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-27 01:56:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-27 01:56:24,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:24,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209325792] [2019-12-27 01:56:24,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:24,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209325792] [2019-12-27 01:56:24,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:24,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:56:24,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113233272] [2019-12-27 01:56:24,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:24,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:24,672 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-27 01:56:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:24,751 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-27 01:56:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:24,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:56:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:24,769 INFO L225 Difference]: With dead ends: 12867 [2019-12-27 01:56:24,769 INFO L226 Difference]: Without dead ends: 12867 [2019-12-27 01:56:24,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-27 01:56:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-27 01:56:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-27 01:56:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-27 01:56:25,135 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-27 01:56:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:25,136 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-27 01:56:25,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-27 01:56:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:25,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:25,153 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-27 01:56:25,153 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-27 01:56:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-27 01:56:25,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:25,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799989373] [2019-12-27 01:56:25,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:25,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799989373] [2019-12-27 01:56:25,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:25,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:25,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330307268] [2019-12-27 01:56:25,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:25,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:25,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:25,290 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-27 01:56:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:26,322 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-27 01:56:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:56:26,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:56:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:26,359 INFO L225 Difference]: With dead ends: 28791 [2019-12-27 01:56:26,359 INFO L226 Difference]: Without dead ends: 26476 [2019-12-27 01:56:26,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:56:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-27 01:56:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-27 01:56:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-27 01:56:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-27 01:56:26,623 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-27 01:56:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:26,623 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-27 01:56:26,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:56:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-27 01:56:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:56:26,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:26,634 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-27 01:56:26,634 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-27 01:56:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-27 01:56:26,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:26,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888873478] [2019-12-27 01:56:26,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888873478] [2019-12-27 01:56:26,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:26,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:26,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107998498] [2019-12-27 01:56:26,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:26,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:26,700 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 3 states. [2019-12-27 01:56:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:26,791 INFO L93 Difference]: Finished difference Result 12415 states and 38850 transitions. [2019-12-27 01:56:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:26,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:56:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:26,813 INFO L225 Difference]: With dead ends: 12415 [2019-12-27 01:56:26,814 INFO L226 Difference]: Without dead ends: 12415 [2019-12-27 01:56:26,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2019-12-27 01:56:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 11167. [2019-12-27 01:56:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11167 states. [2019-12-27 01:56:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11167 states to 11167 states and 35106 transitions. [2019-12-27 01:56:26,997 INFO L78 Accepts]: Start accepts. Automaton has 11167 states and 35106 transitions. Word has length 64 [2019-12-27 01:56:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:26,998 INFO L462 AbstractCegarLoop]: Abstraction has 11167 states and 35106 transitions. [2019-12-27 01:56:26,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11167 states and 35106 transitions. [2019-12-27 01:56:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:56:27,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:27,011 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-27 01:56:27,011 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-27 01:56:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1436762006, now seen corresponding path program 1 times [2019-12-27 01:56:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:27,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745955294] [2019-12-27 01:56:27,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:27,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745955294] [2019-12-27 01:56:27,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:27,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:27,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542465902] [2019-12-27 01:56:27,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:27,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:27,138 INFO L87 Difference]: Start difference. First operand 11167 states and 35106 transitions. Second operand 9 states. [2019-12-27 01:56:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:27,992 INFO L93 Difference]: Finished difference Result 24122 states and 73292 transitions. [2019-12-27 01:56:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:56:27,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:56:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:28,020 INFO L225 Difference]: With dead ends: 24122 [2019-12-27 01:56:28,020 INFO L226 Difference]: Without dead ends: 21209 [2019-12-27 01:56:28,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:56:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21209 states. [2019-12-27 01:56:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21209 to 10873. [2019-12-27 01:56:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10873 states. [2019-12-27 01:56:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 34055 transitions. [2019-12-27 01:56:28,467 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 34055 transitions. Word has length 65 [2019-12-27 01:56:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:28,467 INFO L462 AbstractCegarLoop]: Abstraction has 10873 states and 34055 transitions. [2019-12-27 01:56:28,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:56:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 34055 transitions. [2019-12-27 01:56:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:56:28,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:28,479 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-27 01:56:28,479 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-27 01:56:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash 191844726, now seen corresponding path program 2 times [2019-12-27 01:56:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686573463] [2019-12-27 01:56:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:28,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686573463] [2019-12-27 01:56:28,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:28,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:28,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181799397] [2019-12-27 01:56:28,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:28,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:28,593 INFO L87 Difference]: Start difference. First operand 10873 states and 34055 transitions. Second operand 9 states. [2019-12-27 01:56:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:29,529 INFO L93 Difference]: Finished difference Result 25466 states and 77294 transitions. [2019-12-27 01:56:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:56:29,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:56:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:29,559 INFO L225 Difference]: With dead ends: 25466 [2019-12-27 01:56:29,560 INFO L226 Difference]: Without dead ends: 22576 [2019-12-27 01:56:29,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:56:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22576 states. [2019-12-27 01:56:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22576 to 10803. [2019-12-27 01:56:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10803 states. [2019-12-27 01:56:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 33722 transitions. [2019-12-27 01:56:29,799 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 33722 transitions. Word has length 65 [2019-12-27 01:56:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:29,799 INFO L462 AbstractCegarLoop]: Abstraction has 10803 states and 33722 transitions. [2019-12-27 01:56:29,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:56:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 33722 transitions. [2019-12-27 01:56:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:56:29,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:29,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:29,810 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-27 01:56:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1224133449, now seen corresponding path program 1 times [2019-12-27 01:56:29,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:29,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222951998] [2019-12-27 01:56:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:29,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222951998] [2019-12-27 01:56:29,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:29,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:29,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142614996] [2019-12-27 01:56:29,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:29,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:29,867 INFO L87 Difference]: Start difference. First operand 10803 states and 33722 transitions. Second operand 3 states. [2019-12-27 01:56:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:29,914 INFO L93 Difference]: Finished difference Result 8980 states and 27417 transitions. [2019-12-27 01:56:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:29,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:56:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:29,929 INFO L225 Difference]: With dead ends: 8980 [2019-12-27 01:56:29,929 INFO L226 Difference]: Without dead ends: 8980 [2019-12-27 01:56:29,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8980 states. [2019-12-27 01:56:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8980 to 8980. [2019-12-27 01:56:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2019-12-27 01:56:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 27417 transitions. [2019-12-27 01:56:30,148 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 27417 transitions. Word has length 65 [2019-12-27 01:56:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:30,149 INFO L462 AbstractCegarLoop]: Abstraction has 8980 states and 27417 transitions. [2019-12-27 01:56:30,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 27417 transitions. [2019-12-27 01:56:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:30,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:30,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:30,166 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-27 01:56:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1594529229, now seen corresponding path program 1 times [2019-12-27 01:56:30,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:30,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301622505] [2019-12-27 01:56:30,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:30,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301622505] [2019-12-27 01:56:30,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:30,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:56:30,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628805093] [2019-12-27 01:56:30,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:56:30,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:56:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:56:30,285 INFO L87 Difference]: Start difference. First operand 8980 states and 27417 transitions. Second operand 8 states. [2019-12-27 01:56:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:31,049 INFO L93 Difference]: Finished difference Result 15994 states and 48223 transitions. [2019-12-27 01:56:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:56:31,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 01:56:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:31,066 INFO L225 Difference]: With dead ends: 15994 [2019-12-27 01:56:31,067 INFO L226 Difference]: Without dead ends: 12031 [2019-12-27 01:56:31,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:56:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2019-12-27 01:56:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 9444. [2019-12-27 01:56:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2019-12-27 01:56:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 28570 transitions. [2019-12-27 01:56:31,224 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 28570 transitions. Word has length 66 [2019-12-27 01:56:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:31,224 INFO L462 AbstractCegarLoop]: Abstraction has 9444 states and 28570 transitions. [2019-12-27 01:56:31,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:56:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 28570 transitions. [2019-12-27 01:56:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:31,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:31,234 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-27 01:56:31,234 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-27 01:56:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1923158013, now seen corresponding path program 2 times [2019-12-27 01:56:31,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:31,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600408629] [2019-12-27 01:56:31,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:31,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600408629] [2019-12-27 01:56:31,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:31,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:31,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79239606] [2019-12-27 01:56:31,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:56:31,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:56:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:56:31,376 INFO L87 Difference]: Start difference. First operand 9444 states and 28570 transitions. Second operand 9 states. [2019-12-27 01:56:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:32,182 INFO L93 Difference]: Finished difference Result 15258 states and 45563 transitions. [2019-12-27 01:56:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:56:32,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 01:56:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:32,201 INFO L225 Difference]: With dead ends: 15258 [2019-12-27 01:56:32,201 INFO L226 Difference]: Without dead ends: 11711 [2019-12-27 01:56:32,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:56:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11711 states. [2019-12-27 01:56:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11711 to 9284. [2019-12-27 01:56:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9284 states. [2019-12-27 01:56:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 28042 transitions. [2019-12-27 01:56:32,561 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 28042 transitions. Word has length 66 [2019-12-27 01:56:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:32,562 INFO L462 AbstractCegarLoop]: Abstraction has 9284 states and 28042 transitions. [2019-12-27 01:56:32,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:56:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 28042 transitions. [2019-12-27 01:56:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:32,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:32,572 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-27 01:56:32,572 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-27 01:56:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1918437107, now seen corresponding path program 3 times [2019-12-27 01:56:32,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:32,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813971429] [2019-12-27 01:56:32,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:32,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813971429] [2019-12-27 01:56:32,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:32,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:32,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973389638] [2019-12-27 01:56:32,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:56:32,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:56:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:56:32,753 INFO L87 Difference]: Start difference. First operand 9284 states and 28042 transitions. Second operand 10 states. [2019-12-27 01:56:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:33,565 INFO L93 Difference]: Finished difference Result 15421 states and 45863 transitions. [2019-12-27 01:56:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:56:33,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 01:56:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:33,582 INFO L225 Difference]: With dead ends: 15421 [2019-12-27 01:56:33,582 INFO L226 Difference]: Without dead ends: 12182 [2019-12-27 01:56:33,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:56:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12182 states. [2019-12-27 01:56:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12182 to 9324. [2019-12-27 01:56:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9324 states. [2019-12-27 01:56:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9324 states to 9324 states and 28092 transitions. [2019-12-27 01:56:33,742 INFO L78 Accepts]: Start accepts. Automaton has 9324 states and 28092 transitions. Word has length 66 [2019-12-27 01:56:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:33,742 INFO L462 AbstractCegarLoop]: Abstraction has 9324 states and 28092 transitions. [2019-12-27 01:56:33,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:56:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9324 states and 28092 transitions. [2019-12-27 01:56:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:33,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:33,752 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-27 01:56:33,752 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-27 01:56:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1375937223, now seen corresponding path program 4 times [2019-12-27 01:56:33,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:33,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169695257] [2019-12-27 01:56:33,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:33,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169695257] [2019-12-27 01:56:33,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:33,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:56:33,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029051712] [2019-12-27 01:56:33,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:56:33,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:56:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:56:33,912 INFO L87 Difference]: Start difference. First operand 9324 states and 28092 transitions. Second operand 11 states. [2019-12-27 01:56:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:34,718 INFO L93 Difference]: Finished difference Result 14541 states and 43211 transitions. [2019-12-27 01:56:34,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:56:34,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:56:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:34,734 INFO L225 Difference]: With dead ends: 14541 [2019-12-27 01:56:34,734 INFO L226 Difference]: Without dead ends: 11402 [2019-12-27 01:56:34,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:56:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2019-12-27 01:56:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 9020. [2019-12-27 01:56:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9020 states. [2019-12-27 01:56:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 27190 transitions. [2019-12-27 01:56:34,887 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 27190 transitions. Word has length 66 [2019-12-27 01:56:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:34,887 INFO L462 AbstractCegarLoop]: Abstraction has 9020 states and 27190 transitions. [2019-12-27 01:56:34,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:56:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 27190 transitions. [2019-12-27 01:56:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:34,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:34,897 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-27 01:56:34,897 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-27 01:56:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -754962803, now seen corresponding path program 5 times [2019-12-27 01:56:34,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200230414] [2019-12-27 01:56:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:35,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200230414] [2019-12-27 01:56:35,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:35,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:56:35,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658630387] [2019-12-27 01:56:35,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:56:35,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:56:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:35,096 INFO L87 Difference]: Start difference. First operand 9020 states and 27190 transitions. Second operand 12 states. [2019-12-27 01:56:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:35,898 INFO L93 Difference]: Finished difference Result 11597 states and 34468 transitions. [2019-12-27 01:56:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:56:35,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:56:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:35,914 INFO L225 Difference]: With dead ends: 11597 [2019-12-27 01:56:35,914 INFO L226 Difference]: Without dead ends: 11370 [2019-12-27 01:56:35,914 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-27 01:56:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11370 states. [2019-12-27 01:56:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11370 to 8844. [2019-12-27 01:56:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-12-27 01:56:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 26706 transitions. [2019-12-27 01:56:36,065 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 26706 transitions. Word has length 66 [2019-12-27 01:56:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:36,065 INFO L462 AbstractCegarLoop]: Abstraction has 8844 states and 26706 transitions. [2019-12-27 01:56:36,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:56:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 26706 transitions. [2019-12-27 01:56:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:36,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:36,073 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-27 01:56:36,074 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-27 01:56:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash 184937189, now seen corresponding path program 6 times [2019-12-27 01:56:36,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:36,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649883110] [2019-12-27 01:56:36,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649883110] [2019-12-27 01:56:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:56:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253204479] [2019-12-27 01:56:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:56:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:56:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:56:36,249 INFO L87 Difference]: Start difference. First operand 8844 states and 26706 transitions. Second operand 11 states. [2019-12-27 01:56:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:38,073 INFO L93 Difference]: Finished difference Result 18875 states and 55391 transitions. [2019-12-27 01:56:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:56:38,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:56:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:38,098 INFO L225 Difference]: With dead ends: 18875 [2019-12-27 01:56:38,098 INFO L226 Difference]: Without dead ends: 18611 [2019-12-27 01:56:38,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:56:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18611 states. [2019-12-27 01:56:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18611 to 13800. [2019-12-27 01:56:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13800 states. [2019-12-27 01:56:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13800 states to 13800 states and 40722 transitions. [2019-12-27 01:56:38,354 INFO L78 Accepts]: Start accepts. Automaton has 13800 states and 40722 transitions. Word has length 66 [2019-12-27 01:56:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:38,355 INFO L462 AbstractCegarLoop]: Abstraction has 13800 states and 40722 transitions. [2019-12-27 01:56:38,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:56:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13800 states and 40722 transitions. [2019-12-27 01:56:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:38,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:38,371 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-27 01:56:38,371 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-27 01:56:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash -658262819, now seen corresponding path program 7 times [2019-12-27 01:56:38,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:38,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031284946] [2019-12-27 01:56:38,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:38,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031284946] [2019-12-27 01:56:38,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:38,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:56:38,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69237825] [2019-12-27 01:56:38,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:56:38,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:38,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:56:38,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:56:38,498 INFO L87 Difference]: Start difference. First operand 13800 states and 40722 transitions. Second operand 8 states. [2019-12-27 01:56:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:39,578 INFO L93 Difference]: Finished difference Result 25858 states and 74331 transitions. [2019-12-27 01:56:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:56:39,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 01:56:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:39,611 INFO L225 Difference]: With dead ends: 25858 [2019-12-27 01:56:39,611 INFO L226 Difference]: Without dead ends: 25690 [2019-12-27 01:56:39,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:56:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25690 states. [2019-12-27 01:56:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25690 to 17013. [2019-12-27 01:56:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17013 states. [2019-12-27 01:56:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17013 states to 17013 states and 49904 transitions. [2019-12-27 01:56:39,913 INFO L78 Accepts]: Start accepts. Automaton has 17013 states and 49904 transitions. Word has length 66 [2019-12-27 01:56:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:39,914 INFO L462 AbstractCegarLoop]: Abstraction has 17013 states and 49904 transitions. [2019-12-27 01:56:39,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:56:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 17013 states and 49904 transitions. [2019-12-27 01:56:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:39,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:39,930 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-27 01:56:39,930 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-27 01:56:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1968796731, now seen corresponding path program 8 times [2019-12-27 01:56:39,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:39,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791783654] [2019-12-27 01:56:39,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:40,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791783654] [2019-12-27 01:56:40,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:40,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:56:40,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611155161] [2019-12-27 01:56:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:56:40,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:56:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:40,126 INFO L87 Difference]: Start difference. First operand 17013 states and 49904 transitions. Second operand 12 states. [2019-12-27 01:56:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:41,967 INFO L93 Difference]: Finished difference Result 24352 states and 70273 transitions. [2019-12-27 01:56:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:56:41,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:56:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:41,998 INFO L225 Difference]: With dead ends: 24352 [2019-12-27 01:56:41,998 INFO L226 Difference]: Without dead ends: 24352 [2019-12-27 01:56:41,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:56:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24352 states. [2019-12-27 01:56:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24352 to 17073. [2019-12-27 01:56:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17073 states. [2019-12-27 01:56:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17073 states to 17073 states and 50074 transitions. [2019-12-27 01:56:42,515 INFO L78 Accepts]: Start accepts. Automaton has 17073 states and 50074 transitions. Word has length 66 [2019-12-27 01:56:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:42,515 INFO L462 AbstractCegarLoop]: Abstraction has 17073 states and 50074 transitions. [2019-12-27 01:56:42,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:56:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17073 states and 50074 transitions. [2019-12-27 01:56:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:42,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:42,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:42,532 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-27 01:56:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1206613304, now seen corresponding path program 1 times [2019-12-27 01:56:42,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:42,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422754402] [2019-12-27 01:56:42,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:42,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422754402] [2019-12-27 01:56:42,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:42,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:56:42,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359729550] [2019-12-27 01:56:42,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:56:42,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:56:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:56:42,697 INFO L87 Difference]: Start difference. First operand 17073 states and 50074 transitions. Second operand 11 states. [2019-12-27 01:56:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:44,442 INFO L93 Difference]: Finished difference Result 23931 states and 69189 transitions. [2019-12-27 01:56:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:56:44,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:56:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:44,473 INFO L225 Difference]: With dead ends: 23931 [2019-12-27 01:56:44,473 INFO L226 Difference]: Without dead ends: 23931 [2019-12-27 01:56:44,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:56:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23931 states. [2019-12-27 01:56:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23931 to 17367. [2019-12-27 01:56:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2019-12-27 01:56:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 50853 transitions. [2019-12-27 01:56:44,774 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 50853 transitions. Word has length 66 [2019-12-27 01:56:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:44,774 INFO L462 AbstractCegarLoop]: Abstraction has 17367 states and 50853 transitions. [2019-12-27 01:56:44,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:56:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 50853 transitions. [2019-12-27 01:56:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:44,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:44,791 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-27 01:56:44,791 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-27 01:56:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1326542277, now seen corresponding path program 9 times [2019-12-27 01:56:44,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:44,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592495768] [2019-12-27 01:56:44,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:44,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-27 01:56:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592495768] [2019-12-27 01:56:44,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:44,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:56:44,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009048832] [2019-12-27 01:56:44,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:56:44,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:56:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:56:44,994 INFO L87 Difference]: Start difference. First operand 17367 states and 50853 transitions. Second operand 12 states. [2019-12-27 01:56:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:47,272 INFO L93 Difference]: Finished difference Result 25247 states and 72580 transitions. [2019-12-27 01:56:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 01:56:47,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:56:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:47,304 INFO L225 Difference]: With dead ends: 25247 [2019-12-27 01:56:47,304 INFO L226 Difference]: Without dead ends: 25247 [2019-12-27 01:56:47,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:56:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25247 states. [2019-12-27 01:56:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25247 to 16245. [2019-12-27 01:56:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-12-27 01:56:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 47782 transitions. [2019-12-27 01:56:47,828 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 47782 transitions. Word has length 66 [2019-12-27 01:56:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:47,829 INFO L462 AbstractCegarLoop]: Abstraction has 16245 states and 47782 transitions. [2019-12-27 01:56:47,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:56:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 47782 transitions. [2019-12-27 01:56:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:56:47,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:47,844 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-27 01:56:47,844 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-27 01:56:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 131851315, now seen corresponding path program 10 times [2019-12-27 01:56:47,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:47,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170059147] [2019-12-27 01:56:47,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:56:47,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170059147] [2019-12-27 01:56:47,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:47,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:47,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204844777] [2019-12-27 01:56:47,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:47,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:47,908 INFO L87 Difference]: Start difference. First operand 16245 states and 47782 transitions. Second operand 3 states. [2019-12-27 01:56:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:47,974 INFO L93 Difference]: Finished difference Result 16245 states and 47781 transitions. [2019-12-27 01:56:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:56:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:48,003 INFO L225 Difference]: With dead ends: 16245 [2019-12-27 01:56:48,003 INFO L226 Difference]: Without dead ends: 16245 [2019-12-27 01:56:48,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16245 states. [2019-12-27 01:56:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16245 to 13041. [2019-12-27 01:56:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2019-12-27 01:56:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 38814 transitions. [2019-12-27 01:56:48,409 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 38814 transitions. Word has length 66 [2019-12-27 01:56:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:48,409 INFO L462 AbstractCegarLoop]: Abstraction has 13041 states and 38814 transitions. [2019-12-27 01:56:48,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 38814 transitions. [2019-12-27 01:56:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:56:48,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:48,429 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-27 01:56:48,429 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-27 01:56:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 1 times [2019-12-27 01:56:48,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:48,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441814493] [2019-12-27 01:56:48,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:56:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:56:48,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:56:48,609 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:56:48,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t645~0.offset_19| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t645~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t645~0.base_24|) |v_ULTIMATE.start_main_~#t645~0.offset_19| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t645~0.base_24| 1) |v_#valid_63|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t645~0.base_24|) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t645~0.base_24| 4)) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t645~0.base_24|)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t645~0.offset=|v_ULTIMATE.start_main_~#t645~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ULTIMATE.start_main_~#t647~0.base=|v_ULTIMATE.start_main_~#t647~0.base_27|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ULTIMATE.start_main_~#t646~0.offset=|v_ULTIMATE.start_main_~#t646~0.offset_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ULTIMATE.start_main_~#t647~0.offset=|v_ULTIMATE.start_main_~#t647~0.offset_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ULTIMATE.start_main_~#t646~0.base=|v_ULTIMATE.start_main_~#t646~0.base_26|, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ULTIMATE.start_main_~#t645~0.base=|v_ULTIMATE.start_main_~#t645~0.base_24|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t645~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t647~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t646~0.offset, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t647~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t646~0.base, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t645~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:56:48,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t646~0.base_10| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t646~0.base_10| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t646~0.base_10|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t646~0.base_10|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t646~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t646~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t646~0.base_10|) |v_ULTIMATE.start_main_~#t646~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t646~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t646~0.offset=|v_ULTIMATE.start_main_~#t646~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t646~0.base=|v_ULTIMATE.start_main_~#t646~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t646~0.offset, #length, ULTIMATE.start_main_~#t646~0.base] because there is no mapped edge [2019-12-27 01:56:48,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t647~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t647~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t647~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t647~0.base_13|) |v_ULTIMATE.start_main_~#t647~0.offset_11| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t647~0.base_13| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t647~0.base_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t647~0.base_13|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t647~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t647~0.base=|v_ULTIMATE.start_main_~#t647~0.base_13|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t647~0.offset=|v_ULTIMATE.start_main_~#t647~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t647~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t647~0.offset, #length] because there is no mapped edge [2019-12-27 01:56:48,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:56:48,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In-188747790 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-188747790 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-188747790| ~a~0_In-188747790) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-188747790 |P1Thread1of1ForFork2_#t~ite9_Out-188747790|) (not .cse1)))) InVars {~a~0=~a~0_In-188747790, ~a$w_buff1~0=~a$w_buff1~0_In-188747790, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-188747790, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188747790} OutVars{~a~0=~a~0_In-188747790, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-188747790|, ~a$w_buff1~0=~a$w_buff1~0_In-188747790, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-188747790, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188747790} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:56:48,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1582919402 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1582919402 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1582919402| 0) (not .cse1)) (and (= ~a$w_buff0_used~0_In1582919402 |P0Thread1of1ForFork1_#t~ite5_Out1582919402|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1582919402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1582919402} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1582919402|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1582919402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1582919402} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:56:48,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1449270991 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1449270991 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1449270991 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1449270991 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1449270991|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-1449270991 |P0Thread1of1ForFork1_#t~ite6_Out-1449270991|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1449270991|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:56:48,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1314785689 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1314785689 256) 0))) (or (and (= 0 ~a$r_buff0_thd1~0_Out-1314785689) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1314785689 ~a$r_buff0_thd1~0_Out-1314785689) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1314785689} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1314785689|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1314785689} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:56:48,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In77656374 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In77656374 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In77656374 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In77656374 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In77656374 |P0Thread1of1ForFork1_#t~ite8_Out77656374|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out77656374|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In77656374, ~a$w_buff1_used~0=~a$w_buff1_used~0_In77656374} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out77656374|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In77656374, ~a$w_buff1_used~0=~a$w_buff1_used~0_In77656374} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:56:48,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:56:48,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1103504950 256)))) (or (and (= ~a$w_buff0~0_In-1103504950 |P2Thread1of1ForFork0_#t~ite21_Out-1103504950|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1103504950| |P2Thread1of1ForFork0_#t~ite20_Out-1103504950|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1103504950 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1103504950 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1103504950 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In-1103504950 256)) .cse1))) (= ~a$w_buff0~0_In-1103504950 |P2Thread1of1ForFork0_#t~ite20_Out-1103504950|) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-1103504950| |P2Thread1of1ForFork0_#t~ite20_Out-1103504950|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1103504950, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1103504950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1103504950|, ~weak$$choice2~0=~weak$$choice2~0_In-1103504950} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1103504950|, ~a$w_buff0~0=~a$w_buff0~0_In-1103504950, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1103504950, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1103504950|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950, ~weak$$choice2~0=~weak$$choice2~0_In-1103504950} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:56:48,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In208945643 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out208945643| ~a$w_buff0_used~0_In208945643) (= |P2Thread1of1ForFork0_#t~ite26_In208945643| |P2Thread1of1ForFork0_#t~ite26_Out208945643|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In208945643 256)))) (or (and (= (mod ~a$w_buff1_used~0_In208945643 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In208945643 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In208945643 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite27_Out208945643| |P2Thread1of1ForFork0_#t~ite26_Out208945643|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out208945643| ~a$w_buff0_used~0_In208945643)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In208945643|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In208945643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In208945643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In208945643, ~weak$$choice2~0=~weak$$choice2~0_In208945643} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out208945643|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out208945643|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In208945643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In208945643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In208945643, ~weak$$choice2~0=~weak$$choice2~0_In208945643} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:56:48,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1635829192 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1635829192| |P2Thread1of1ForFork0_#t~ite29_Out-1635829192|) (= ~a$w_buff1_used~0_In-1635829192 |P2Thread1of1ForFork0_#t~ite30_Out-1635829192|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1635829192| |P2Thread1of1ForFork0_#t~ite30_Out-1635829192|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1635829192 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-1635829192 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1635829192 256))) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1635829192 256) 0)))) (= ~a$w_buff1_used~0_In-1635829192 |P2Thread1of1ForFork0_#t~ite29_Out-1635829192|) .cse0))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1635829192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1635829192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1635829192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192, ~weak$$choice2~0=~weak$$choice2~0_In-1635829192, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1635829192|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1635829192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1635829192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1635829192, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1635829192|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1635829192|, ~weak$$choice2~0=~weak$$choice2~0_In-1635829192} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:56:48,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:56:48,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:56:48,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In677168881 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In677168881 256)))) (or (and (= ~a$w_buff0_used~0_In677168881 |P1Thread1of1ForFork2_#t~ite11_Out677168881|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out677168881|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In677168881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In677168881} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In677168881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In677168881, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out677168881|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:56:48,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1113866967 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1113866967 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1113866967 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1113866967 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1113866967 |P1Thread1of1ForFork2_#t~ite12_Out-1113866967|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1113866967|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1113866967, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1113866967, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1113866967, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1113866967} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1113866967, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1113866967, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1113866967, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1113866967|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1113866967} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:56:48,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1061431393 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1061431393 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1061431393 |P1Thread1of1ForFork2_#t~ite13_Out1061431393|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1061431393|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061431393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061431393} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061431393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061431393, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1061431393|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:56:48,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1699965945 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1699965945 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1699965945 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1699965945 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1699965945|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd2~0_In1699965945 |P1Thread1of1ForFork2_#t~ite14_Out1699965945|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1699965945, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1699965945, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699965945, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699965945} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1699965945, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1699965945, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699965945, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699965945, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1699965945|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:56:48,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:56:48,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:56:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2089958339 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2089958339 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out2089958339| |P2Thread1of1ForFork0_#t~ite39_Out2089958339|))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2089958339| ~a$w_buff1~0_In2089958339) .cse2) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out2089958339| ~a~0_In2089958339) .cse2))) InVars {~a~0=~a~0_In2089958339, ~a$w_buff1~0=~a$w_buff1~0_In2089958339, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2089958339, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2089958339} OutVars{~a~0=~a~0_In2089958339, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2089958339|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2089958339|, ~a$w_buff1~0=~a$w_buff1~0_In2089958339, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2089958339, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2089958339} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:56:48,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1476891503 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1476891503 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1476891503 |P2Thread1of1ForFork0_#t~ite40_Out1476891503|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out1476891503| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1476891503} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1476891503|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1476891503} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:56:48,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In210456709 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In210456709 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In210456709 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In210456709 256) 0))) (or (and (= ~a$w_buff1_used~0_In210456709 |P2Thread1of1ForFork0_#t~ite41_Out210456709|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out210456709|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In210456709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In210456709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out210456709|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:56:48,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1031812550 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1031812550 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1031812550| ~a$r_buff0_thd3~0_In1031812550) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1031812550| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1031812550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1031812550} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1031812550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1031812550, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1031812550|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:56:48,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1943800216 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1943800216 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1943800216 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1943800216 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-1943800216 |P2Thread1of1ForFork0_#t~ite43_Out-1943800216|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1943800216| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943800216} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1943800216|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943800216} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:56:48,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:56:48,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 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_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:56:48,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1472120494 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1472120494 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1472120494| |ULTIMATE.start_main_#t~ite48_Out1472120494|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1472120494| ~a~0_In1472120494) .cse2) (and (not .cse0) (= ~a$w_buff1~0_In1472120494 |ULTIMATE.start_main_#t~ite47_Out1472120494|) (not .cse1) .cse2))) InVars {~a~0=~a~0_In1472120494, ~a$w_buff1~0=~a$w_buff1~0_In1472120494, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1472120494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472120494} OutVars{~a~0=~a~0_In1472120494, ~a$w_buff1~0=~a$w_buff1~0_In1472120494, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1472120494|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1472120494, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1472120494|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472120494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:56:48,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In874458350 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In874458350 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out874458350|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out874458350| ~a$w_buff0_used~0_In874458350)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In874458350} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out874458350|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In874458350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:56:48,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-430261310 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-430261310 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-430261310 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-430261310 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-430261310 |ULTIMATE.start_main_#t~ite50_Out-430261310|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-430261310|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-430261310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-430261310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430261310} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-430261310|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-430261310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-430261310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430261310} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:56:48,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In71004450 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In71004450 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out71004450| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out71004450| ~a$r_buff0_thd0~0_In71004450) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In71004450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In71004450} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out71004450|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In71004450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In71004450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:56:48,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In662161426 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In662161426 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In662161426 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In662161426 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out662161426| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out662161426| ~a$r_buff1_thd0~0_In662161426) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In662161426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In662161426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In662161426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In662161426} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out662161426|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In662161426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In662161426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In662161426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In662161426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:56:48,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:56:48,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:56:48 BasicIcfg [2019-12-27 01:56:48,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:56:48,741 INFO L168 Benchmark]: Toolchain (without parser) took 104036.44 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,742 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.04 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,745 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,746 INFO L168 Benchmark]: RCFGBuilder took 829.26 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,746 INFO L168 Benchmark]: TraceAbstraction took 102278.60 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 01:56:48,752 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.04 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.70 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.26 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102278.60 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t647, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.9s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7242 SDtfs, 11302 SDslu, 26805 SDs, 0 SdLazy, 14876 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 43.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 174986 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1705 NumberOfCodeBlocks, 1705 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 354606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...