/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/safe018_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:47:54,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:47:54,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:47:54,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:47:54,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:47:54,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:47:54,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:47:54,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:47:54,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:47:54,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:47:54,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:47:54,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:47:54,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:47:54,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:47:54,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:47:54,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:47:54,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:47:54,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:47:54,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:47:54,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:47:54,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:47:54,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:47:54,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:47:54,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:47:54,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:47:54,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:47:54,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:47:54,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:47:54,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:47:54,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:47:54,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:47:54,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:47:54,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:47:54,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:47:54,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:47:54,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:47:54,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:47:54,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:47:54,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:47:54,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:47:54,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:47:54,487 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 14:47:54,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:47:54,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:47:54,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:47:54,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:47:54,522 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:47:54,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:47:54,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:47:54,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:47:54,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:47:54,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:47:54,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:47:54,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:47:54,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:47:54,524 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:47:54,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:47:54,525 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:47:54,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:47:54,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:47:54,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:47:54,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:47:54,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:47:54,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:47:54,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:47:54,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:47:54,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:47:54,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:47:54,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:47:54,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:47:54,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:47:54,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:47:54,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:47:54,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:47:54,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:47:54,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:47:54,817 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:47:54,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2019-12-18 14:47:54,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efdcebd0/c495a8075c0f43029a667d3ee4b895ae/FLAG036e98d9c [2019-12-18 14:47:55,439 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:47:55,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2019-12-18 14:47:55,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efdcebd0/c495a8075c0f43029a667d3ee4b895ae/FLAG036e98d9c [2019-12-18 14:47:55,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efdcebd0/c495a8075c0f43029a667d3ee4b895ae [2019-12-18 14:47:55,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:47:55,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:47:55,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:47:55,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:47:55,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:47:55,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:47:55" (1/1) ... [2019-12-18 14:47:55,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357bbf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:55, skipping insertion in model container [2019-12-18 14:47:55,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:47:55" (1/1) ... [2019-12-18 14:47:55,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:47:55,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:47:56,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:47:56,281 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:47:56,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:47:56,473 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:47:56,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56 WrapperNode [2019-12-18 14:47:56,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:47:56,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:47:56,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:47:56,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:47:56,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:47:56,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:47:56,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:47:56,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:47:56,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (1/1) ... [2019-12-18 14:47:56,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:47:56,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:47:56,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:47:56,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:47:56,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (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 14:47:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 14:47:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:47:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:47:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:47:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:47:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:47:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:47:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:47:56,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:47:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:47:56,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:47:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 14:47:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:47:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:47:56,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:47:56,686 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 14:47:57,657 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:47:57,658 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 14:47:57,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:47:57 BoogieIcfgContainer [2019-12-18 14:47:57,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:47:57,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:47:57,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:47:57,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:47:57,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:47:55" (1/3) ... [2019-12-18 14:47:57,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701c26d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:47:57, skipping insertion in model container [2019-12-18 14:47:57,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:47:56" (2/3) ... [2019-12-18 14:47:57,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701c26d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:47:57, skipping insertion in model container [2019-12-18 14:47:57,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:47:57" (3/3) ... [2019-12-18 14:47:57,669 INFO L109 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2019-12-18 14:47:57,680 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:47:57,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:47:57,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 14:47:57,691 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:47:57,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,841 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:47:57,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 14:47:57,881 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:47:57,881 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:47:57,881 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:47:57,881 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:47:57,881 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:47:57,881 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:47:57,882 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:47:57,882 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:47:57,907 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 276 transitions [2019-12-18 14:47:57,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-18 14:47:58,044 INFO L126 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-18 14:47:58,045 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:47:58,073 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-18 14:47:58,120 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-18 14:47:58,203 INFO L126 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-18 14:47:58,204 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:47:58,219 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-18 14:47:58,288 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32976 [2019-12-18 14:47:58,290 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:48:04,628 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-18 14:48:04,809 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-18 14:48:05,399 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-18 14:48:05,641 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-18 14:48:05,677 INFO L206 etLargeBlockEncoding]: Checked pairs total: 189775 [2019-12-18 14:48:05,678 INFO L214 etLargeBlockEncoding]: Total number of compositions: 150 [2019-12-18 14:48:05,681 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 140 transitions [2019-12-18 14:49:44,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 300418 states. [2019-12-18 14:49:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 300418 states. [2019-12-18 14:49:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:49:44,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:49:44,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:49:44,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:49:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:49:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1661782997, now seen corresponding path program 1 times [2019-12-18 14:49:44,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:49:44,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66957238] [2019-12-18 14:49:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:49:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:49:45,023 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 14:49:45,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66957238] [2019-12-18 14:49:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:49:45,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:49:45,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614007628] [2019-12-18 14:49:45,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:49:45,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:49:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:49:45,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:49:45,052 INFO L87 Difference]: Start difference. First operand 300418 states. Second operand 4 states. [2019-12-18 14:49:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:49:45,847 INFO L93 Difference]: Finished difference Result 73618 states and 285157 transitions. [2019-12-18 14:49:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:49:45,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:49:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:49:46,253 INFO L225 Difference]: With dead ends: 73618 [2019-12-18 14:49:46,253 INFO L226 Difference]: Without dead ends: 52546 [2019-12-18 14:49:46,255 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 14:49:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52546 states. [2019-12-18 14:49:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52546 to 52546. [2019-12-18 14:49:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2019-12-18 14:49:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 192443 transitions. [2019-12-18 14:49:48,537 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 192443 transitions. Word has length 17 [2019-12-18 14:49:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:49:48,539 INFO L462 AbstractCegarLoop]: Abstraction has 52546 states and 192443 transitions. [2019-12-18 14:49:48,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:49:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 192443 transitions. [2019-12-18 14:49:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:49:48,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:49:48,579 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 14:49:48,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:49:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:49:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1182476017, now seen corresponding path program 1 times [2019-12-18 14:49:48,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:49:48,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154374633] [2019-12-18 14:49:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:49:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:49:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:49:49,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154374633] [2019-12-18 14:49:49,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:49:49,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:49:49,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804924644] [2019-12-18 14:49:49,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:49:49,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:49:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:49:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:49:49,428 INFO L87 Difference]: Start difference. First operand 52546 states and 192443 transitions. Second operand 5 states. [2019-12-18 14:49:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:49:50,634 INFO L93 Difference]: Finished difference Result 74825 states and 262435 transitions. [2019-12-18 14:49:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:49:50,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:49:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:49:50,953 INFO L225 Difference]: With dead ends: 74825 [2019-12-18 14:49:50,953 INFO L226 Difference]: Without dead ends: 74825 [2019-12-18 14:49:50,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 14:49:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74825 states. [2019-12-18 14:49:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74825 to 70361. [2019-12-18 14:49:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70361 states. [2019-12-18 14:49:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70361 states to 70361 states and 248252 transitions. [2019-12-18 14:49:52,984 INFO L78 Accepts]: Start accepts. Automaton has 70361 states and 248252 transitions. Word has length 27 [2019-12-18 14:49:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:49:52,984 INFO L462 AbstractCegarLoop]: Abstraction has 70361 states and 248252 transitions. [2019-12-18 14:49:52,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:49:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70361 states and 248252 transitions. [2019-12-18 14:49:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:49:53,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:49:53,016 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] [2019-12-18 14:49:53,016 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:49:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:49:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1249777740, now seen corresponding path program 1 times [2019-12-18 14:49:53,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:49:53,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705240064] [2019-12-18 14:49:53,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:49:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:49:53,139 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 14:49:53,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705240064] [2019-12-18 14:49:53,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:49:53,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:49:53,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895895219] [2019-12-18 14:49:53,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:49:53,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:49:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:49:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:49:53,141 INFO L87 Difference]: Start difference. First operand 70361 states and 248252 transitions. Second operand 4 states. [2019-12-18 14:49:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:49:57,834 INFO L93 Difference]: Finished difference Result 72284 states and 253128 transitions. [2019-12-18 14:49:57,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:49:57,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 14:49:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:49:58,072 INFO L225 Difference]: With dead ends: 72284 [2019-12-18 14:49:58,072 INFO L226 Difference]: Without dead ends: 70229 [2019-12-18 14:49:58,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:49:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70229 states. [2019-12-18 14:50:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70229 to 70229. [2019-12-18 14:50:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70229 states. [2019-12-18 14:50:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70229 states to 70229 states and 247830 transitions. [2019-12-18 14:50:00,350 INFO L78 Accepts]: Start accepts. Automaton has 70229 states and 247830 transitions. Word has length 29 [2019-12-18 14:50:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:00,352 INFO L462 AbstractCegarLoop]: Abstraction has 70229 states and 247830 transitions. [2019-12-18 14:50:00,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:50:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 70229 states and 247830 transitions. [2019-12-18 14:50:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:50:00,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:00,381 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 14:50:00,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:00,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1234943620, now seen corresponding path program 1 times [2019-12-18 14:50:00,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:00,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480913135] [2019-12-18 14:50:00,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:00,487 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 14:50:00,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480913135] [2019-12-18 14:50:00,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:00,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:50:00,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684364259] [2019-12-18 14:50:00,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:50:00,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:50:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:50:00,490 INFO L87 Difference]: Start difference. First operand 70229 states and 247830 transitions. Second operand 5 states. [2019-12-18 14:50:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:00,696 INFO L93 Difference]: Finished difference Result 31831 states and 107324 transitions. [2019-12-18 14:50:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:50:00,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 14:50:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:00,767 INFO L225 Difference]: With dead ends: 31831 [2019-12-18 14:50:00,767 INFO L226 Difference]: Without dead ends: 27976 [2019-12-18 14:50:00,768 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 14:50:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27976 states. [2019-12-18 14:50:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27976 to 27928. [2019-12-18 14:50:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27928 states. [2019-12-18 14:50:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27928 states to 27928 states and 94296 transitions. [2019-12-18 14:50:02,672 INFO L78 Accepts]: Start accepts. Automaton has 27928 states and 94296 transitions. Word has length 30 [2019-12-18 14:50:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:02,673 INFO L462 AbstractCegarLoop]: Abstraction has 27928 states and 94296 transitions. [2019-12-18 14:50:02,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:50:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27928 states and 94296 transitions. [2019-12-18 14:50:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 14:50:02,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:02,768 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] [2019-12-18 14:50:02,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1487448694, now seen corresponding path program 1 times [2019-12-18 14:50:02,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:02,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046815649] [2019-12-18 14:50:02,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:02,941 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 14:50:02,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046815649] [2019-12-18 14:50:02,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:02,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:50:02,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346361301] [2019-12-18 14:50:02,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:50:02,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:50:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:50:02,944 INFO L87 Difference]: Start difference. First operand 27928 states and 94296 transitions. Second operand 3 states. [2019-12-18 14:50:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:03,160 INFO L93 Difference]: Finished difference Result 27840 states and 94003 transitions. [2019-12-18 14:50:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:50:03,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 14:50:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:03,252 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 14:50:03,252 INFO L226 Difference]: Without dead ends: 27840 [2019-12-18 14:50:03,253 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 14:50:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27840 states. [2019-12-18 14:50:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27840 to 27201. [2019-12-18 14:50:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27201 states. [2019-12-18 14:50:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27201 states to 27201 states and 92329 transitions. [2019-12-18 14:50:04,436 INFO L78 Accepts]: Start accepts. Automaton has 27201 states and 92329 transitions. Word has length 44 [2019-12-18 14:50:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:04,436 INFO L462 AbstractCegarLoop]: Abstraction has 27201 states and 92329 transitions. [2019-12-18 14:50:04,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:50:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 27201 states and 92329 transitions. [2019-12-18 14:50:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 14:50:04,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:04,500 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] [2019-12-18 14:50:04,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:04,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1491268753, now seen corresponding path program 1 times [2019-12-18 14:50:04,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:04,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694355918] [2019-12-18 14:50:04,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:04,621 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 14:50:04,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694355918] [2019-12-18 14:50:04,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:04,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:50:04,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603869276] [2019-12-18 14:50:04,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:50:04,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:50:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:50:04,623 INFO L87 Difference]: Start difference. First operand 27201 states and 92329 transitions. Second operand 4 states. [2019-12-18 14:50:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:05,034 INFO L93 Difference]: Finished difference Result 31632 states and 104896 transitions. [2019-12-18 14:50:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:50:05,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 14:50:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:05,089 INFO L225 Difference]: With dead ends: 31632 [2019-12-18 14:50:05,089 INFO L226 Difference]: Without dead ends: 31632 [2019-12-18 14:50:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 14:50:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31632 states. [2019-12-18 14:50:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31632 to 28071. [2019-12-18 14:50:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28071 states. [2019-12-18 14:50:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28071 states to 28071 states and 94167 transitions. [2019-12-18 14:50:05,894 INFO L78 Accepts]: Start accepts. Automaton has 28071 states and 94167 transitions. Word has length 44 [2019-12-18 14:50:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:05,894 INFO L462 AbstractCegarLoop]: Abstraction has 28071 states and 94167 transitions. [2019-12-18 14:50:05,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:50:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28071 states and 94167 transitions. [2019-12-18 14:50:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 14:50:05,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:05,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:50:05,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 404604009, now seen corresponding path program 1 times [2019-12-18 14:50:05,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:05,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833697714] [2019-12-18 14:50:05,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:06,092 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 14:50:06,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833697714] [2019-12-18 14:50:06,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:06,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:50:06,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450186298] [2019-12-18 14:50:06,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:50:06,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:50:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:50:06,095 INFO L87 Difference]: Start difference. First operand 28071 states and 94167 transitions. Second operand 5 states. [2019-12-18 14:50:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:06,521 INFO L93 Difference]: Finished difference Result 37444 states and 125295 transitions. [2019-12-18 14:50:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:50:06,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-18 14:50:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:06,604 INFO L225 Difference]: With dead ends: 37444 [2019-12-18 14:50:06,604 INFO L226 Difference]: Without dead ends: 34098 [2019-12-18 14:50:06,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 14:50:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34098 states. [2019-12-18 14:50:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34098 to 32749. [2019-12-18 14:50:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32749 states. [2019-12-18 14:50:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32749 states to 32749 states and 111242 transitions. [2019-12-18 14:50:07,731 INFO L78 Accepts]: Start accepts. Automaton has 32749 states and 111242 transitions. Word has length 45 [2019-12-18 14:50:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:07,731 INFO L462 AbstractCegarLoop]: Abstraction has 32749 states and 111242 transitions. [2019-12-18 14:50:07,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:50:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32749 states and 111242 transitions. [2019-12-18 14:50:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 14:50:07,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:07,788 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] [2019-12-18 14:50:07,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1738823915, now seen corresponding path program 2 times [2019-12-18 14:50:07,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:07,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895994969] [2019-12-18 14:50:07,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:07,882 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 14:50:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895994969] [2019-12-18 14:50:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:07,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:50:07,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777960156] [2019-12-18 14:50:07,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:50:07,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:50:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:50:07,884 INFO L87 Difference]: Start difference. First operand 32749 states and 111242 transitions. Second operand 5 states. [2019-12-18 14:50:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:08,098 INFO L93 Difference]: Finished difference Result 41549 states and 139814 transitions. [2019-12-18 14:50:08,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:50:08,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-18 14:50:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:08,115 INFO L225 Difference]: With dead ends: 41549 [2019-12-18 14:50:08,116 INFO L226 Difference]: Without dead ends: 9651 [2019-12-18 14:50:08,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:50:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9651 states. [2019-12-18 14:50:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9651 to 9651. [2019-12-18 14:50:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9651 states. [2019-12-18 14:50:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9651 states to 9651 states and 30633 transitions. [2019-12-18 14:50:08,283 INFO L78 Accepts]: Start accepts. Automaton has 9651 states and 30633 transitions. Word has length 45 [2019-12-18 14:50:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:08,283 INFO L462 AbstractCegarLoop]: Abstraction has 9651 states and 30633 transitions. [2019-12-18 14:50:08,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:50:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9651 states and 30633 transitions. [2019-12-18 14:50:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:50:08,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:08,297 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] [2019-12-18 14:50:08,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -425177422, now seen corresponding path program 1 times [2019-12-18 14:50:08,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:08,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542370565] [2019-12-18 14:50:08,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:08,391 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 14:50:08,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542370565] [2019-12-18 14:50:08,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:08,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:50:08,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526656215] [2019-12-18 14:50:08,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:50:08,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:50:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:50:08,393 INFO L87 Difference]: Start difference. First operand 9651 states and 30633 transitions. Second operand 4 states. [2019-12-18 14:50:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:08,628 INFO L93 Difference]: Finished difference Result 10795 states and 34118 transitions. [2019-12-18 14:50:08,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:50:08,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:50:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:08,651 INFO L225 Difference]: With dead ends: 10795 [2019-12-18 14:50:08,651 INFO L226 Difference]: Without dead ends: 10795 [2019-12-18 14:50:08,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 14:50:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2019-12-18 14:50:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10311. [2019-12-18 14:50:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10311 states. [2019-12-18 14:50:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10311 states to 10311 states and 32700 transitions. [2019-12-18 14:50:08,895 INFO L78 Accepts]: Start accepts. Automaton has 10311 states and 32700 transitions. Word has length 54 [2019-12-18 14:50:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:08,895 INFO L462 AbstractCegarLoop]: Abstraction has 10311 states and 32700 transitions. [2019-12-18 14:50:08,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:50:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10311 states and 32700 transitions. [2019-12-18 14:50:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:50:08,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:08,912 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] [2019-12-18 14:50:08,912 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1042518972, now seen corresponding path program 1 times [2019-12-18 14:50:08,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:08,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164198527] [2019-12-18 14:50:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:08,985 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 14:50:08,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164198527] [2019-12-18 14:50:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:50:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75598226] [2019-12-18 14:50:08,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:50:08,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:50:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:50:08,987 INFO L87 Difference]: Start difference. First operand 10311 states and 32700 transitions. Second operand 3 states. [2019-12-18 14:50:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:09,059 INFO L93 Difference]: Finished difference Result 10311 states and 32086 transitions. [2019-12-18 14:50:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:50:09,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:50:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:09,079 INFO L225 Difference]: With dead ends: 10311 [2019-12-18 14:50:09,080 INFO L226 Difference]: Without dead ends: 10311 [2019-12-18 14:50:09,080 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 14:50:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10311 states. [2019-12-18 14:50:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10311 to 10240. [2019-12-18 14:50:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10240 states. [2019-12-18 14:50:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 31895 transitions. [2019-12-18 14:50:09,318 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 31895 transitions. Word has length 55 [2019-12-18 14:50:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:09,318 INFO L462 AbstractCegarLoop]: Abstraction has 10240 states and 31895 transitions. [2019-12-18 14:50:09,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:50:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 31895 transitions. [2019-12-18 14:50:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:50:09,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:09,334 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] [2019-12-18 14:50:09,335 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:09,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1863264081, now seen corresponding path program 1 times [2019-12-18 14:50:09,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:09,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490688496] [2019-12-18 14:50:09,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:09,411 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 14:50:09,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490688496] [2019-12-18 14:50:09,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:09,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:50:09,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699789635] [2019-12-18 14:50:09,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:50:09,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:50:09,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:50:09,413 INFO L87 Difference]: Start difference. First operand 10240 states and 31895 transitions. Second operand 5 states. [2019-12-18 14:50:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:09,772 INFO L93 Difference]: Finished difference Result 14299 states and 43753 transitions. [2019-12-18 14:50:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:50:09,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 14:50:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:09,794 INFO L225 Difference]: With dead ends: 14299 [2019-12-18 14:50:09,794 INFO L226 Difference]: Without dead ends: 14299 [2019-12-18 14:50:09,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:50:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-12-18 14:50:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 12484. [2019-12-18 14:50:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12484 states. [2019-12-18 14:50:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12484 states to 12484 states and 38864 transitions. [2019-12-18 14:50:10,006 INFO L78 Accepts]: Start accepts. Automaton has 12484 states and 38864 transitions. Word has length 55 [2019-12-18 14:50:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:10,006 INFO L462 AbstractCegarLoop]: Abstraction has 12484 states and 38864 transitions. [2019-12-18 14:50:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:50:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12484 states and 38864 transitions. [2019-12-18 14:50:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:50:10,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:10,020 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] [2019-12-18 14:50:10,021 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2053065431, now seen corresponding path program 1 times [2019-12-18 14:50:10,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:10,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307943064] [2019-12-18 14:50:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:10,103 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 14:50:10,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307943064] [2019-12-18 14:50:10,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:10,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:50:10,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689779953] [2019-12-18 14:50:10,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:50:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:50:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:50:10,105 INFO L87 Difference]: Start difference. First operand 12484 states and 38864 transitions. Second operand 3 states. [2019-12-18 14:50:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:10,164 INFO L93 Difference]: Finished difference Result 12484 states and 38810 transitions. [2019-12-18 14:50:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:50:10,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 14:50:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:10,187 INFO L225 Difference]: With dead ends: 12484 [2019-12-18 14:50:10,187 INFO L226 Difference]: Without dead ends: 12484 [2019-12-18 14:50:10,188 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 14:50:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12484 states. [2019-12-18 14:50:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12484 to 12484. [2019-12-18 14:50:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12484 states. [2019-12-18 14:50:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12484 states to 12484 states and 38810 transitions. [2019-12-18 14:50:10,399 INFO L78 Accepts]: Start accepts. Automaton has 12484 states and 38810 transitions. Word has length 56 [2019-12-18 14:50:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:10,399 INFO L462 AbstractCegarLoop]: Abstraction has 12484 states and 38810 transitions. [2019-12-18 14:50:10,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:50:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 12484 states and 38810 transitions. [2019-12-18 14:50:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:50:10,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:10,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:50:10,414 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash 778294480, now seen corresponding path program 1 times [2019-12-18 14:50:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:10,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473121425] [2019-12-18 14:50:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:10,534 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 14:50:10,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473121425] [2019-12-18 14:50:10,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:10,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:50:10,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285886842] [2019-12-18 14:50:10,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:50:10,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:50:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:50:10,536 INFO L87 Difference]: Start difference. First operand 12484 states and 38810 transitions. Second operand 6 states. [2019-12-18 14:50:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:10,669 INFO L93 Difference]: Finished difference Result 11743 states and 37119 transitions. [2019-12-18 14:50:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:50:10,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 14:50:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:10,696 INFO L225 Difference]: With dead ends: 11743 [2019-12-18 14:50:10,696 INFO L226 Difference]: Without dead ends: 11662 [2019-12-18 14:50:10,697 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 14:50:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11662 states. [2019-12-18 14:50:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11662 to 11662. [2019-12-18 14:50:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11662 states. [2019-12-18 14:50:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11662 states to 11662 states and 36940 transitions. [2019-12-18 14:50:11,341 INFO L78 Accepts]: Start accepts. Automaton has 11662 states and 36940 transitions. Word has length 57 [2019-12-18 14:50:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:11,341 INFO L462 AbstractCegarLoop]: Abstraction has 11662 states and 36940 transitions. [2019-12-18 14:50:11,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:50:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11662 states and 36940 transitions. [2019-12-18 14:50:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 14:50:11,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:11,356 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, 1, 1, 1, 1] [2019-12-18 14:50:11,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash -673847467, now seen corresponding path program 1 times [2019-12-18 14:50:11,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:11,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477298873] [2019-12-18 14:50:11,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:11,461 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 14:50:11,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477298873] [2019-12-18 14:50:11,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:11,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:50:11,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22715907] [2019-12-18 14:50:11,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:50:11,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:11,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:50:11,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:50:11,463 INFO L87 Difference]: Start difference. First operand 11662 states and 36940 transitions. Second operand 3 states. [2019-12-18 14:50:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:11,512 INFO L93 Difference]: Finished difference Result 10202 states and 31480 transitions. [2019-12-18 14:50:11,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:50:11,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-18 14:50:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:11,531 INFO L225 Difference]: With dead ends: 10202 [2019-12-18 14:50:11,531 INFO L226 Difference]: Without dead ends: 10202 [2019-12-18 14:50:11,532 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 14:50:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2019-12-18 14:50:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10100. [2019-12-18 14:50:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10100 states. [2019-12-18 14:50:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10100 states to 10100 states and 31217 transitions. [2019-12-18 14:50:11,703 INFO L78 Accepts]: Start accepts. Automaton has 10100 states and 31217 transitions. Word has length 71 [2019-12-18 14:50:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:11,703 INFO L462 AbstractCegarLoop]: Abstraction has 10100 states and 31217 transitions. [2019-12-18 14:50:11,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:50:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10100 states and 31217 transitions. [2019-12-18 14:50:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:11,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:11,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:50:11,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1035786393, now seen corresponding path program 1 times [2019-12-18 14:50:11,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:11,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213330525] [2019-12-18 14:50:11,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:12,621 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 14:50:12,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213330525] [2019-12-18 14:50:12,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:12,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 14:50:12,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071254150] [2019-12-18 14:50:12,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 14:50:12,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 14:50:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:50:12,624 INFO L87 Difference]: Start difference. First operand 10100 states and 31217 transitions. Second operand 24 states. [2019-12-18 14:50:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:17,884 INFO L93 Difference]: Finished difference Result 29258 states and 90386 transitions. [2019-12-18 14:50:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:50:17,884 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 14:50:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:17,933 INFO L225 Difference]: With dead ends: 29258 [2019-12-18 14:50:17,933 INFO L226 Difference]: Without dead ends: 24188 [2019-12-18 14:50:17,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=380, Invalid=3160, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 14:50:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24188 states. [2019-12-18 14:50:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24188 to 14316. [2019-12-18 14:50:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14316 states. [2019-12-18 14:50:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14316 states to 14316 states and 43836 transitions. [2019-12-18 14:50:18,268 INFO L78 Accepts]: Start accepts. Automaton has 14316 states and 43836 transitions. Word has length 72 [2019-12-18 14:50:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:18,268 INFO L462 AbstractCegarLoop]: Abstraction has 14316 states and 43836 transitions. [2019-12-18 14:50:18,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 14:50:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14316 states and 43836 transitions. [2019-12-18 14:50:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:18,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:18,285 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:18,286 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1973960785, now seen corresponding path program 2 times [2019-12-18 14:50:18,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:18,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398603718] [2019-12-18 14:50:18,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:18,727 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 14:50:18,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398603718] [2019-12-18 14:50:18,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:18,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:50:18,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036723617] [2019-12-18 14:50:18,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:50:18,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:50:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:50:18,729 INFO L87 Difference]: Start difference. First operand 14316 states and 43836 transitions. Second operand 18 states. [2019-12-18 14:50:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:21,921 INFO L93 Difference]: Finished difference Result 35465 states and 109263 transitions. [2019-12-18 14:50:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:50:21,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-18 14:50:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:21,970 INFO L225 Difference]: With dead ends: 35465 [2019-12-18 14:50:21,970 INFO L226 Difference]: Without dead ends: 31395 [2019-12-18 14:50:21,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:50:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31395 states. [2019-12-18 14:50:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31395 to 16073. [2019-12-18 14:50:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 14:50:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 49303 transitions. [2019-12-18 14:50:22,310 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 49303 transitions. Word has length 72 [2019-12-18 14:50:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:22,310 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 49303 transitions. [2019-12-18 14:50:22,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:50:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 49303 transitions. [2019-12-18 14:50:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:22,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:22,330 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:22,330 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1299803507, now seen corresponding path program 3 times [2019-12-18 14:50:22,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:22,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799694615] [2019-12-18 14:50:22,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:23,051 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 14:50:23,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799694615] [2019-12-18 14:50:23,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:23,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:50:23,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737705277] [2019-12-18 14:50:23,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:50:23,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:50:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:50:23,054 INFO L87 Difference]: Start difference. First operand 16073 states and 49303 transitions. Second operand 21 states. [2019-12-18 14:50:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:26,529 INFO L93 Difference]: Finished difference Result 28241 states and 86403 transitions. [2019-12-18 14:50:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 14:50:26,529 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-18 14:50:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:26,570 INFO L225 Difference]: With dead ends: 28241 [2019-12-18 14:50:26,570 INFO L226 Difference]: Without dead ends: 27395 [2019-12-18 14:50:26,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:50:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27395 states. [2019-12-18 14:50:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27395 to 15779. [2019-12-18 14:50:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15779 states. [2019-12-18 14:50:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15779 states to 15779 states and 48454 transitions. [2019-12-18 14:50:26,889 INFO L78 Accepts]: Start accepts. Automaton has 15779 states and 48454 transitions. Word has length 72 [2019-12-18 14:50:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:26,890 INFO L462 AbstractCegarLoop]: Abstraction has 15779 states and 48454 transitions. [2019-12-18 14:50:26,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:50:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15779 states and 48454 transitions. [2019-12-18 14:50:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:26,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:26,908 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:26,909 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 420334509, now seen corresponding path program 4 times [2019-12-18 14:50:26,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:26,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250586506] [2019-12-18 14:50:26,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:27,420 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 14:50:27,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250586506] [2019-12-18 14:50:27,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:27,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:50:27,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43917774] [2019-12-18 14:50:27,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:50:27,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:50:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:50:27,422 INFO L87 Difference]: Start difference. First operand 15779 states and 48454 transitions. Second operand 17 states. [2019-12-18 14:50:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:31,255 INFO L93 Difference]: Finished difference Result 36181 states and 110673 transitions. [2019-12-18 14:50:31,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:50:31,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-18 14:50:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:31,300 INFO L225 Difference]: With dead ends: 36181 [2019-12-18 14:50:31,301 INFO L226 Difference]: Without dead ends: 30861 [2019-12-18 14:50:31,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:50:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30861 states. [2019-12-18 14:50:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30861 to 21145. [2019-12-18 14:50:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21145 states. [2019-12-18 14:50:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21145 states to 21145 states and 63832 transitions. [2019-12-18 14:50:31,681 INFO L78 Accepts]: Start accepts. Automaton has 21145 states and 63832 transitions. Word has length 72 [2019-12-18 14:50:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:31,682 INFO L462 AbstractCegarLoop]: Abstraction has 21145 states and 63832 transitions. [2019-12-18 14:50:31,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:50:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21145 states and 63832 transitions. [2019-12-18 14:50:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:31,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:31,708 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:31,708 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1667111627, now seen corresponding path program 5 times [2019-12-18 14:50:31,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:31,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524187531] [2019-12-18 14:50:31,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:50:32,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524187531] [2019-12-18 14:50:32,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:32,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 14:50:32,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172708637] [2019-12-18 14:50:32,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 14:50:32,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 14:50:32,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:50:32,802 INFO L87 Difference]: Start difference. First operand 21145 states and 63832 transitions. Second operand 22 states. [2019-12-18 14:50:34,859 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-18 14:50:37,480 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-18 14:50:38,814 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-18 14:50:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:40,616 INFO L93 Difference]: Finished difference Result 64466 states and 196914 transitions. [2019-12-18 14:50:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-18 14:50:40,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2019-12-18 14:50:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:40,696 INFO L225 Difference]: With dead ends: 64466 [2019-12-18 14:50:40,696 INFO L226 Difference]: Without dead ends: 56291 [2019-12-18 14:50:40,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=786, Invalid=5376, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 14:50:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56291 states. [2019-12-18 14:50:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56291 to 27408. [2019-12-18 14:50:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27408 states. [2019-12-18 14:50:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27408 states to 27408 states and 82007 transitions. [2019-12-18 14:50:41,295 INFO L78 Accepts]: Start accepts. Automaton has 27408 states and 82007 transitions. Word has length 72 [2019-12-18 14:50:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:41,295 INFO L462 AbstractCegarLoop]: Abstraction has 27408 states and 82007 transitions. [2019-12-18 14:50:41,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 14:50:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27408 states and 82007 transitions. [2019-12-18 14:50:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:41,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:41,331 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:41,331 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:41,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1133325723, now seen corresponding path program 6 times [2019-12-18 14:50:41,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:41,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856554514] [2019-12-18 14:50:41,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:42,184 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 14:50:42,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856554514] [2019-12-18 14:50:42,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:42,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:50:42,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743861996] [2019-12-18 14:50:42,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:50:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:50:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:50:42,188 INFO L87 Difference]: Start difference. First operand 27408 states and 82007 transitions. Second operand 20 states. [2019-12-18 14:50:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:44,446 INFO L93 Difference]: Finished difference Result 55184 states and 166196 transitions. [2019-12-18 14:50:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:50:44,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-18 14:50:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:44,528 INFO L225 Difference]: With dead ends: 55184 [2019-12-18 14:50:44,528 INFO L226 Difference]: Without dead ends: 51076 [2019-12-18 14:50:44,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:50:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51076 states. [2019-12-18 14:50:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51076 to 28274. [2019-12-18 14:50:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28274 states. [2019-12-18 14:50:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28274 states to 28274 states and 84122 transitions. [2019-12-18 14:50:45,479 INFO L78 Accepts]: Start accepts. Automaton has 28274 states and 84122 transitions. Word has length 72 [2019-12-18 14:50:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:45,479 INFO L462 AbstractCegarLoop]: Abstraction has 28274 states and 84122 transitions. [2019-12-18 14:50:45,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:50:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 28274 states and 84122 transitions. [2019-12-18 14:50:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:45,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:45,511 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:45,511 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash -149520923, now seen corresponding path program 7 times [2019-12-18 14:50:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:45,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061174397] [2019-12-18 14:50:45,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:45,919 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 14:50:45,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061174397] [2019-12-18 14:50:45,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:45,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:50:45,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456420190] [2019-12-18 14:50:45,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:50:45,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:50:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:50:45,921 INFO L87 Difference]: Start difference. First operand 28274 states and 84122 transitions. Second operand 15 states. [2019-12-18 14:50:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:48,441 INFO L93 Difference]: Finished difference Result 60780 states and 183109 transitions. [2019-12-18 14:50:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:50:48,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-18 14:50:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:48,512 INFO L225 Difference]: With dead ends: 60780 [2019-12-18 14:50:48,512 INFO L226 Difference]: Without dead ends: 46878 [2019-12-18 14:50:48,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:50:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46878 states. [2019-12-18 14:50:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46878 to 33154. [2019-12-18 14:50:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33154 states. [2019-12-18 14:50:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33154 states to 33154 states and 96917 transitions. [2019-12-18 14:50:49,081 INFO L78 Accepts]: Start accepts. Automaton has 33154 states and 96917 transitions. Word has length 72 [2019-12-18 14:50:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:49,081 INFO L462 AbstractCegarLoop]: Abstraction has 33154 states and 96917 transitions. [2019-12-18 14:50:49,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:50:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 33154 states and 96917 transitions. [2019-12-18 14:50:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:49,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:49,118 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:49,118 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:49,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:49,119 INFO L82 PathProgramCache]: Analyzing trace with hash 255807511, now seen corresponding path program 8 times [2019-12-18 14:50:49,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284678511] [2019-12-18 14:50:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:49,913 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 14:50:49,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284678511] [2019-12-18 14:50:49,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:49,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 14:50:49,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585256346] [2019-12-18 14:50:49,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 14:50:49,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 14:50:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:50:49,915 INFO L87 Difference]: Start difference. First operand 33154 states and 96917 transitions. Second operand 25 states. [2019-12-18 14:50:52,856 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-18 14:50:54,171 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-18 14:50:55,620 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-18 14:50:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:50:58,669 INFO L93 Difference]: Finished difference Result 49538 states and 145241 transitions. [2019-12-18 14:50:58,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 14:50:58,670 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-12-18 14:50:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:50:58,744 INFO L225 Difference]: With dead ends: 49538 [2019-12-18 14:50:58,744 INFO L226 Difference]: Without dead ends: 48067 [2019-12-18 14:50:58,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=389, Invalid=3517, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 14:50:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2019-12-18 14:50:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 35256. [2019-12-18 14:50:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35256 states. [2019-12-18 14:50:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35256 states to 35256 states and 102809 transitions. [2019-12-18 14:50:59,348 INFO L78 Accepts]: Start accepts. Automaton has 35256 states and 102809 transitions. Word has length 72 [2019-12-18 14:50:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:50:59,348 INFO L462 AbstractCegarLoop]: Abstraction has 35256 states and 102809 transitions. [2019-12-18 14:50:59,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 14:50:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35256 states and 102809 transitions. [2019-12-18 14:50:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:50:59,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:50:59,388 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, 1, 1, 1, 1, 1] [2019-12-18 14:50:59,389 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:50:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:50:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2026357905, now seen corresponding path program 9 times [2019-12-18 14:50:59,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:50:59,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524682656] [2019-12-18 14:50:59,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:50:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:50:59,725 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 14:50:59,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524682656] [2019-12-18 14:50:59,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:50:59,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:50:59,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853519814] [2019-12-18 14:50:59,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:50:59,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:50:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:50:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:50:59,728 INFO L87 Difference]: Start difference. First operand 35256 states and 102809 transitions. Second operand 15 states. [2019-12-18 14:51:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:01,360 INFO L93 Difference]: Finished difference Result 57697 states and 170787 transitions. [2019-12-18 14:51:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:51:01,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-18 14:51:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:01,437 INFO L225 Difference]: With dead ends: 57697 [2019-12-18 14:51:01,438 INFO L226 Difference]: Without dead ends: 50530 [2019-12-18 14:51:01,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:51:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50530 states. [2019-12-18 14:51:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50530 to 31714. [2019-12-18 14:51:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31714 states. [2019-12-18 14:51:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31714 states to 31714 states and 92639 transitions. [2019-12-18 14:51:02,274 INFO L78 Accepts]: Start accepts. Automaton has 31714 states and 92639 transitions. Word has length 72 [2019-12-18 14:51:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:02,275 INFO L462 AbstractCegarLoop]: Abstraction has 31714 states and 92639 transitions. [2019-12-18 14:51:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:51:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31714 states and 92639 transitions. [2019-12-18 14:51:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:02,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:02,313 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:02,313 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash 367714337, now seen corresponding path program 10 times [2019-12-18 14:51:02,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:02,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202096461] [2019-12-18 14:51:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:03,026 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 14:51:03,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202096461] [2019-12-18 14:51:03,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:03,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:51:03,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015928780] [2019-12-18 14:51:03,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:51:03,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:03,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:51:03,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:51:03,028 INFO L87 Difference]: Start difference. First operand 31714 states and 92639 transitions. Second operand 19 states. [2019-12-18 14:51:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:07,919 INFO L93 Difference]: Finished difference Result 43483 states and 127398 transitions. [2019-12-18 14:51:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:51:07,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-18 14:51:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:07,982 INFO L225 Difference]: With dead ends: 43483 [2019-12-18 14:51:07,982 INFO L226 Difference]: Without dead ends: 42931 [2019-12-18 14:51:07,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=404, Invalid=2146, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 14:51:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42931 states. [2019-12-18 14:51:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42931 to 34310. [2019-12-18 14:51:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34310 states. [2019-12-18 14:51:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34310 states to 34310 states and 100759 transitions. [2019-12-18 14:51:08,528 INFO L78 Accepts]: Start accepts. Automaton has 34310 states and 100759 transitions. Word has length 72 [2019-12-18 14:51:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:08,528 INFO L462 AbstractCegarLoop]: Abstraction has 34310 states and 100759 transitions. [2019-12-18 14:51:08,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:51:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34310 states and 100759 transitions. [2019-12-18 14:51:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:08,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:08,569 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:08,569 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -311623533, now seen corresponding path program 11 times [2019-12-18 14:51:08,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:08,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020317061] [2019-12-18 14:51:08,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:09,248 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 14:51:09,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020317061] [2019-12-18 14:51:09,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:09,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:51:09,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874573670] [2019-12-18 14:51:09,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:51:09,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:51:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:51:09,251 INFO L87 Difference]: Start difference. First operand 34310 states and 100759 transitions. Second operand 18 states. [2019-12-18 14:51:10,777 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-18 14:51:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:13,713 INFO L93 Difference]: Finished difference Result 45389 states and 131701 transitions. [2019-12-18 14:51:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:51:13,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-18 14:51:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:13,772 INFO L225 Difference]: With dead ends: 45389 [2019-12-18 14:51:13,772 INFO L226 Difference]: Without dead ends: 41741 [2019-12-18 14:51:13,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=408, Invalid=2142, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 14:51:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41741 states. [2019-12-18 14:51:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41741 to 31214. [2019-12-18 14:51:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31214 states. [2019-12-18 14:51:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31214 states to 31214 states and 91112 transitions. [2019-12-18 14:51:14,287 INFO L78 Accepts]: Start accepts. Automaton has 31214 states and 91112 transitions. Word has length 72 [2019-12-18 14:51:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:14,287 INFO L462 AbstractCegarLoop]: Abstraction has 31214 states and 91112 transitions. [2019-12-18 14:51:14,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:51:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31214 states and 91112 transitions. [2019-12-18 14:51:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:14,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:14,323 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:14,323 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash -337976063, now seen corresponding path program 12 times [2019-12-18 14:51:14,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:14,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791756939] [2019-12-18 14:51:14,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:14,881 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 14:51:14,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791756939] [2019-12-18 14:51:14,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:14,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:51:14,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423970897] [2019-12-18 14:51:14,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:51:14,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:51:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:51:14,883 INFO L87 Difference]: Start difference. First operand 31214 states and 91112 transitions. Second operand 20 states. [2019-12-18 14:51:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:18,837 INFO L93 Difference]: Finished difference Result 55924 states and 166588 transitions. [2019-12-18 14:51:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:51:18,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-18 14:51:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:18,912 INFO L225 Difference]: With dead ends: 55924 [2019-12-18 14:51:18,912 INFO L226 Difference]: Without dead ends: 48585 [2019-12-18 14:51:18,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=448, Invalid=2414, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 14:51:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48585 states. [2019-12-18 14:51:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48585 to 31657. [2019-12-18 14:51:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31657 states. [2019-12-18 14:51:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31657 states to 31657 states and 92212 transitions. [2019-12-18 14:51:19,744 INFO L78 Accepts]: Start accepts. Automaton has 31657 states and 92212 transitions. Word has length 72 [2019-12-18 14:51:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:19,744 INFO L462 AbstractCegarLoop]: Abstraction has 31657 states and 92212 transitions. [2019-12-18 14:51:19,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:51:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31657 states and 92212 transitions. [2019-12-18 14:51:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:19,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:19,781 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:19,781 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 214574861, now seen corresponding path program 13 times [2019-12-18 14:51:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961859636] [2019-12-18 14:51:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:20,441 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 14:51:20,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961859636] [2019-12-18 14:51:20,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:20,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 14:51:20,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271470486] [2019-12-18 14:51:20,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 14:51:20,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 14:51:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:51:20,443 INFO L87 Difference]: Start difference. First operand 31657 states and 92212 transitions. Second operand 24 states. [2019-12-18 14:51:23,083 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-18 14:51:24,362 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-18 14:51:26,160 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-18 14:51:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:26,936 INFO L93 Difference]: Finished difference Result 44861 states and 129459 transitions. [2019-12-18 14:51:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:51:26,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 14:51:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:26,997 INFO L225 Difference]: With dead ends: 44861 [2019-12-18 14:51:26,997 INFO L226 Difference]: Without dead ends: 43761 [2019-12-18 14:51:26,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=390, Invalid=3270, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 14:51:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43761 states. [2019-12-18 14:51:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43761 to 33849. [2019-12-18 14:51:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33849 states. [2019-12-18 14:51:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33849 states to 33849 states and 98207 transitions. [2019-12-18 14:51:27,526 INFO L78 Accepts]: Start accepts. Automaton has 33849 states and 98207 transitions. Word has length 72 [2019-12-18 14:51:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:27,526 INFO L462 AbstractCegarLoop]: Abstraction has 33849 states and 98207 transitions. [2019-12-18 14:51:27,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 14:51:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33849 states and 98207 transitions. [2019-12-18 14:51:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:27,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:27,565 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:27,565 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1285488697, now seen corresponding path program 14 times [2019-12-18 14:51:27,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:27,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748742399] [2019-12-18 14:51:27,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:28,776 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 14:51:28,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748742399] [2019-12-18 14:51:28,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:28,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:51:28,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950935059] [2019-12-18 14:51:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 14:51:28,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 14:51:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:51:28,778 INFO L87 Difference]: Start difference. First operand 33849 states and 98207 transitions. Second operand 23 states. [2019-12-18 14:51:31,048 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-12-18 14:51:32,972 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-18 14:51:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:35,396 INFO L93 Difference]: Finished difference Result 51331 states and 147785 transitions. [2019-12-18 14:51:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:51:35,397 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 14:51:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:35,471 INFO L225 Difference]: With dead ends: 51331 [2019-12-18 14:51:35,471 INFO L226 Difference]: Without dead ends: 46927 [2019-12-18 14:51:35,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=399, Invalid=3141, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 14:51:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46927 states. [2019-12-18 14:51:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46927 to 32690. [2019-12-18 14:51:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-12-18 14:51:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 94776 transitions. [2019-12-18 14:51:36,068 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 94776 transitions. Word has length 72 [2019-12-18 14:51:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:36,068 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 94776 transitions. [2019-12-18 14:51:36,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 14:51:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 94776 transitions. [2019-12-18 14:51:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:36,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:36,107 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:36,108 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash 351364879, now seen corresponding path program 15 times [2019-12-18 14:51:36,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:36,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493767393] [2019-12-18 14:51:36,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:36,465 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 14:51:36,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493767393] [2019-12-18 14:51:36,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:36,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:51:36,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165780841] [2019-12-18 14:51:36,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:51:36,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:51:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:51:36,467 INFO L87 Difference]: Start difference. First operand 32690 states and 94776 transitions. Second operand 17 states. [2019-12-18 14:51:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:40,236 INFO L93 Difference]: Finished difference Result 41402 states and 118453 transitions. [2019-12-18 14:51:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:51:40,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-18 14:51:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:40,291 INFO L225 Difference]: With dead ends: 41402 [2019-12-18 14:51:40,291 INFO L226 Difference]: Without dead ends: 39703 [2019-12-18 14:51:40,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 14:51:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39703 states. [2019-12-18 14:51:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39703 to 31775. [2019-12-18 14:51:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31775 states. [2019-12-18 14:51:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 92279 transitions. [2019-12-18 14:51:40,792 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 92279 transitions. Word has length 72 [2019-12-18 14:51:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:40,792 INFO L462 AbstractCegarLoop]: Abstraction has 31775 states and 92279 transitions. [2019-12-18 14:51:40,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:51:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 92279 transitions. [2019-12-18 14:51:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:40,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:40,828 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:40,828 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash -811401559, now seen corresponding path program 16 times [2019-12-18 14:51:40,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:40,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028561791] [2019-12-18 14:51:40,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:51:42,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028561791] [2019-12-18 14:51:42,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:42,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 14:51:42,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629346769] [2019-12-18 14:51:42,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 14:51:42,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 14:51:42,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:51:42,059 INFO L87 Difference]: Start difference. First operand 31775 states and 92279 transitions. Second operand 24 states. [2019-12-18 14:51:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:51:47,075 INFO L93 Difference]: Finished difference Result 40163 states and 116058 transitions. [2019-12-18 14:51:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:51:47,076 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 14:51:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:51:47,130 INFO L225 Difference]: With dead ends: 40163 [2019-12-18 14:51:47,130 INFO L226 Difference]: Without dead ends: 39581 [2019-12-18 14:51:47,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=317, Invalid=2875, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 14:51:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39581 states. [2019-12-18 14:51:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39581 to 32418. [2019-12-18 14:51:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32418 states. [2019-12-18 14:51:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32418 states to 32418 states and 93776 transitions. [2019-12-18 14:51:47,635 INFO L78 Accepts]: Start accepts. Automaton has 32418 states and 93776 transitions. Word has length 72 [2019-12-18 14:51:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:51:47,635 INFO L462 AbstractCegarLoop]: Abstraction has 32418 states and 93776 transitions. [2019-12-18 14:51:47,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 14:51:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 32418 states and 93776 transitions. [2019-12-18 14:51:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 14:51:47,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:51:47,966 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, 1, 1, 1, 1, 1] [2019-12-18 14:51:47,966 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:51:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:51:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash -98168209, now seen corresponding path program 17 times [2019-12-18 14:51:47,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:51:47,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129582352] [2019-12-18 14:51:47,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:51:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:51:48,819 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 14:51:48,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129582352] [2019-12-18 14:51:48,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:51:48,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 14:51:48,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672232452] [2019-12-18 14:51:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 14:51:48,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:51:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 14:51:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:51:48,821 INFO L87 Difference]: Start difference. First operand 32418 states and 93776 transitions. Second operand 24 states. Received shutdown request... [2019-12-18 14:51:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:51:49,884 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 14:51:49,888 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 14:51:49,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:51:49 BasicIcfg [2019-12-18 14:51:49,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:51:49,890 INFO L168 Benchmark]: Toolchain (without parser) took 234175.49 ms. Allocated memory was 140.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,890 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 140.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:51:49,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.08 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.0 MB in the beginning and 155.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.47 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,892 INFO L168 Benchmark]: Boogie Preprocessor took 62.77 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,892 INFO L168 Benchmark]: RCFGBuilder took 1058.64 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 150.7 MB in the beginning and 195.6 MB in the end (delta: -44.9 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,893 INFO L168 Benchmark]: TraceAbstraction took 232227.60 ms. Allocated memory was 233.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 195.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 14:51:49,896 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.46 ms. Allocated memory is still 140.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.08 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.0 MB in the beginning and 155.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.47 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.77 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1058.64 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 150.7 MB in the beginning and 195.6 MB in the end (delta: -44.9 MB). Peak memory consumption was 63.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232227.60 ms. Allocated memory was 233.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 195.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 223 ProgramPointsBefore, 117 ProgramPointsAfterwards, 276 TransitionsBefore, 140 TransitionsAfterwards, 32976 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 59 ConcurrentYvCompositions, 34 ChoiceCompositions, 12533 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 347 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 189775 CheckedPairsTotal, 150 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (32418states) and FLOYD_HOARE automaton (currently 12 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (622 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 214 locations, 1 error locations. Result: TIMEOUT, OverallTime: 232.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 86.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8459 SDtfs, 17016 SDslu, 74956 SDs, 0 SdLazy, 49144 SolverSat, 1362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 65 SyntacticMatches, 30 SemanticMatches, 859 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9907 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300418occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 231411 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1853 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1822 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown