/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/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:57:42,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:57:42,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:57:42,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:57:42,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:57:42,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:57:42,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:57:42,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:57:42,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:57:42,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:57:42,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:57:42,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:57:42,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:57:42,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:57:42,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:57:42,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:57:42,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:57:42,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:57:42,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:57:42,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:57:42,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:57:42,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:57:42,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:57:42,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:57:42,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:57:42,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:57:42,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:57:42,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:57:42,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:57:42,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:57:42,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:57:42,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:57:42,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:57:42,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:57:42,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:57:42,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:57:42,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:57:42,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:57:42,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:57:42,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:57:42,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:57:42,340 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:57:42,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:57:42,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:57:42,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:57:42,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:57:42,356 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:57:42,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:57:42,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:57:42,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:57:42,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:57:42,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:57:42,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:57:42,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:57:42,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:57:42,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:57:42,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:57:42,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:57:42,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:57:42,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:57:42,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:57:42,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:57:42,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:57:42,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:57:42,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:57:42,668 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:57:42,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 01:57:42,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d333d542/619e3066fecd487a84bb3a51bcbef88e/FLAG9e1d8ddec [2019-12-27 01:57:43,295 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:57:43,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 01:57:43,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d333d542/619e3066fecd487a84bb3a51bcbef88e/FLAG9e1d8ddec [2019-12-27 01:57:43,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d333d542/619e3066fecd487a84bb3a51bcbef88e [2019-12-27 01:57:43,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:57:43,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:57:43,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:57:43,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:57:43,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:57:43,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:57:43" (1/1) ... [2019-12-27 01:57:43,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:43, skipping insertion in model container [2019-12-27 01:57:43,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:57:43" (1/1) ... [2019-12-27 01:57:43,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:57:43,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:57:44,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:57:44,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:57:44,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:57:44,334 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:57:44,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44 WrapperNode [2019-12-27 01:57:44,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:57:44,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:57:44,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:57:44,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:57:44,344 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:57:44" (1/1) ... [2019-12-27 01:57:44,366 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:57:44" (1/1) ... [2019-12-27 01:57:44,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:57:44,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:57:44,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:57:44,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:57:44,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (1/1) ... [2019-12-27 01:57:44,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:57:44,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:57:44,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:57:44,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:57:44,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (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:57:44,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:57:44,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:57:44,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:57:44,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:57:44,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:57:44,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:57:44,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:57:44,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:57:44,518 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:57:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:57:44,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:57:44,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:57:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:57:44,521 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:57:45,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:57:45,276 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:57:45,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:57:45 BoogieIcfgContainer [2019-12-27 01:57:45,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:57:45,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:57:45,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:57:45,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:57:45,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:57:43" (1/3) ... [2019-12-27 01:57:45,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f100cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:57:45, skipping insertion in model container [2019-12-27 01:57:45,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:57:44" (2/3) ... [2019-12-27 01:57:45,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f100cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:57:45, skipping insertion in model container [2019-12-27 01:57:45,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:57:45" (3/3) ... [2019-12-27 01:57:45,287 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-27 01:57:45,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:57:45,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:57:45,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:57:45,307 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:57:45,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,405 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,405 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:57:45,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:57:45,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:57:45,504 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:57:45,504 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:57:45,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:57:45,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:57:45,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:57:45,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:57:45,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:57:45,518 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:57:45,520 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:57:45,635 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:57:45,636 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:57:45,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:57:45,677 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:57:45,739 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:57:45,739 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:57:45,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:57:45,768 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:57:45,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:57:51,000 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:57:51,119 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:57:51,399 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:57:51,400 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:57:51,404 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:58:12,832 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:58:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:58:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:58:12,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:12,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:58:12,841 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:58:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:58:12,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:12,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477654671] [2019-12-27 01:58:12,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:13,072 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:58:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477654671] [2019-12-27 01:58:13,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:13,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:58:13,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58844151] [2019-12-27 01:58:13,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:13,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:13,102 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:58:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:14,513 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:58:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:14,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:58:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:18,431 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:58:18,432 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:58:18,433 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:58:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:58:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:58:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:58:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:58:25,603 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:58:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:25,604 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:58:25,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:58:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:58:25,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:25,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:25,609 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:58:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:58:25,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:25,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467766400] [2019-12-27 01:58:25,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:25,707 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:58:25,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467766400] [2019-12-27 01:58:25,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:25,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:25,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211534255] [2019-12-27 01:58:25,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:25,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:25,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:25,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:25,711 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:58:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:31,771 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:58:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:31,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:58:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:32,401 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:58:32,402 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:58:32,403 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:58:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:58:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:58:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:58:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:58:44,624 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:58:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:44,624 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:58:44,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:58:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:58:44,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:44,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:44,632 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:58:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:58:44,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:44,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884779015] [2019-12-27 01:58:44,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:44,729 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:58:44,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884779015] [2019-12-27 01:58:44,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:44,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:44,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504897636] [2019-12-27 01:58:44,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:44,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:44,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:44,732 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:58:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:44,900 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:58:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:44,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:58:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:44,977 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:58:44,977 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:58:44,978 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:58:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:58:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:58:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:58:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:58:50,591 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:58:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:50,592 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:58:50,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:58:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:50,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:50,597 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:58:50,597 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:58:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:58:50,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:50,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037912662] [2019-12-27 01:58:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:50,704 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:58:50,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037912662] [2019-12-27 01:58:50,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:50,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:50,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641860890] [2019-12-27 01:58:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:58:50,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:58:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:58:50,707 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:58:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:50,939 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:58:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:58:50,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:58:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:51,055 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:58:51,055 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:58:51,055 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:58:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:58:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:58:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:58:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:58:51,868 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:58:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:51,869 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:58:51,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:58:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:58:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:51,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:51,873 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:58:51,873 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:58:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:58:51,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:51,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274607400] [2019-12-27 01:58:51,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:51,937 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:58:51,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274607400] [2019-12-27 01:58:51,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:51,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069124437] [2019-12-27 01:58:51,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:51,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:51,940 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:58:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:52,315 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:58:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:52,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:58:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:52,393 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:58:52,393 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:58:52,394 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:58:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:58:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:58:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:58:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:58:53,644 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:58:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:53,644 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:58:53,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:58:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:58:53,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:53,648 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:58:53,648 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:58:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:58:53,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:53,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058916282] [2019-12-27 01:58:53,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:58:53,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058916282] [2019-12-27 01:58:53,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:53,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:58:53,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709562922] [2019-12-27 01:58:53,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:53,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:53,703 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:58:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:54,116 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:58:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:58:54,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:58:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:54,217 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:58:54,217 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:58:54,218 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:58:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:58:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:58:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:58:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:58:55,029 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:58:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:55,030 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:58:55,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:58:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:58:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:58:55,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:55,039 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:58:55,039 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:58:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:58:55,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:55,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393231843] [2019-12-27 01:58:55,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:55,111 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:58:55,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393231843] [2019-12-27 01:58:55,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:55,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:55,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578840332] [2019-12-27 01:58:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:55,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:55,113 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:58:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:55,772 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:58:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:58:55,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:58:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:56,305 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:58:56,306 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:58:56,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:58:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:58:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:58:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:58:57,166 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:58:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:57,166 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:58:57,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:58:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:58:57,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:57,176 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:58:57,176 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:58:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:58:57,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:57,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759887805] [2019-12-27 01:58:57,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:57,255 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:58:57,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759887805] [2019-12-27 01:58:57,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:57,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:57,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904902708] [2019-12-27 01:58:57,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:58:57,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:58:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:58:57,257 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:58:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:57,921 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:58:57,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:58:57,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:58:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:58,028 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:58:58,029 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:58:58,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:58:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:58:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:58:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:58:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:58:59,563 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:58:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:59,564 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:58:59,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:58:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:58:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:58:59,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:59,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:58:59,575 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:58:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:58:59,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:59,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380601388] [2019-12-27 01:58:59,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:59,628 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:58:59,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380601388] [2019-12-27 01:58:59,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:59,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:58:59,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61390873] [2019-12-27 01:58:59,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:58:59,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:59,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:58:59,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:58:59,630 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:58:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:59,728 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:58:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:58:59,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:58:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:59,761 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:58:59,761 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:58:59,762 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:58:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:59:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:59:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:59:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:59:00,054 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:59:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:00,054 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:59:00,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:59:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:59:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:59:00,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:00,067 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] [2019-12-27 01:59:00,067 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:59:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:59:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:00,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928091421] [2019-12-27 01:59:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:00,134 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:59:00,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928091421] [2019-12-27 01:59:00,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:00,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:59:00,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260142801] [2019-12-27 01:59:00,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:59:00,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:59:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:59:00,137 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:59:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:00,492 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:59:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:59:00,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:59:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:00,523 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:59:00,523 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:59:00,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:59:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:59:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:59:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:59:00,831 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:59:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:00,831 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:59:00,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:59:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:59:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:59:00,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:00,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:59:00,847 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:59:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:59:00,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:00,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887937296] [2019-12-27 01:59:00,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:00,914 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:59:00,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887937296] [2019-12-27 01:59:00,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:00,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:59:00,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101813457] [2019-12-27 01:59:00,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:59:00,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:59:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:59:00,916 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:59:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:01,262 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:59:01,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:59:01,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:59:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:01,296 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:59:01,296 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:59:01,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:59:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:59:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:59:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:59:01,606 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:59:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:01,606 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:59:01,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:59:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:59:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:59:01,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:01,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] [2019-12-27 01:59:01,626 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:59:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:59:01,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:01,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407571608] [2019-12-27 01:59:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:01,749 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:59:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407571608] [2019-12-27 01:59:01,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:59:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210138] [2019-12-27 01:59:01,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:59:01,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:59:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:59:01,752 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 01:59:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:02,457 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 01:59:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:02,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 01:59:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:02,496 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 01:59:02,496 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 01:59:02,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:59:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 01:59:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 01:59:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 01:59:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 01:59:03,162 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 01:59:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:03,163 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 01:59:03,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:59:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 01:59:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:59:03,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:03,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:59:03,185 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:59:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:59:03,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:03,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095324672] [2019-12-27 01:59:03,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:03,312 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:59:03,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095324672] [2019-12-27 01:59:03,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:03,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:59:03,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882471479] [2019-12-27 01:59:03,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:03,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:03,314 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 7 states. [2019-12-27 01:59:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:04,136 INFO L93 Difference]: Finished difference Result 29297 states and 87381 transitions. [2019-12-27 01:59:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:59:04,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:59:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:04,197 INFO L225 Difference]: With dead ends: 29297 [2019-12-27 01:59:04,197 INFO L226 Difference]: Without dead ends: 29297 [2019-12-27 01:59:04,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:59:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29297 states. [2019-12-27 01:59:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29297 to 20970. [2019-12-27 01:59:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20970 states. [2019-12-27 01:59:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20970 states to 20970 states and 63763 transitions. [2019-12-27 01:59:04,805 INFO L78 Accepts]: Start accepts. Automaton has 20970 states and 63763 transitions. Word has length 34 [2019-12-27 01:59:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:04,805 INFO L462 AbstractCegarLoop]: Abstraction has 20970 states and 63763 transitions. [2019-12-27 01:59:04,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 20970 states and 63763 transitions. [2019-12-27 01:59:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 01:59:04,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:04,840 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] [2019-12-27 01:59:04,840 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:59:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash -475634225, now seen corresponding path program 1 times [2019-12-27 01:59:04,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:04,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359788230] [2019-12-27 01:59:04,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:05,057 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:59:05,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359788230] [2019-12-27 01:59:05,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:05,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:05,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73487556] [2019-12-27 01:59:05,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:05,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:05,059 INFO L87 Difference]: Start difference. First operand 20970 states and 63763 transitions. Second operand 8 states. [2019-12-27 01:59:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:06,083 INFO L93 Difference]: Finished difference Result 28597 states and 85038 transitions. [2019-12-27 01:59:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:59:06,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-27 01:59:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:06,123 INFO L225 Difference]: With dead ends: 28597 [2019-12-27 01:59:06,123 INFO L226 Difference]: Without dead ends: 28597 [2019-12-27 01:59:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28597 states. [2019-12-27 01:59:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28597 to 18528. [2019-12-27 01:59:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18528 states. [2019-12-27 01:59:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18528 states to 18528 states and 56415 transitions. [2019-12-27 01:59:06,455 INFO L78 Accepts]: Start accepts. Automaton has 18528 states and 56415 transitions. Word has length 38 [2019-12-27 01:59:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:06,456 INFO L462 AbstractCegarLoop]: Abstraction has 18528 states and 56415 transitions. [2019-12-27 01:59:06,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18528 states and 56415 transitions. [2019-12-27 01:59:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 01:59:06,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:06,473 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] [2019-12-27 01:59:06,473 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:59:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1454822857, now seen corresponding path program 2 times [2019-12-27 01:59:06,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:06,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814924501] [2019-12-27 01:59:06,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:06,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814924501] [2019-12-27 01:59:06,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:06,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:59:06,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168635359] [2019-12-27 01:59:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:59:06,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:59:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:59:06,558 INFO L87 Difference]: Start difference. First operand 18528 states and 56415 transitions. Second operand 6 states. [2019-12-27 01:59:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:07,222 INFO L93 Difference]: Finished difference Result 24433 states and 73054 transitions. [2019-12-27 01:59:07,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:07,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-27 01:59:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:07,267 INFO L225 Difference]: With dead ends: 24433 [2019-12-27 01:59:07,267 INFO L226 Difference]: Without dead ends: 24433 [2019-12-27 01:59:07,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:59:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-12-27 01:59:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 17844. [2019-12-27 01:59:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-27 01:59:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 54566 transitions. [2019-12-27 01:59:07,581 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 54566 transitions. Word has length 38 [2019-12-27 01:59:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:07,581 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 54566 transitions. [2019-12-27 01:59:07,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:59:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 54566 transitions. [2019-12-27 01:59:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:59:07,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:07,603 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:59:07,603 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:59:07,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:07,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:59:07,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:07,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850289779] [2019-12-27 01:59:07,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:07,655 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:59:07,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850289779] [2019-12-27 01:59:07,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:07,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:59:07,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489917500] [2019-12-27 01:59:07,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:07,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:07,657 INFO L87 Difference]: Start difference. First operand 17844 states and 54566 transitions. Second operand 3 states. [2019-12-27 01:59:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:07,736 INFO L93 Difference]: Finished difference Result 17843 states and 54564 transitions. [2019-12-27 01:59:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:07,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:59:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:08,008 INFO L225 Difference]: With dead ends: 17843 [2019-12-27 01:59:08,008 INFO L226 Difference]: Without dead ends: 17843 [2019-12-27 01:59:08,008 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:59:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17843 states. [2019-12-27 01:59:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17843 to 17843. [2019-12-27 01:59:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2019-12-27 01:59:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 54564 transitions. [2019-12-27 01:59:08,331 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 54564 transitions. Word has length 39 [2019-12-27 01:59:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:08,332 INFO L462 AbstractCegarLoop]: Abstraction has 17843 states and 54564 transitions. [2019-12-27 01:59:08,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 54564 transitions. [2019-12-27 01:59:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:59:08,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:08,354 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:59:08,354 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:59:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:59:08,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:08,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917246624] [2019-12-27 01:59:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:08,434 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:59:08,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917246624] [2019-12-27 01:59:08,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:08,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:59:08,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041043107] [2019-12-27 01:59:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:59:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:59:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:59:08,436 INFO L87 Difference]: Start difference. First operand 17843 states and 54564 transitions. Second operand 5 states. [2019-12-27 01:59:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:09,102 INFO L93 Difference]: Finished difference Result 25586 states and 77360 transitions. [2019-12-27 01:59:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:59:09,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:59:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:09,138 INFO L225 Difference]: With dead ends: 25586 [2019-12-27 01:59:09,139 INFO L226 Difference]: Without dead ends: 25586 [2019-12-27 01:59:09,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:59:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2019-12-27 01:59:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 23742. [2019-12-27 01:59:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23742 states. [2019-12-27 01:59:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 72302 transitions. [2019-12-27 01:59:09,494 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 72302 transitions. Word has length 40 [2019-12-27 01:59:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:09,494 INFO L462 AbstractCegarLoop]: Abstraction has 23742 states and 72302 transitions. [2019-12-27 01:59:09,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:59:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 72302 transitions. [2019-12-27 01:59:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:59:09,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:09,517 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:59:09,517 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:59:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:59:09,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:09,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557890357] [2019-12-27 01:59:09,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:09,579 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:59:09,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557890357] [2019-12-27 01:59:09,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:09,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:59:09,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65140412] [2019-12-27 01:59:09,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:59:09,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:09,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:59:09,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:59:09,582 INFO L87 Difference]: Start difference. First operand 23742 states and 72302 transitions. Second operand 5 states. [2019-12-27 01:59:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:09,688 INFO L93 Difference]: Finished difference Result 22357 states and 69069 transitions. [2019-12-27 01:59:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:59:09,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:59:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:09,727 INFO L225 Difference]: With dead ends: 22357 [2019-12-27 01:59:09,727 INFO L226 Difference]: Without dead ends: 22357 [2019-12-27 01:59:09,727 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:59:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22357 states. [2019-12-27 01:59:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22357 to 21433. [2019-12-27 01:59:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-12-27 01:59:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 66576 transitions. [2019-12-27 01:59:10,064 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 66576 transitions. Word has length 40 [2019-12-27 01:59:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:10,064 INFO L462 AbstractCegarLoop]: Abstraction has 21433 states and 66576 transitions. [2019-12-27 01:59:10,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:59:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 66576 transitions. [2019-12-27 01:59:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:10,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:10,085 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] [2019-12-27 01:59:10,085 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:59:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:59:10,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:10,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059812987] [2019-12-27 01:59:10,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:10,175 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:59:10,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059812987] [2019-12-27 01:59:10,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:10,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:10,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656611957] [2019-12-27 01:59:10,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:10,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:10,177 INFO L87 Difference]: Start difference. First operand 21433 states and 66576 transitions. Second operand 7 states. [2019-12-27 01:59:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:10,692 INFO L93 Difference]: Finished difference Result 62178 states and 192107 transitions. [2019-12-27 01:59:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:59:10,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:10,783 INFO L225 Difference]: With dead ends: 62178 [2019-12-27 01:59:10,783 INFO L226 Difference]: Without dead ends: 47621 [2019-12-27 01:59:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47621 states. [2019-12-27 01:59:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47621 to 24994. [2019-12-27 01:59:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24994 states. [2019-12-27 01:59:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24994 states to 24994 states and 78149 transitions. [2019-12-27 01:59:11,675 INFO L78 Accepts]: Start accepts. Automaton has 24994 states and 78149 transitions. Word has length 63 [2019-12-27 01:59:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 24994 states and 78149 transitions. [2019-12-27 01:59:11,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24994 states and 78149 transitions. [2019-12-27 01:59:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:11,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:11,705 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] [2019-12-27 01:59:11,705 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:59:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:59:11,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:11,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697735685] [2019-12-27 01:59:11,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:11,793 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:59:11,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697735685] [2019-12-27 01:59:11,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:11,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:11,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499455437] [2019-12-27 01:59:11,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:11,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:11,795 INFO L87 Difference]: Start difference. First operand 24994 states and 78149 transitions. Second operand 7 states. [2019-12-27 01:59:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:12,394 INFO L93 Difference]: Finished difference Result 68494 states and 210324 transitions. [2019-12-27 01:59:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:12,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:12,480 INFO L225 Difference]: With dead ends: 68494 [2019-12-27 01:59:12,480 INFO L226 Difference]: Without dead ends: 48573 [2019-12-27 01:59:12,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:59:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48573 states. [2019-12-27 01:59:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48573 to 28837. [2019-12-27 01:59:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28837 states. [2019-12-27 01:59:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28837 states to 28837 states and 89809 transitions. [2019-12-27 01:59:13,100 INFO L78 Accepts]: Start accepts. Automaton has 28837 states and 89809 transitions. Word has length 63 [2019-12-27 01:59:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:13,100 INFO L462 AbstractCegarLoop]: Abstraction has 28837 states and 89809 transitions. [2019-12-27 01:59:13,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28837 states and 89809 transitions. [2019-12-27 01:59:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:13,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:13,133 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] [2019-12-27 01:59:13,133 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:59:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:59:13,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:13,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284750280] [2019-12-27 01:59:13,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:13,218 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:59:13,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284750280] [2019-12-27 01:59:13,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:13,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:59:13,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390936714] [2019-12-27 01:59:13,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:13,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:13,220 INFO L87 Difference]: Start difference. First operand 28837 states and 89809 transitions. Second operand 7 states. [2019-12-27 01:59:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:13,952 INFO L93 Difference]: Finished difference Result 59882 states and 183863 transitions. [2019-12-27 01:59:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:59:13,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:14,089 INFO L225 Difference]: With dead ends: 59882 [2019-12-27 01:59:14,090 INFO L226 Difference]: Without dead ends: 52801 [2019-12-27 01:59:14,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52801 states. [2019-12-27 01:59:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52801 to 29145. [2019-12-27 01:59:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29145 states. [2019-12-27 01:59:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29145 states to 29145 states and 90760 transitions. [2019-12-27 01:59:15,525 INFO L78 Accepts]: Start accepts. Automaton has 29145 states and 90760 transitions. Word has length 63 [2019-12-27 01:59:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:15,525 INFO L462 AbstractCegarLoop]: Abstraction has 29145 states and 90760 transitions. [2019-12-27 01:59:15,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29145 states and 90760 transitions. [2019-12-27 01:59:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:15,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:15,556 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] [2019-12-27 01:59:15,556 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:59:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:59:15,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:15,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539965911] [2019-12-27 01:59:15,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:15,664 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:59:15,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539965911] [2019-12-27 01:59:15,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:15,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:59:15,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244106710] [2019-12-27 01:59:15,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:15,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:15,666 INFO L87 Difference]: Start difference. First operand 29145 states and 90760 transitions. Second operand 7 states. [2019-12-27 01:59:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:16,845 INFO L93 Difference]: Finished difference Result 38133 states and 116396 transitions. [2019-12-27 01:59:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:59:16,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:16,899 INFO L225 Difference]: With dead ends: 38133 [2019-12-27 01:59:16,900 INFO L226 Difference]: Without dead ends: 37909 [2019-12-27 01:59:16,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:59:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37909 states. [2019-12-27 01:59:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37909 to 31933. [2019-12-27 01:59:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31933 states. [2019-12-27 01:59:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31933 states to 31933 states and 99059 transitions. [2019-12-27 01:59:17,444 INFO L78 Accepts]: Start accepts. Automaton has 31933 states and 99059 transitions. Word has length 63 [2019-12-27 01:59:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:17,444 INFO L462 AbstractCegarLoop]: Abstraction has 31933 states and 99059 transitions. [2019-12-27 01:59:17,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 31933 states and 99059 transitions. [2019-12-27 01:59:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:17,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:17,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] [2019-12-27 01:59:17,479 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:59:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 01:59:17,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:17,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136335502] [2019-12-27 01:59:17,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:17,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:59:17,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136335502] [2019-12-27 01:59:17,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:17,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:59:17,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599162374] [2019-12-27 01:59:17,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:17,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:17,594 INFO L87 Difference]: Start difference. First operand 31933 states and 99059 transitions. Second operand 7 states. [2019-12-27 01:59:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:19,383 INFO L93 Difference]: Finished difference Result 54969 states and 166736 transitions. [2019-12-27 01:59:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:59:19,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:19,490 INFO L225 Difference]: With dead ends: 54969 [2019-12-27 01:59:19,490 INFO L226 Difference]: Without dead ends: 54646 [2019-12-27 01:59:19,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:59:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54646 states. [2019-12-27 01:59:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54646 to 34696. [2019-12-27 01:59:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34696 states. [2019-12-27 01:59:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34696 states to 34696 states and 107888 transitions. [2019-12-27 01:59:20,710 INFO L78 Accepts]: Start accepts. Automaton has 34696 states and 107888 transitions. Word has length 63 [2019-12-27 01:59:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:20,710 INFO L462 AbstractCegarLoop]: Abstraction has 34696 states and 107888 transitions. [2019-12-27 01:59:20,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34696 states and 107888 transitions. [2019-12-27 01:59:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:20,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:20,748 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] [2019-12-27 01:59:20,748 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:59:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-27 01:59:20,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:20,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637145241] [2019-12-27 01:59:20,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:20,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637145241] [2019-12-27 01:59:20,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:20,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:59:20,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267634743] [2019-12-27 01:59:20,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:20,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:20,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:20,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:20,868 INFO L87 Difference]: Start difference. First operand 34696 states and 107888 transitions. Second operand 7 states. [2019-12-27 01:59:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:21,843 INFO L93 Difference]: Finished difference Result 57045 states and 174847 transitions. [2019-12-27 01:59:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:59:21,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:21,930 INFO L225 Difference]: With dead ends: 57045 [2019-12-27 01:59:21,930 INFO L226 Difference]: Without dead ends: 56825 [2019-12-27 01:59:21,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56825 states. [2019-12-27 01:59:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56825 to 40410. [2019-12-27 01:59:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40410 states. [2019-12-27 01:59:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40410 states to 40410 states and 125365 transitions. [2019-12-27 01:59:22,708 INFO L78 Accepts]: Start accepts. Automaton has 40410 states and 125365 transitions. Word has length 63 [2019-12-27 01:59:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:22,708 INFO L462 AbstractCegarLoop]: Abstraction has 40410 states and 125365 transitions. [2019-12-27 01:59:22,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40410 states and 125365 transitions. [2019-12-27 01:59:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:22,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:22,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] [2019-12-27 01:59:22,753 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:59:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-27 01:59:22,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:22,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595174405] [2019-12-27 01:59:22,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:22,852 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:59:22,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595174405] [2019-12-27 01:59:22,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:22,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:22,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923882705] [2019-12-27 01:59:22,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:22,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:22,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:22,854 INFO L87 Difference]: Start difference. First operand 40410 states and 125365 transitions. Second operand 8 states. [2019-12-27 01:59:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:24,007 INFO L93 Difference]: Finished difference Result 59744 states and 182628 transitions. [2019-12-27 01:59:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:59:24,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:24,098 INFO L225 Difference]: With dead ends: 59744 [2019-12-27 01:59:24,099 INFO L226 Difference]: Without dead ends: 59492 [2019-12-27 01:59:24,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:59:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59492 states. [2019-12-27 01:59:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59492 to 40352. [2019-12-27 01:59:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40352 states. [2019-12-27 01:59:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40352 states to 40352 states and 125202 transitions. [2019-12-27 01:59:25,273 INFO L78 Accepts]: Start accepts. Automaton has 40352 states and 125202 transitions. Word has length 63 [2019-12-27 01:59:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:25,273 INFO L462 AbstractCegarLoop]: Abstraction has 40352 states and 125202 transitions. [2019-12-27 01:59:25,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40352 states and 125202 transitions. [2019-12-27 01:59:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:25,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:25,318 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] [2019-12-27 01:59:25,318 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:59:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-27 01:59:25,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:25,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226959666] [2019-12-27 01:59:25,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:25,425 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:59:25,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226959666] [2019-12-27 01:59:25,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:25,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:25,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043001338] [2019-12-27 01:59:25,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:25,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:25,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:25,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:25,427 INFO L87 Difference]: Start difference. First operand 40352 states and 125202 transitions. Second operand 8 states. [2019-12-27 01:59:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:27,432 INFO L93 Difference]: Finished difference Result 58404 states and 177085 transitions. [2019-12-27 01:59:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:59:27,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:27,521 INFO L225 Difference]: With dead ends: 58404 [2019-12-27 01:59:27,521 INFO L226 Difference]: Without dead ends: 58404 [2019-12-27 01:59:27,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:59:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58404 states. [2019-12-27 01:59:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58404 to 39690. [2019-12-27 01:59:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39690 states. [2019-12-27 01:59:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39690 states to 39690 states and 123255 transitions. [2019-12-27 01:59:28,298 INFO L78 Accepts]: Start accepts. Automaton has 39690 states and 123255 transitions. Word has length 63 [2019-12-27 01:59:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:28,299 INFO L462 AbstractCegarLoop]: Abstraction has 39690 states and 123255 transitions. [2019-12-27 01:59:28,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 39690 states and 123255 transitions. [2019-12-27 01:59:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:28,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:28,342 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] [2019-12-27 01:59:28,342 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:59:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-27 01:59:28,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:28,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781285986] [2019-12-27 01:59:28,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:28,453 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:59:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781285986] [2019-12-27 01:59:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27073545] [2019-12-27 01:59:28,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:28,455 INFO L87 Difference]: Start difference. First operand 39690 states and 123255 transitions. Second operand 8 states. [2019-12-27 01:59:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:29,466 INFO L93 Difference]: Finished difference Result 55039 states and 168788 transitions. [2019-12-27 01:59:29,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:59:29,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:29,550 INFO L225 Difference]: With dead ends: 55039 [2019-12-27 01:59:29,550 INFO L226 Difference]: Without dead ends: 55039 [2019-12-27 01:59:29,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55039 states. [2019-12-27 01:59:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55039 to 38912. [2019-12-27 01:59:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38912 states. [2019-12-27 01:59:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38912 states to 38912 states and 120876 transitions. [2019-12-27 01:59:30,674 INFO L78 Accepts]: Start accepts. Automaton has 38912 states and 120876 transitions. Word has length 63 [2019-12-27 01:59:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 38912 states and 120876 transitions. [2019-12-27 01:59:30,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 38912 states and 120876 transitions. [2019-12-27 01:59:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:30,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:30,716 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] [2019-12-27 01:59:30,716 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:59:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-27 01:59:30,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:30,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453979070] [2019-12-27 01:59:30,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:30,901 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:59:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453979070] [2019-12-27 01:59:30,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:30,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 01:59:30,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641448918] [2019-12-27 01:59:30,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:59:30,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:59:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:30,904 INFO L87 Difference]: Start difference. First operand 38912 states and 120876 transitions. Second operand 12 states. [2019-12-27 01:59:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:32,682 INFO L93 Difference]: Finished difference Result 55983 states and 171660 transitions. [2019-12-27 01:59:32,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:59:32,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-27 01:59:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:32,769 INFO L225 Difference]: With dead ends: 55983 [2019-12-27 01:59:32,769 INFO L226 Difference]: Without dead ends: 55983 [2019-12-27 01:59:32,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:59:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55983 states. [2019-12-27 01:59:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55983 to 36656. [2019-12-27 01:59:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36656 states. [2019-12-27 01:59:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36656 states to 36656 states and 114157 transitions. [2019-12-27 01:59:33,503 INFO L78 Accepts]: Start accepts. Automaton has 36656 states and 114157 transitions. Word has length 63 [2019-12-27 01:59:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:33,503 INFO L462 AbstractCegarLoop]: Abstraction has 36656 states and 114157 transitions. [2019-12-27 01:59:33,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:59:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 36656 states and 114157 transitions. [2019-12-27 01:59:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:33,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:33,542 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] [2019-12-27 01:59:33,543 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:59:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-27 01:59:33,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:33,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2332834] [2019-12-27 01:59:33,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:33,649 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:59:33,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2332834] [2019-12-27 01:59:33,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:33,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:59:33,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580988062] [2019-12-27 01:59:33,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:59:33,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:59:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:59:33,651 INFO L87 Difference]: Start difference. First operand 36656 states and 114157 transitions. Second operand 7 states. [2019-12-27 01:59:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:34,834 INFO L93 Difference]: Finished difference Result 57365 states and 175566 transitions. [2019-12-27 01:59:34,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:59:34,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:59:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:34,915 INFO L225 Difference]: With dead ends: 57365 [2019-12-27 01:59:34,915 INFO L226 Difference]: Without dead ends: 57365 [2019-12-27 01:59:34,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57365 states. [2019-12-27 01:59:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57365 to 39075. [2019-12-27 01:59:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39075 states. [2019-12-27 01:59:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39075 states to 39075 states and 121471 transitions. [2019-12-27 01:59:35,622 INFO L78 Accepts]: Start accepts. Automaton has 39075 states and 121471 transitions. Word has length 63 [2019-12-27 01:59:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:35,623 INFO L462 AbstractCegarLoop]: Abstraction has 39075 states and 121471 transitions. [2019-12-27 01:59:35,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:59:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 39075 states and 121471 transitions. [2019-12-27 01:59:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:35,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:35,665 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] [2019-12-27 01:59:35,665 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:59:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-27 01:59:35,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:35,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210411400] [2019-12-27 01:59:35,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:35,805 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:59:35,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210411400] [2019-12-27 01:59:35,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:35,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:35,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116704224] [2019-12-27 01:59:35,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:59:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:59:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:59:35,807 INFO L87 Difference]: Start difference. First operand 39075 states and 121471 transitions. Second operand 9 states. [2019-12-27 01:59:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:36,894 INFO L93 Difference]: Finished difference Result 57156 states and 174986 transitions. [2019-12-27 01:59:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:59:36,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 01:59:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:36,981 INFO L225 Difference]: With dead ends: 57156 [2019-12-27 01:59:36,982 INFO L226 Difference]: Without dead ends: 57156 [2019-12-27 01:59:36,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:59:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57156 states. [2019-12-27 01:59:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57156 to 37188. [2019-12-27 01:59:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37188 states. [2019-12-27 01:59:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37188 states to 37188 states and 115854 transitions. [2019-12-27 01:59:37,707 INFO L78 Accepts]: Start accepts. Automaton has 37188 states and 115854 transitions. Word has length 63 [2019-12-27 01:59:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:37,708 INFO L462 AbstractCegarLoop]: Abstraction has 37188 states and 115854 transitions. [2019-12-27 01:59:37,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:59:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37188 states and 115854 transitions. [2019-12-27 01:59:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:37,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:37,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:59:37,747 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:59:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-27 01:59:37,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:37,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21447917] [2019-12-27 01:59:37,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:37,847 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:59:37,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21447917] [2019-12-27 01:59:37,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:37,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:59:37,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287916585] [2019-12-27 01:59:37,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:59:37,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:37,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:59:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:59:37,849 INFO L87 Difference]: Start difference. First operand 37188 states and 115854 transitions. Second operand 8 states. [2019-12-27 01:59:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:40,137 INFO L93 Difference]: Finished difference Result 72763 states and 220945 transitions. [2019-12-27 01:59:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:59:40,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 01:59:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:40,246 INFO L225 Difference]: With dead ends: 72763 [2019-12-27 01:59:40,247 INFO L226 Difference]: Without dead ends: 72495 [2019-12-27 01:59:40,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:59:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72495 states. [2019-12-27 01:59:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72495 to 37638. [2019-12-27 01:59:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37638 states. [2019-12-27 01:59:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37638 states to 37638 states and 117406 transitions. [2019-12-27 01:59:41,068 INFO L78 Accepts]: Start accepts. Automaton has 37638 states and 117406 transitions. Word has length 63 [2019-12-27 01:59:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:41,068 INFO L462 AbstractCegarLoop]: Abstraction has 37638 states and 117406 transitions. [2019-12-27 01:59:41,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:59:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37638 states and 117406 transitions. [2019-12-27 01:59:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:59:41,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:41,109 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] [2019-12-27 01:59:41,109 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:59:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-27 01:59:41,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:41,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982148007] [2019-12-27 01:59:41,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:41,166 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:59:41,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982148007] [2019-12-27 01:59:41,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:41,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:41,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119377631] [2019-12-27 01:59:41,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:41,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:41,168 INFO L87 Difference]: Start difference. First operand 37638 states and 117406 transitions. Second operand 3 states. [2019-12-27 01:59:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:41,351 INFO L93 Difference]: Finished difference Result 37637 states and 117404 transitions. [2019-12-27 01:59:41,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:41,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:59:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:41,443 INFO L225 Difference]: With dead ends: 37637 [2019-12-27 01:59:41,444 INFO L226 Difference]: Without dead ends: 37637 [2019-12-27 01:59:41,444 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:59:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37637 states. [2019-12-27 01:59:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37637 to 33954. [2019-12-27 01:59:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33954 states. [2019-12-27 01:59:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33954 states to 33954 states and 106771 transitions. [2019-12-27 01:59:42,158 INFO L78 Accepts]: Start accepts. Automaton has 33954 states and 106771 transitions. Word has length 63 [2019-12-27 01:59:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:42,159 INFO L462 AbstractCegarLoop]: Abstraction has 33954 states and 106771 transitions. [2019-12-27 01:59:42,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33954 states and 106771 transitions. [2019-12-27 01:59:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:59:42,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:42,196 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:59:42,196 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:59:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:42,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 01:59:42,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:42,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948273848] [2019-12-27 01:59:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:42,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948273848] [2019-12-27 01:59:42,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:42,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:42,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874957006] [2019-12-27 01:59:42,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:42,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:42,256 INFO L87 Difference]: Start difference. First operand 33954 states and 106771 transitions. Second operand 3 states. [2019-12-27 01:59:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:42,468 INFO L93 Difference]: Finished difference Result 39689 states and 123810 transitions. [2019-12-27 01:59:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:42,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:59:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:42,526 INFO L225 Difference]: With dead ends: 39689 [2019-12-27 01:59:42,526 INFO L226 Difference]: Without dead ends: 39689 [2019-12-27 01:59:42,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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:59:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39689 states. [2019-12-27 01:59:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39689 to 34273. [2019-12-27 01:59:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34273 states. [2019-12-27 01:59:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34273 states to 34273 states and 108097 transitions. [2019-12-27 01:59:43,446 INFO L78 Accepts]: Start accepts. Automaton has 34273 states and 108097 transitions. Word has length 64 [2019-12-27 01:59:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:43,447 INFO L462 AbstractCegarLoop]: Abstraction has 34273 states and 108097 transitions. [2019-12-27 01:59:43,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 34273 states and 108097 transitions. [2019-12-27 01:59:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:59:43,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:43,488 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:59:43,488 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-27 01:59:43,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:43,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214942820] [2019-12-27 01:59:43,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:59:43,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214942820] [2019-12-27 01:59:43,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:43,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:59:43,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110927000] [2019-12-27 01:59:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:59:43,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:59:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:59:43,560 INFO L87 Difference]: Start difference. First operand 34273 states and 108097 transitions. Second operand 3 states. [2019-12-27 01:59:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:43,675 INFO L93 Difference]: Finished difference Result 25962 states and 80836 transitions. [2019-12-27 01:59:43,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:59:43,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:59:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:43,714 INFO L225 Difference]: With dead ends: 25962 [2019-12-27 01:59:43,714 INFO L226 Difference]: Without dead ends: 25962 [2019-12-27 01:59:43,715 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:59:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25962 states. [2019-12-27 01:59:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25962 to 23586. [2019-12-27 01:59:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23586 states. [2019-12-27 01:59:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23586 states to 23586 states and 73394 transitions. [2019-12-27 01:59:44,073 INFO L78 Accepts]: Start accepts. Automaton has 23586 states and 73394 transitions. Word has length 65 [2019-12-27 01:59:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:44,073 INFO L462 AbstractCegarLoop]: Abstraction has 23586 states and 73394 transitions. [2019-12-27 01:59:44,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:59:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 23586 states and 73394 transitions. [2019-12-27 01:59:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:44,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:44,096 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:59:44,096 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 01:59:44,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:44,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146772004] [2019-12-27 01:59:44,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:44,282 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:59:44,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146772004] [2019-12-27 01:59:44,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:44,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:44,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498906532] [2019-12-27 01:59:44,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:44,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:44,284 INFO L87 Difference]: Start difference. First operand 23586 states and 73394 transitions. Second operand 11 states. [2019-12-27 01:59:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:45,539 INFO L93 Difference]: Finished difference Result 51451 states and 160122 transitions. [2019-12-27 01:59:45,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:59:45,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:59:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:45,614 INFO L225 Difference]: With dead ends: 51451 [2019-12-27 01:59:45,614 INFO L226 Difference]: Without dead ends: 48891 [2019-12-27 01:59:45,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:59:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48891 states. [2019-12-27 01:59:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48891 to 28522. [2019-12-27 01:59:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28522 states. [2019-12-27 01:59:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28522 states to 28522 states and 88542 transitions. [2019-12-27 01:59:46,230 INFO L78 Accepts]: Start accepts. Automaton has 28522 states and 88542 transitions. Word has length 66 [2019-12-27 01:59:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 28522 states and 88542 transitions. [2019-12-27 01:59:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28522 states and 88542 transitions. [2019-12-27 01:59:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:46,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:46,264 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:59:46,264 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:46,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:46,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-27 01:59:46,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:46,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898983065] [2019-12-27 01:59:46,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:46,409 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:59:46,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898983065] [2019-12-27 01:59:46,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:46,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:59:46,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564425341] [2019-12-27 01:59:46,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:59:46,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:59:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:59:46,411 INFO L87 Difference]: Start difference. First operand 28522 states and 88542 transitions. Second operand 11 states. [2019-12-27 01:59:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:47,464 INFO L93 Difference]: Finished difference Result 49771 states and 153594 transitions. [2019-12-27 01:59:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:59:47,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:59:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:47,876 INFO L225 Difference]: With dead ends: 49771 [2019-12-27 01:59:47,876 INFO L226 Difference]: Without dead ends: 40449 [2019-12-27 01:59:47,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:59:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40449 states. [2019-12-27 01:59:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40449 to 23486. [2019-12-27 01:59:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23486 states. [2019-12-27 01:59:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23486 states to 23486 states and 72496 transitions. [2019-12-27 01:59:48,328 INFO L78 Accepts]: Start accepts. Automaton has 23486 states and 72496 transitions. Word has length 66 [2019-12-27 01:59:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:48,328 INFO L462 AbstractCegarLoop]: Abstraction has 23486 states and 72496 transitions. [2019-12-27 01:59:48,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:59:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 23486 states and 72496 transitions. [2019-12-27 01:59:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:48,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:48,351 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:59:48,351 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-27 01:59:48,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:48,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314447802] [2019-12-27 01:59:48,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:59:48,561 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:59:48,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314447802] [2019-12-27 01:59:48,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:59:48,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:59:48,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713497937] [2019-12-27 01:59:48,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:59:48,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:59:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:59:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:59:48,563 INFO L87 Difference]: Start difference. First operand 23486 states and 72496 transitions. Second operand 12 states. [2019-12-27 01:59:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:59:49,592 INFO L93 Difference]: Finished difference Result 41011 states and 126145 transitions. [2019-12-27 01:59:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:59:49,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 01:59:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:59:49,656 INFO L225 Difference]: With dead ends: 41011 [2019-12-27 01:59:49,656 INFO L226 Difference]: Without dead ends: 40013 [2019-12-27 01:59:49,657 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:59:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40013 states. [2019-12-27 01:59:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40013 to 22818. [2019-12-27 01:59:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22818 states. [2019-12-27 01:59:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22818 states to 22818 states and 70657 transitions. [2019-12-27 01:59:50,144 INFO L78 Accepts]: Start accepts. Automaton has 22818 states and 70657 transitions. Word has length 66 [2019-12-27 01:59:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:59:50,145 INFO L462 AbstractCegarLoop]: Abstraction has 22818 states and 70657 transitions. [2019-12-27 01:59:50,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:59:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22818 states and 70657 transitions. [2019-12-27 01:59:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:59:50,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:59:50,170 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:59:50,170 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:59:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:59:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 4 times [2019-12-27 01:59:50,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:59:50,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663033890] [2019-12-27 01:59:50,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:59:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:59:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:59:50,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:59:50,294 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:59:50,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_22|) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0))) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22| 1) |v_#valid_69|) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_22| 4)) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22|) 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_22|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:50,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-27 01:59:50,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-27 01:59:50,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In258027767 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out258027767| |P1Thread1of1ForFork2_#t~ite10_Out258027767|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In258027767 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out258027767| ~z~0_In258027767) (or .cse0 .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out258027767| ~z$w_buff1~0_In258027767) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In258027767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258027767, ~z$w_buff1~0=~z$w_buff1~0_In258027767, ~z~0=~z~0_In258027767} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out258027767|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In258027767, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out258027767|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258027767, ~z$w_buff1~0=~z$w_buff1~0_In258027767, ~z~0=~z~0_In258027767} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:59:50,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-752195637 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-752195637| |P2Thread1of1ForFork0_#t~ite23_Out-752195637|) (= ~z$w_buff1~0_In-752195637 |P2Thread1of1ForFork0_#t~ite23_Out-752195637|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-752195637 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-752195637 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-752195637 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-752195637 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out-752195637| ~z$w_buff1~0_In-752195637) (= |P2Thread1of1ForFork0_#t~ite23_In-752195637| |P2Thread1of1ForFork0_#t~ite23_Out-752195637|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-752195637, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-752195637, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-752195637|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-752195637, ~z$w_buff1~0=~z$w_buff1~0_In-752195637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-752195637, ~weak$$choice2~0=~weak$$choice2~0_In-752195637} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-752195637, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-752195637|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-752195637, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-752195637|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-752195637, ~z$w_buff1~0=~z$w_buff1~0_In-752195637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-752195637, ~weak$$choice2~0=~weak$$choice2~0_In-752195637} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:59:50,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In863389006 256))) (.cse4 (= (mod ~z$w_buff1_used~0_In863389006 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In863389006 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In863389006 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out863389006| |P2Thread1of1ForFork0_#t~ite29_Out863389006|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In863389006 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) .cse3 (= |P2Thread1of1ForFork0_#t~ite28_Out863389006| 0) (or (not .cse4) .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out863389006| |P2Thread1of1ForFork0_#t~ite29_Out863389006|) .cse5)) (and (= |P2Thread1of1ForFork0_#t~ite28_In863389006| |P2Thread1of1ForFork0_#t~ite28_Out863389006|) (or (and .cse3 (or .cse0 (and .cse6 .cse4) (and .cse6 .cse1)) .cse5 (= ~z$w_buff1_used~0_In863389006 |P2Thread1of1ForFork0_#t~ite29_Out863389006|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In863389006| |P2Thread1of1ForFork0_#t~ite29_Out863389006|) (not .cse3) (= |P2Thread1of1ForFork0_#t~ite30_Out863389006| ~z$w_buff1_used~0_In863389006)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In863389006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In863389006, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863389006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863389006, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863389006, ~weak$$choice2~0=~weak$$choice2~0_In863389006, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In863389006|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out863389006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In863389006, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863389006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863389006, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863389006, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out863389006|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out863389006|, ~weak$$choice2~0=~weak$$choice2~0_In863389006} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:59:50,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:59:50,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:59:50,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2030693531| |P2Thread1of1ForFork0_#t~ite39_Out2030693531|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2030693531 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2030693531 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out2030693531| ~z~0_In2030693531)) (and .cse0 (not .cse2) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2030693531| ~z$w_buff1~0_In2030693531)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030693531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030693531, ~z$w_buff1~0=~z$w_buff1~0_In2030693531, ~z~0=~z~0_In2030693531} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2030693531|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2030693531|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2030693531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2030693531, ~z$w_buff1~0=~z$w_buff1~0_In2030693531, ~z~0=~z~0_In2030693531} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:59:50,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In479408002 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In479408002 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out479408002| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out479408002| ~z$w_buff0_used~0_In479408002) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In479408002, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out479408002|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In479408002} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:59:50,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1587374235 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1587374235 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1587374235 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1587374235 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1587374235 |P2Thread1of1ForFork0_#t~ite41_Out-1587374235|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1587374235|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587374235, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1587374235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587374235, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1587374235} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587374235, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1587374235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587374235, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1587374235, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1587374235|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:59:50,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In80267309 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In80267309 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out80267309|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In80267309 |P2Thread1of1ForFork0_#t~ite42_Out80267309|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In80267309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In80267309} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In80267309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In80267309, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out80267309|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:59:50,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In929093135 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In929093135 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In929093135 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In929093135 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out929093135| ~z$r_buff1_thd3~0_In929093135) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out929093135|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In929093135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In929093135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In929093135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In929093135} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out929093135|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In929093135, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In929093135, ~z$w_buff1_used~0=~z$w_buff1_used~0_In929093135, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In929093135} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:59:50,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:59:50,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1651424587 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1651424587 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1651424587|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1651424587 |P0Thread1of1ForFork1_#t~ite5_Out-1651424587|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1651424587, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1651424587} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1651424587|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1651424587, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1651424587} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:59:50,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1805733586 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1805733586 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1805733586 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1805733586 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1805733586 |P0Thread1of1ForFork1_#t~ite6_Out1805733586|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1805733586|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1805733586, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1805733586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805733586, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1805733586} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1805733586, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1805733586|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1805733586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805733586, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1805733586} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:59:50,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1458707467 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1458707467 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1458707467) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1458707467 ~z$r_buff0_thd1~0_Out-1458707467)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1458707467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1458707467|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1458707467} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:59:50,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-329296191 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-329296191 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-329296191 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-329296191 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-329296191| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-329296191| ~z$r_buff1_thd1~0_In-329296191)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-329296191, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-329296191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-329296191, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-329296191} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-329296191|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-329296191, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-329296191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-329296191, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-329296191} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:59:50,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:59:50,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-898522060 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-898522060 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-898522060|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-898522060| ~z$w_buff0_used~0_In-898522060) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-898522060, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-898522060} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-898522060, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-898522060|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-898522060} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:59:50,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In485011376 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In485011376 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In485011376 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In485011376 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out485011376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out485011376| ~z$w_buff1_used~0_In485011376)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In485011376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In485011376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In485011376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In485011376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In485011376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In485011376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In485011376, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out485011376|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In485011376} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:59:50,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-997197677 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-997197677 256)))) (or (and (= ~z$r_buff0_thd2~0_In-997197677 |P1Thread1of1ForFork2_#t~ite13_Out-997197677|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-997197677|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-997197677, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-997197677} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-997197677, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-997197677|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-997197677} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:59:50,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In642426159 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In642426159 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In642426159 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In642426159 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out642426159| ~z$r_buff1_thd2~0_In642426159) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out642426159| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In642426159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642426159, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In642426159} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In642426159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642426159, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out642426159|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In642426159} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:59:50,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:59:50,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: 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_5|, ~__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:59:50,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1128918884 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1128918884 256)))) (or (and (= ~z~0_In1128918884 |ULTIMATE.start_main_#t~ite47_Out1128918884|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1128918884 |ULTIMATE.start_main_#t~ite47_Out1128918884|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1128918884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1128918884, ~z$w_buff1~0=~z$w_buff1~0_In1128918884, ~z~0=~z~0_In1128918884} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1128918884, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1128918884|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1128918884, ~z$w_buff1~0=~z$w_buff1~0_In1128918884, ~z~0=~z~0_In1128918884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:59:50,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:59:50,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1591357792 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1591357792 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1591357792| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1591357792| ~z$w_buff0_used~0_In-1591357792)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1591357792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1591357792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1591357792|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:59:50,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In323503341 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In323503341 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In323503341 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In323503341 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out323503341| ~z$w_buff1_used~0_In323503341) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out323503341| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In323503341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In323503341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In323503341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In323503341} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out323503341|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In323503341, ~z$w_buff0_used~0=~z$w_buff0_used~0_In323503341, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In323503341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In323503341} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:59:50,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1701400437 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1701400437 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1701400437|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1701400437 |ULTIMATE.start_main_#t~ite51_Out-1701400437|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1701400437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1701400437, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1701400437|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701400437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:59:50,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-211845818 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-211845818 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-211845818 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-211845818 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-211845818|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-211845818 |ULTIMATE.start_main_#t~ite52_Out-211845818|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-211845818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-211845818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211845818} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-211845818|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-211845818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-211845818, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-211845818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211845818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:59:50,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:59:50,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:59:50 BasicIcfg [2019-12-27 01:59:50,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:59:50,418 INFO L168 Benchmark]: Toolchain (without parser) took 126837.73 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,418 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.86 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,419 INFO L168 Benchmark]: Boogie Preprocessor took 45.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 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:59:50,420 INFO L168 Benchmark]: RCFGBuilder took 834.75 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,420 INFO L168 Benchmark]: TraceAbstraction took 125135.29 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:59:50,422 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.48 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.86 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.75 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125135.29 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.7s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10251 SDtfs, 12020 SDslu, 31983 SDs, 0 SdLazy, 16776 SolverSat, 538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 103 SyntacticMatches, 38 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 49.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 436545 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1734 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1631 ConstructedInterpolants, 0 QuantifiedInterpolants, 374365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...