/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:37:18,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:37:18,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:37:18,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:37:18,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:37:18,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:37:18,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:37:18,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:37:18,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:37:18,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:37:18,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:37:18,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:37:18,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:37:18,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:37:18,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:37:18,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:37:18,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:37:18,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:37:18,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:37:18,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:37:18,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:37:18,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:37:18,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:37:18,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:37:18,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:37:18,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:37:18,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:37:18,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:37:18,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:37:18,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:37:18,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:37:18,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:37:18,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:37:18,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:37:18,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:37:18,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:37:18,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:37:18,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:37:18,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:37:18,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:37:18,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:37:18,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:37:18,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:37:18,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:37:18,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:37:18,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:37:18,439 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:37:18,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:37:18,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:37:18,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:37:18,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:37:18,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:37:18,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:37:18,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:37:18,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:37:18,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:37:18,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:37:18,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:37:18,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:37:18,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:37:18,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:37:18,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:37:18,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:37:18,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:37:18,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:37:18,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:37:18,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:37:18,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:37:18,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:37:18,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:37:18,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:37:18,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:37:18,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:37:18,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:37:18,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:37:18,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:37:18,720 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:37:18,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i [2019-12-18 13:37:18,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0439a4/28c9a63fc5d34123ac542c7efc3d30f7/FLAGc31515613 [2019-12-18 13:37:19,340 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:37:19,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.oepc.i [2019-12-18 13:37:19,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0439a4/28c9a63fc5d34123ac542c7efc3d30f7/FLAGc31515613 [2019-12-18 13:37:19,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0439a4/28c9a63fc5d34123ac542c7efc3d30f7 [2019-12-18 13:37:19,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:37:19,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:37:19,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:37:19,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:37:19,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:37:19,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:37:19" (1/1) ... [2019-12-18 13:37:19,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:19, skipping insertion in model container [2019-12-18 13:37:19,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:37:19" (1/1) ... [2019-12-18 13:37:19,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:37:19,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:37:20,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:37:20,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:37:20,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:37:20,471 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:37:20,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20 WrapperNode [2019-12-18 13:37:20,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:37:20,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:37:20,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:37:20,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:37:20,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:37:20,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:37:20,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:37:20,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:37:20,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (1/1) ... [2019-12-18 13:37:20,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:37:20,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:37:20,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:37:20,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:37:20,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (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-18 13:37:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:37:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:37:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:37:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:37:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:37:20,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:37:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:37:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:37:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:37:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:37:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:37:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:37:20,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:37:20,653 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:37:21,415 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:37:21,416 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:37:21,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:37:21 BoogieIcfgContainer [2019-12-18 13:37:21,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:37:21,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:37:21,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:37:21,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:37:21,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:37:19" (1/3) ... [2019-12-18 13:37:21,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353e100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:37:21, skipping insertion in model container [2019-12-18 13:37:21,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:37:20" (2/3) ... [2019-12-18 13:37:21,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353e100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:37:21, skipping insertion in model container [2019-12-18 13:37:21,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:37:21" (3/3) ... [2019-12-18 13:37:21,426 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.oepc.i [2019-12-18 13:37:21,437 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:37:21,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:37:21,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:37:21,446 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:37:21,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:37:21,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:37:21,648 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:37:21,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:37:21,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:37:21,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:37:21,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:37:21,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:37:21,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:37:21,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:37:21,670 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 13:37:21,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:37:21,764 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:37:21,764 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:37:21,783 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 431 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:37:21,811 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:37:21,883 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:37:21,884 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:37:21,895 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 431 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:37:21,921 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:37:21,923 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:37:26,499 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-18 13:37:27,193 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:37:27,326 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:37:27,357 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81673 [2019-12-18 13:37:27,357 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 13:37:27,361 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 13:37:46,956 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117422 states. [2019-12-18 13:37:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 117422 states. [2019-12-18 13:37:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:37:46,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:37:46,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:37:46,964 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-18 13:37:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:37:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash 914906, now seen corresponding path program 1 times [2019-12-18 13:37:46,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:37:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177190913] [2019-12-18 13:37:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:37:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:37:47,224 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-18 13:37:47,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177190913] [2019-12-18 13:37:47,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:37:47,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:37:47,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187229189] [2019-12-18 13:37:47,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:37:47,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:37:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:37:47,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:37:47,253 INFO L87 Difference]: Start difference. First operand 117422 states. Second operand 3 states. [2019-12-18 13:37:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:37:50,427 INFO L93 Difference]: Finished difference Result 116592 states and 500276 transitions. [2019-12-18 13:37:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:37:50,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:37:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:37:51,216 INFO L225 Difference]: With dead ends: 116592 [2019-12-18 13:37:51,216 INFO L226 Difference]: Without dead ends: 109832 [2019-12-18 13:37:51,218 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-18 13:37:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109832 states. [2019-12-18 13:38:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109832 to 109832. [2019-12-18 13:38:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109832 states. [2019-12-18 13:38:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109832 states to 109832 states and 470688 transitions. [2019-12-18 13:38:01,198 INFO L78 Accepts]: Start accepts. Automaton has 109832 states and 470688 transitions. Word has length 3 [2019-12-18 13:38:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:01,198 INFO L462 AbstractCegarLoop]: Abstraction has 109832 states and 470688 transitions. [2019-12-18 13:38:01,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 109832 states and 470688 transitions. [2019-12-18 13:38:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:38:01,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:01,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:01,204 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-18 13:38:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -406604938, now seen corresponding path program 1 times [2019-12-18 13:38:01,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:01,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191011663] [2019-12-18 13:38:01,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:01,331 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-18 13:38:01,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191011663] [2019-12-18 13:38:01,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:01,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:01,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489228408] [2019-12-18 13:38:01,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:38:01,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:38:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:38:01,334 INFO L87 Difference]: Start difference. First operand 109832 states and 470688 transitions. Second operand 4 states. [2019-12-18 13:38:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:06,496 INFO L93 Difference]: Finished difference Result 175346 states and 720050 transitions. [2019-12-18 13:38:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:38:06,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:38:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:07,153 INFO L225 Difference]: With dead ends: 175346 [2019-12-18 13:38:07,153 INFO L226 Difference]: Without dead ends: 175297 [2019-12-18 13:38:07,154 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-18 13:38:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175297 states. [2019-12-18 13:38:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175297 to 159417. [2019-12-18 13:38:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159417 states. [2019-12-18 13:38:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159417 states to 159417 states and 663570 transitions. [2019-12-18 13:38:17,681 INFO L78 Accepts]: Start accepts. Automaton has 159417 states and 663570 transitions. Word has length 11 [2019-12-18 13:38:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:17,681 INFO L462 AbstractCegarLoop]: Abstraction has 159417 states and 663570 transitions. [2019-12-18 13:38:17,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:38:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 159417 states and 663570 transitions. [2019-12-18 13:38:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:38:17,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:17,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:17,687 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-18 13:38:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 901712968, now seen corresponding path program 1 times [2019-12-18 13:38:17,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:17,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940198173] [2019-12-18 13:38:17,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:38:17,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940198173] [2019-12-18 13:38:17,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:17,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532948275] [2019-12-18 13:38:17,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:38:17,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:38:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:38:17,766 INFO L87 Difference]: Start difference. First operand 159417 states and 663570 transitions. Second operand 4 states. [2019-12-18 13:38:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:24,473 INFO L93 Difference]: Finished difference Result 224613 states and 913627 transitions. [2019-12-18 13:38:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:38:24,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:38:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:25,231 INFO L225 Difference]: With dead ends: 224613 [2019-12-18 13:38:25,231 INFO L226 Difference]: Without dead ends: 224557 [2019-12-18 13:38:25,232 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-18 13:38:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224557 states. [2019-12-18 13:38:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224557 to 189220. [2019-12-18 13:38:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189220 states. [2019-12-18 13:38:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189220 states to 189220 states and 783364 transitions. [2019-12-18 13:38:40,196 INFO L78 Accepts]: Start accepts. Automaton has 189220 states and 783364 transitions. Word has length 13 [2019-12-18 13:38:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:40,197 INFO L462 AbstractCegarLoop]: Abstraction has 189220 states and 783364 transitions. [2019-12-18 13:38:40,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:38:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 189220 states and 783364 transitions. [2019-12-18 13:38:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:38:40,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:40,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:40,207 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-18 13:38:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash -100341528, now seen corresponding path program 1 times [2019-12-18 13:38:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828383482] [2019-12-18 13:38:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:40,340 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-18 13:38:40,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828383482] [2019-12-18 13:38:40,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:40,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:38:40,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445871351] [2019-12-18 13:38:40,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:38:40,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:40,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:38:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:38:40,345 INFO L87 Difference]: Start difference. First operand 189220 states and 783364 transitions. Second operand 5 states. [2019-12-18 13:38:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:43,402 INFO L93 Difference]: Finished difference Result 258403 states and 1058469 transitions. [2019-12-18 13:38:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:38:43,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:38:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:52,889 INFO L225 Difference]: With dead ends: 258403 [2019-12-18 13:38:52,889 INFO L226 Difference]: Without dead ends: 258403 [2019-12-18 13:38:52,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:38:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258403 states. [2019-12-18 13:39:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258403 to 213814. [2019-12-18 13:39:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213814 states. [2019-12-18 13:39:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213814 states to 213814 states and 884433 transitions. [2019-12-18 13:39:04,415 INFO L78 Accepts]: Start accepts. Automaton has 213814 states and 884433 transitions. Word has length 16 [2019-12-18 13:39:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:04,415 INFO L462 AbstractCegarLoop]: Abstraction has 213814 states and 884433 transitions. [2019-12-18 13:39:04,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:39:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 213814 states and 884433 transitions. [2019-12-18 13:39:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 13:39:04,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:04,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:04,432 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-18 13:39:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1671186354, now seen corresponding path program 1 times [2019-12-18 13:39:04,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:04,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533063941] [2019-12-18 13:39:04,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:04,497 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-18 13:39:04,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533063941] [2019-12-18 13:39:04,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:04,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:39:04,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445487352] [2019-12-18 13:39:04,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:04,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:04,500 INFO L87 Difference]: Start difference. First operand 213814 states and 884433 transitions. Second operand 3 states. [2019-12-18 13:39:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:12,571 INFO L93 Difference]: Finished difference Result 213628 states and 883659 transitions. [2019-12-18 13:39:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:12,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 13:39:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:13,244 INFO L225 Difference]: With dead ends: 213628 [2019-12-18 13:39:13,244 INFO L226 Difference]: Without dead ends: 213628 [2019-12-18 13:39:13,245 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-18 13:39:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213628 states. [2019-12-18 13:39:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213628 to 213628. [2019-12-18 13:39:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213628 states. [2019-12-18 13:39:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213628 states to 213628 states and 883659 transitions. [2019-12-18 13:39:24,537 INFO L78 Accepts]: Start accepts. Automaton has 213628 states and 883659 transitions. Word has length 18 [2019-12-18 13:39:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:24,537 INFO L462 AbstractCegarLoop]: Abstraction has 213628 states and 883659 transitions. [2019-12-18 13:39:24,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 213628 states and 883659 transitions. [2019-12-18 13:39:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:39:24,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:24,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:24,554 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-18 13:39:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 519654589, now seen corresponding path program 1 times [2019-12-18 13:39:24,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:24,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108350865] [2019-12-18 13:39:24,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:24,613 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-18 13:39:24,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108350865] [2019-12-18 13:39:24,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:24,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:24,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719409647] [2019-12-18 13:39:24,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:24,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:24,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:24,615 INFO L87 Difference]: Start difference. First operand 213628 states and 883659 transitions. Second operand 3 states. [2019-12-18 13:39:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:32,665 INFO L93 Difference]: Finished difference Result 350444 states and 1444264 transitions. [2019-12-18 13:39:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:32,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 13:39:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:34,051 INFO L225 Difference]: With dead ends: 350444 [2019-12-18 13:39:34,051 INFO L226 Difference]: Without dead ends: 198218 [2019-12-18 13:39:34,052 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-18 13:39:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198218 states. [2019-12-18 13:39:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198218 to 187353. [2019-12-18 13:39:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187353 states. [2019-12-18 13:39:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187353 states to 187353 states and 763221 transitions. [2019-12-18 13:39:48,752 INFO L78 Accepts]: Start accepts. Automaton has 187353 states and 763221 transitions. Word has length 19 [2019-12-18 13:39:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:48,752 INFO L462 AbstractCegarLoop]: Abstraction has 187353 states and 763221 transitions. [2019-12-18 13:39:48,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 187353 states and 763221 transitions. [2019-12-18 13:39:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:39:48,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:48,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:48,767 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-18 13:39:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2110977068, now seen corresponding path program 1 times [2019-12-18 13:39:48,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:48,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860791827] [2019-12-18 13:39:48,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:48,816 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-18 13:39:48,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860791827] [2019-12-18 13:39:48,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:48,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:48,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910445220] [2019-12-18 13:39:48,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:48,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:48,818 INFO L87 Difference]: Start difference. First operand 187353 states and 763221 transitions. Second operand 3 states. [2019-12-18 13:39:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:51,439 INFO L93 Difference]: Finished difference Result 318374 states and 1295663 transitions. [2019-12-18 13:39:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:51,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 13:39:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:59,935 INFO L225 Difference]: With dead ends: 318374 [2019-12-18 13:39:59,935 INFO L226 Difference]: Without dead ends: 167121 [2019-12-18 13:39:59,935 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-18 13:40:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167121 states. [2019-12-18 13:40:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167121 to 165648. [2019-12-18 13:40:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165648 states. [2019-12-18 13:40:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165648 states to 165648 states and 662466 transitions. [2019-12-18 13:40:08,413 INFO L78 Accepts]: Start accepts. Automaton has 165648 states and 662466 transitions. Word has length 19 [2019-12-18 13:40:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:08,414 INFO L462 AbstractCegarLoop]: Abstraction has 165648 states and 662466 transitions. [2019-12-18 13:40:08,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 165648 states and 662466 transitions. [2019-12-18 13:40:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:40:08,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:08,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:08,427 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-18 13:40:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1254967176, now seen corresponding path program 1 times [2019-12-18 13:40:08,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:08,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438638288] [2019-12-18 13:40:08,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:08,492 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-18 13:40:08,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438638288] [2019-12-18 13:40:08,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:08,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:08,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071819172] [2019-12-18 13:40:08,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:40:08,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:40:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:08,496 INFO L87 Difference]: Start difference. First operand 165648 states and 662466 transitions. Second operand 4 states. [2019-12-18 13:40:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:08,748 INFO L93 Difference]: Finished difference Result 35790 states and 119539 transitions. [2019-12-18 13:40:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:40:08,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 13:40:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:08,824 INFO L225 Difference]: With dead ends: 35790 [2019-12-18 13:40:08,824 INFO L226 Difference]: Without dead ends: 28955 [2019-12-18 13:40:08,825 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-18 13:40:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28955 states. [2019-12-18 13:40:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28955 to 28002. [2019-12-18 13:40:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-12-18 13:40:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 89704 transitions. [2019-12-18 13:40:09,595 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 89704 transitions. Word has length 19 [2019-12-18 13:40:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:09,595 INFO L462 AbstractCegarLoop]: Abstraction has 28002 states and 89704 transitions. [2019-12-18 13:40:09,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:40:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 89704 transitions. [2019-12-18 13:40:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:40:09,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:09,602 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-18 13:40:09,602 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-18 13:40:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash -914144456, now seen corresponding path program 1 times [2019-12-18 13:40:09,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:09,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233201569] [2019-12-18 13:40:09,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:09,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233201569] [2019-12-18 13:40:09,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:09,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:40:09,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10519923] [2019-12-18 13:40:09,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:09,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:09,732 INFO L87 Difference]: Start difference. First operand 28002 states and 89704 transitions. Second operand 6 states. [2019-12-18 13:40:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:10,504 INFO L93 Difference]: Finished difference Result 31352 states and 96550 transitions. [2019-12-18 13:40:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:40:10,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:40:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:10,554 INFO L225 Difference]: With dead ends: 31352 [2019-12-18 13:40:10,554 INFO L226 Difference]: Without dead ends: 31254 [2019-12-18 13:40:10,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:40:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31254 states. [2019-12-18 13:40:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31254 to 26660. [2019-12-18 13:40:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26660 states. [2019-12-18 13:40:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26660 states to 26660 states and 84926 transitions. [2019-12-18 13:40:13,123 INFO L78 Accepts]: Start accepts. Automaton has 26660 states and 84926 transitions. Word has length 22 [2019-12-18 13:40:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:13,124 INFO L462 AbstractCegarLoop]: Abstraction has 26660 states and 84926 transitions. [2019-12-18 13:40:13,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26660 states and 84926 transitions. [2019-12-18 13:40:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:40:13,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:13,132 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-18 13:40:13,132 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-18 13:40:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1197302566, now seen corresponding path program 1 times [2019-12-18 13:40:13,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:13,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438004147] [2019-12-18 13:40:13,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:13,193 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-18 13:40:13,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438004147] [2019-12-18 13:40:13,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:13,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:13,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789175570] [2019-12-18 13:40:13,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:13,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:13,195 INFO L87 Difference]: Start difference. First operand 26660 states and 84926 transitions. Second operand 5 states. [2019-12-18 13:40:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:13,626 INFO L93 Difference]: Finished difference Result 29361 states and 91137 transitions. [2019-12-18 13:40:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:40:13,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 13:40:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:13,675 INFO L225 Difference]: With dead ends: 29361 [2019-12-18 13:40:13,675 INFO L226 Difference]: Without dead ends: 29149 [2019-12-18 13:40:13,676 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-18 13:40:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2019-12-18 13:40:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 27711. [2019-12-18 13:40:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2019-12-18 13:40:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 87591 transitions. [2019-12-18 13:40:14,162 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 87591 transitions. Word has length 25 [2019-12-18 13:40:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:14,163 INFO L462 AbstractCegarLoop]: Abstraction has 27711 states and 87591 transitions. [2019-12-18 13:40:14,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 87591 transitions. [2019-12-18 13:40:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:40:14,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:14,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:14,174 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-18 13:40:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1712753165, now seen corresponding path program 1 times [2019-12-18 13:40:14,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:14,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448039418] [2019-12-18 13:40:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:14,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448039418] [2019-12-18 13:40:14,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:14,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:40:14,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350109042] [2019-12-18 13:40:14,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:14,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:14,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:14,249 INFO L87 Difference]: Start difference. First operand 27711 states and 87591 transitions. Second operand 6 states. [2019-12-18 13:40:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:15,156 INFO L93 Difference]: Finished difference Result 31580 states and 96673 transitions. [2019-12-18 13:40:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:40:15,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:40:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:15,206 INFO L225 Difference]: With dead ends: 31580 [2019-12-18 13:40:15,206 INFO L226 Difference]: Without dead ends: 30973 [2019-12-18 13:40:15,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:40:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30973 states. [2019-12-18 13:40:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30973 to 28537. [2019-12-18 13:40:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28537 states. [2019-12-18 13:40:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28537 states to 28537 states and 89337 transitions. [2019-12-18 13:40:15,702 INFO L78 Accepts]: Start accepts. Automaton has 28537 states and 89337 transitions. Word has length 27 [2019-12-18 13:40:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:15,702 INFO L462 AbstractCegarLoop]: Abstraction has 28537 states and 89337 transitions. [2019-12-18 13:40:15,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 28537 states and 89337 transitions. [2019-12-18 13:40:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:40:15,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:15,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] [2019-12-18 13:40:15,716 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-18 13:40:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash -449184387, now seen corresponding path program 1 times [2019-12-18 13:40:15,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:15,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051450872] [2019-12-18 13:40:15,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:15,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-18 13:40:15,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051450872] [2019-12-18 13:40:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859531730] [2019-12-18 13:40:15,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:15,796 INFO L87 Difference]: Start difference. First operand 28537 states and 89337 transitions. Second operand 5 states. [2019-12-18 13:40:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:16,562 INFO L93 Difference]: Finished difference Result 42248 states and 131679 transitions. [2019-12-18 13:40:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:16,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 13:40:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:16,628 INFO L225 Difference]: With dead ends: 42248 [2019-12-18 13:40:16,628 INFO L226 Difference]: Without dead ends: 42248 [2019-12-18 13:40:16,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42248 states. [2019-12-18 13:40:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42248 to 38074. [2019-12-18 13:40:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38074 states. [2019-12-18 13:40:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38074 states to 38074 states and 119484 transitions. [2019-12-18 13:40:17,602 INFO L78 Accepts]: Start accepts. Automaton has 38074 states and 119484 transitions. Word has length 30 [2019-12-18 13:40:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:17,602 INFO L462 AbstractCegarLoop]: Abstraction has 38074 states and 119484 transitions. [2019-12-18 13:40:17,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 38074 states and 119484 transitions. [2019-12-18 13:40:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:40:17,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:17,622 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] [2019-12-18 13:40:17,622 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-18 13:40:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -604723026, now seen corresponding path program 1 times [2019-12-18 13:40:17,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:17,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159335935] [2019-12-18 13:40:17,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:17,674 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-18 13:40:17,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159335935] [2019-12-18 13:40:17,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:17,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:17,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724180943] [2019-12-18 13:40:17,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:17,676 INFO L87 Difference]: Start difference. First operand 38074 states and 119484 transitions. Second operand 3 states. [2019-12-18 13:40:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:17,835 INFO L93 Difference]: Finished difference Result 36639 states and 113583 transitions. [2019-12-18 13:40:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:17,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 13:40:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:17,894 INFO L225 Difference]: With dead ends: 36639 [2019-12-18 13:40:17,894 INFO L226 Difference]: Without dead ends: 36639 [2019-12-18 13:40:17,895 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-18 13:40:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36639 states. [2019-12-18 13:40:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36639 to 34821. [2019-12-18 13:40:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2019-12-18 13:40:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 108355 transitions. [2019-12-18 13:40:18,460 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 108355 transitions. Word has length 30 [2019-12-18 13:40:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:18,460 INFO L462 AbstractCegarLoop]: Abstraction has 34821 states and 108355 transitions. [2019-12-18 13:40:18,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 108355 transitions. [2019-12-18 13:40:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 13:40:18,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:18,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] [2019-12-18 13:40:18,479 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-18 13:40:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash 218779071, now seen corresponding path program 1 times [2019-12-18 13:40:18,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:18,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868825153] [2019-12-18 13:40:18,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:18,554 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-18 13:40:18,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868825153] [2019-12-18 13:40:18,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:18,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:40:18,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423744705] [2019-12-18 13:40:18,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:18,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:18,556 INFO L87 Difference]: Start difference. First operand 34821 states and 108355 transitions. Second operand 5 states. [2019-12-18 13:40:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:18,665 INFO L93 Difference]: Finished difference Result 15893 states and 47655 transitions. [2019-12-18 13:40:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:40:18,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 13:40:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:18,695 INFO L225 Difference]: With dead ends: 15893 [2019-12-18 13:40:18,696 INFO L226 Difference]: Without dead ends: 14064 [2019-12-18 13:40:18,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14064 states. [2019-12-18 13:40:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14064 to 13293. [2019-12-18 13:40:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13293 states. [2019-12-18 13:40:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13293 states to 13293 states and 40089 transitions. [2019-12-18 13:40:19,235 INFO L78 Accepts]: Start accepts. Automaton has 13293 states and 40089 transitions. Word has length 31 [2019-12-18 13:40:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:19,235 INFO L462 AbstractCegarLoop]: Abstraction has 13293 states and 40089 transitions. [2019-12-18 13:40:19,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 13293 states and 40089 transitions. [2019-12-18 13:40:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:40:19,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:19,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:19,246 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-18 13:40:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2004852157, now seen corresponding path program 1 times [2019-12-18 13:40:19,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:19,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973665575] [2019-12-18 13:40:19,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:19,314 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-18 13:40:19,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973665575] [2019-12-18 13:40:19,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:19,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:19,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337054874] [2019-12-18 13:40:19,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:19,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:19,316 INFO L87 Difference]: Start difference. First operand 13293 states and 40089 transitions. Second operand 7 states. [2019-12-18 13:40:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:20,081 INFO L93 Difference]: Finished difference Result 14436 states and 42701 transitions. [2019-12-18 13:40:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:40:20,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:40:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:20,106 INFO L225 Difference]: With dead ends: 14436 [2019-12-18 13:40:20,107 INFO L226 Difference]: Without dead ends: 13775 [2019-12-18 13:40:20,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:40:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13775 states. [2019-12-18 13:40:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13775 to 12254. [2019-12-18 13:40:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12254 states. [2019-12-18 13:40:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12254 states to 12254 states and 36675 transitions. [2019-12-18 13:40:20,303 INFO L78 Accepts]: Start accepts. Automaton has 12254 states and 36675 transitions. Word has length 33 [2019-12-18 13:40:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:20,303 INFO L462 AbstractCegarLoop]: Abstraction has 12254 states and 36675 transitions. [2019-12-18 13:40:20,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:40:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12254 states and 36675 transitions. [2019-12-18 13:40:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:40:20,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:20,317 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] [2019-12-18 13:40:20,317 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-18 13:40:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1819810788, now seen corresponding path program 1 times [2019-12-18 13:40:20,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:20,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510616710] [2019-12-18 13:40:20,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:20,384 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-18 13:40:20,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510616710] [2019-12-18 13:40:20,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:20,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:20,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292503510] [2019-12-18 13:40:20,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:20,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:20,386 INFO L87 Difference]: Start difference. First operand 12254 states and 36675 transitions. Second operand 3 states. [2019-12-18 13:40:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:20,443 INFO L93 Difference]: Finished difference Result 12254 states and 36005 transitions. [2019-12-18 13:40:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:20,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 13:40:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:20,463 INFO L225 Difference]: With dead ends: 12254 [2019-12-18 13:40:20,464 INFO L226 Difference]: Without dead ends: 12254 [2019-12-18 13:40:20,464 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-18 13:40:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-12-18 13:40:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 12117. [2019-12-18 13:40:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12117 states. [2019-12-18 13:40:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12117 states to 12117 states and 35634 transitions. [2019-12-18 13:40:20,652 INFO L78 Accepts]: Start accepts. Automaton has 12117 states and 35634 transitions. Word has length 41 [2019-12-18 13:40:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:20,652 INFO L462 AbstractCegarLoop]: Abstraction has 12117 states and 35634 transitions. [2019-12-18 13:40:20,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12117 states and 35634 transitions. [2019-12-18 13:40:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:40:20,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:20,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:20,663 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-18 13:40:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2137859803, now seen corresponding path program 1 times [2019-12-18 13:40:20,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:20,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142925893] [2019-12-18 13:40:20,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:20,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142925893] [2019-12-18 13:40:20,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:20,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:20,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864293954] [2019-12-18 13:40:20,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:20,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:20,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:20,750 INFO L87 Difference]: Start difference. First operand 12117 states and 35634 transitions. Second operand 6 states. [2019-12-18 13:40:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:20,854 INFO L93 Difference]: Finished difference Result 11274 states and 33778 transitions. [2019-12-18 13:40:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:20,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 13:40:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:20,872 INFO L225 Difference]: With dead ends: 11274 [2019-12-18 13:40:20,872 INFO L226 Difference]: Without dead ends: 9188 [2019-12-18 13:40:20,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:40:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2019-12-18 13:40:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9188. [2019-12-18 13:40:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 13:40:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 28892 transitions. [2019-12-18 13:40:21,035 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 28892 transitions. Word has length 42 [2019-12-18 13:40:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:21,035 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 28892 transitions. [2019-12-18 13:40:21,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 28892 transitions. [2019-12-18 13:40:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:40:21,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:21,050 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-18 13:40:21,050 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-18 13:40:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1172574959, now seen corresponding path program 1 times [2019-12-18 13:40:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:21,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173046022] [2019-12-18 13:40:21,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:21,099 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-18 13:40:21,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173046022] [2019-12-18 13:40:21,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:21,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273778681] [2019-12-18 13:40:21,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:21,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:21,101 INFO L87 Difference]: Start difference. First operand 9188 states and 28892 transitions. Second operand 3 states. [2019-12-18 13:40:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:21,180 INFO L93 Difference]: Finished difference Result 12862 states and 39788 transitions. [2019-12-18 13:40:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:21,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:40:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:21,197 INFO L225 Difference]: With dead ends: 12862 [2019-12-18 13:40:21,197 INFO L226 Difference]: Without dead ends: 12862 [2019-12-18 13:40:21,197 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-18 13:40:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-12-18 13:40:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 10222. [2019-12-18 13:40:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10222 states. [2019-12-18 13:40:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10222 states to 10222 states and 31883 transitions. [2019-12-18 13:40:21,368 INFO L78 Accepts]: Start accepts. Automaton has 10222 states and 31883 transitions. Word has length 66 [2019-12-18 13:40:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:21,368 INFO L462 AbstractCegarLoop]: Abstraction has 10222 states and 31883 transitions. [2019-12-18 13:40:21,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10222 states and 31883 transitions. [2019-12-18 13:40:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:40:21,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:21,383 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-18 13:40:21,383 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-18 13:40:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash -5215449, now seen corresponding path program 1 times [2019-12-18 13:40:21,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:21,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480637569] [2019-12-18 13:40:21,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:21,444 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-18 13:40:21,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480637569] [2019-12-18 13:40:21,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:21,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781756712] [2019-12-18 13:40:21,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:21,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:21,447 INFO L87 Difference]: Start difference. First operand 10222 states and 31883 transitions. Second operand 3 states. [2019-12-18 13:40:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:21,537 INFO L93 Difference]: Finished difference Result 12382 states and 38387 transitions. [2019-12-18 13:40:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:21,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:40:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:21,560 INFO L225 Difference]: With dead ends: 12382 [2019-12-18 13:40:21,560 INFO L226 Difference]: Without dead ends: 12382 [2019-12-18 13:40:21,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12382 states. [2019-12-18 13:40:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12382 to 10105. [2019-12-18 13:40:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10105 states. [2019-12-18 13:40:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10105 states to 10105 states and 31731 transitions. [2019-12-18 13:40:21,917 INFO L78 Accepts]: Start accepts. Automaton has 10105 states and 31731 transitions. Word has length 66 [2019-12-18 13:40:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:21,917 INFO L462 AbstractCegarLoop]: Abstraction has 10105 states and 31731 transitions. [2019-12-18 13:40:21,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10105 states and 31731 transitions. [2019-12-18 13:40:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:21,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:21,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:21,928 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-18 13:40:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 284301030, now seen corresponding path program 1 times [2019-12-18 13:40:21,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:21,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043104774] [2019-12-18 13:40:21,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:22,624 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-18 13:40:22,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043104774] [2019-12-18 13:40:22,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:22,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:40:22,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462316051] [2019-12-18 13:40:22,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:40:22,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:40:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:40:22,626 INFO L87 Difference]: Start difference. First operand 10105 states and 31731 transitions. Second operand 17 states. [2019-12-18 13:40:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:24,650 INFO L93 Difference]: Finished difference Result 15524 states and 47499 transitions. [2019-12-18 13:40:24,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 13:40:24,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:40:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:24,669 INFO L225 Difference]: With dead ends: 15524 [2019-12-18 13:40:24,670 INFO L226 Difference]: Without dead ends: 13137 [2019-12-18 13:40:24,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 13:40:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13137 states. [2019-12-18 13:40:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13137 to 11575. [2019-12-18 13:40:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11575 states. [2019-12-18 13:40:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 35827 transitions. [2019-12-18 13:40:24,854 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 35827 transitions. Word has length 67 [2019-12-18 13:40:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:24,854 INFO L462 AbstractCegarLoop]: Abstraction has 11575 states and 35827 transitions. [2019-12-18 13:40:24,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:40:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 35827 transitions. [2019-12-18 13:40:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:24,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:24,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:24,866 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-18 13:40:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1337361878, now seen corresponding path program 2 times [2019-12-18 13:40:24,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:24,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287834410] [2019-12-18 13:40:24,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:25,433 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-18 13:40:25,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287834410] [2019-12-18 13:40:25,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:25,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 13:40:25,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424921821] [2019-12-18 13:40:25,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 13:40:25,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:25,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 13:40:25,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:40:25,435 INFO L87 Difference]: Start difference. First operand 11575 states and 35827 transitions. Second operand 19 states. [2019-12-18 13:40:27,210 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-18 13:40:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:27,689 INFO L93 Difference]: Finished difference Result 13367 states and 41013 transitions. [2019-12-18 13:40:27,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 13:40:27,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 13:40:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:27,709 INFO L225 Difference]: With dead ends: 13367 [2019-12-18 13:40:27,709 INFO L226 Difference]: Without dead ends: 13049 [2019-12-18 13:40:27,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 13:40:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13049 states. [2019-12-18 13:40:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13049 to 11487. [2019-12-18 13:40:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-12-18 13:40:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 35574 transitions. [2019-12-18 13:40:27,894 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 35574 transitions. Word has length 67 [2019-12-18 13:40:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:27,894 INFO L462 AbstractCegarLoop]: Abstraction has 11487 states and 35574 transitions. [2019-12-18 13:40:27,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 13:40:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 35574 transitions. [2019-12-18 13:40:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:27,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:27,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:27,907 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-18 13:40:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1956463094, now seen corresponding path program 3 times [2019-12-18 13:40:27,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:27,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398304967] [2019-12-18 13:40:27,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:28,305 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-18 13:40:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398304967] [2019-12-18 13:40:28,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:40:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936970242] [2019-12-18 13:40:28,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:40:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:40:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:40:28,307 INFO L87 Difference]: Start difference. First operand 11487 states and 35574 transitions. Second operand 17 states. [2019-12-18 13:40:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:30,237 INFO L93 Difference]: Finished difference Result 13404 states and 41050 transitions. [2019-12-18 13:40:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:40:30,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:40:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:30,257 INFO L225 Difference]: With dead ends: 13404 [2019-12-18 13:40:30,257 INFO L226 Difference]: Without dead ends: 12673 [2019-12-18 13:40:30,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:40:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-18 13:40:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 10959. [2019-12-18 13:40:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10959 states. [2019-12-18 13:40:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10959 states to 10959 states and 34056 transitions. [2019-12-18 13:40:30,433 INFO L78 Accepts]: Start accepts. Automaton has 10959 states and 34056 transitions. Word has length 67 [2019-12-18 13:40:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:30,434 INFO L462 AbstractCegarLoop]: Abstraction has 10959 states and 34056 transitions. [2019-12-18 13:40:30,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:40:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10959 states and 34056 transitions. [2019-12-18 13:40:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:30,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:30,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:30,446 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-18 13:40:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1283650718, now seen corresponding path program 4 times [2019-12-18 13:40:30,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:30,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093348491] [2019-12-18 13:40:30,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:31,012 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-18 13:40:31,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093348491] [2019-12-18 13:40:31,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:31,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:40:31,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725959496] [2019-12-18 13:40:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:40:31,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:31,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:40:31,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:40:31,015 INFO L87 Difference]: Start difference. First operand 10959 states and 34056 transitions. Second operand 16 states. [2019-12-18 13:40:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:34,782 INFO L93 Difference]: Finished difference Result 26358 states and 79378 transitions. [2019-12-18 13:40:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 13:40:34,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:40:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:34,808 INFO L225 Difference]: With dead ends: 26358 [2019-12-18 13:40:34,808 INFO L226 Difference]: Without dead ends: 16261 [2019-12-18 13:40:34,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=2174, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 13:40:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2019-12-18 13:40:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 12524. [2019-12-18 13:40:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12524 states. [2019-12-18 13:40:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12524 states to 12524 states and 38361 transitions. [2019-12-18 13:40:35,034 INFO L78 Accepts]: Start accepts. Automaton has 12524 states and 38361 transitions. Word has length 67 [2019-12-18 13:40:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:35,034 INFO L462 AbstractCegarLoop]: Abstraction has 12524 states and 38361 transitions. [2019-12-18 13:40:35,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:40:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12524 states and 38361 transitions. [2019-12-18 13:40:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:35,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:35,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:35,047 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-18 13:40:35,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1351968445, now seen corresponding path program 1 times [2019-12-18 13:40:35,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:35,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876911209] [2019-12-18 13:40:35,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:35,088 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-18 13:40:35,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876911209] [2019-12-18 13:40:35,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:35,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:35,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419443946] [2019-12-18 13:40:35,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:35,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:35,092 INFO L87 Difference]: Start difference. First operand 12524 states and 38361 transitions. Second operand 3 states. [2019-12-18 13:40:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:35,178 INFO L93 Difference]: Finished difference Result 14179 states and 42212 transitions. [2019-12-18 13:40:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:35,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:40:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:35,202 INFO L225 Difference]: With dead ends: 14179 [2019-12-18 13:40:35,202 INFO L226 Difference]: Without dead ends: 14179 [2019-12-18 13:40:35,203 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-18 13:40:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2019-12-18 13:40:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12361. [2019-12-18 13:40:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12361 states. [2019-12-18 13:40:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 37047 transitions. [2019-12-18 13:40:35,427 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 37047 transitions. Word has length 67 [2019-12-18 13:40:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:35,427 INFO L462 AbstractCegarLoop]: Abstraction has 12361 states and 37047 transitions. [2019-12-18 13:40:35,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 37047 transitions. [2019-12-18 13:40:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:40:35,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:35,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:35,440 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-18 13:40:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash 508154070, now seen corresponding path program 1 times [2019-12-18 13:40:35,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:35,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417993364] [2019-12-18 13:40:35,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:35,514 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-18 13:40:35,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417993364] [2019-12-18 13:40:35,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:35,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:40:35,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945883378] [2019-12-18 13:40:35,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:35,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:35,516 INFO L87 Difference]: Start difference. First operand 12361 states and 37047 transitions. Second operand 7 states. Received shutdown request... [2019-12-18 13:40:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:40:35,546 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 13:40:35,551 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 13:40:35,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:40:35 BasicIcfg [2019-12-18 13:40:35,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:40:35,553 INFO L168 Benchmark]: Toolchain (without parser) took 195933.66 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,554 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.69 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 158.6 MB in the end (delta: -57.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,563 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,563 INFO L168 Benchmark]: RCFGBuilder took 839.87 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 103.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,563 INFO L168 Benchmark]: TraceAbstraction took 194132.81 ms. Allocated memory was 205.0 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:40:35,569 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.69 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 158.6 MB in the end (delta: -57.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.87 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 103.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194132.81 ms. Allocated memory was 205.0 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 7291 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 267 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 81673 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (12361states) and FLOYD_HOARE automaton (currently 4 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (10 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (12361states) and FLOYD_HOARE automaton (currently 4 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (10 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 193.9s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 74.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4088 SDtfs, 5941 SDslu, 11574 SDs, 0 SdLazy, 10342 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 34 SyntacticMatches, 17 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213814occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 141296 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 933 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 271338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 could not prove your program: Timeout Completed graceful shutdown