/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:51:31,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:51:31,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:51:31,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:51:31,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:51:31,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:51:31,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:51:31,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:51:31,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:51:31,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:51:31,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:51:31,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:51:31,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:51:31,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:51:31,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:51:31,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:51:31,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:51:31,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:51:31,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:51:31,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:51:31,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:51:31,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:51:31,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:51:31,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:51:31,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:51:31,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:51:31,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:51:31,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:51:31,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:51:31,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:51:31,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:51:31,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:51:31,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:51:31,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:51:31,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:51:31,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:51:31,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:51:31,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:51:31,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:51:31,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:51:31,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:51:31,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:51:31,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:51:31,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:51:31,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:51:31,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:51:31,158 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:51:31,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:51:31,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:51:31,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:51:31,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:51:31,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:51:31,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:51:31,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:51:31,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:51:31,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:51:31,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:51:31,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:51:31,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:51:31,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:51:31,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:51:31,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:51:31,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:51:31,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:51:31,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:51:31,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:51:31,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:51:31,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:51:31,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:51:31,167 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:51:31,167 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:51:31,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:51:31,167 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:51:31,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:51:31,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:51:31,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:51:31,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:51:31,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:51:31,482 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:51:31,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-27 21:51:31,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b488d18bd/30b07218ab5a4248995d5af3b4162a99/FLAG98b1451fe [2019-12-27 21:51:32,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:51:32,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-27 21:51:32,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b488d18bd/30b07218ab5a4248995d5af3b4162a99/FLAG98b1451fe [2019-12-27 21:51:32,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b488d18bd/30b07218ab5a4248995d5af3b4162a99 [2019-12-27 21:51:32,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:51:32,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:51:32,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:51:32,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:51:32,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:51:32,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:51:32" (1/1) ... [2019-12-27 21:51:32,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:32, skipping insertion in model container [2019-12-27 21:51:32,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:51:32" (1/1) ... [2019-12-27 21:51:32,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:51:32,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:51:32,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:51:33,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:51:33,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:51:33,172 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:51:33,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33 WrapperNode [2019-12-27 21:51:33,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:51:33,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:51:33,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:51:33,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:51:33,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:51:33,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:51:33,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:51:33,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:51:33,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... [2019-12-27 21:51:33,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:51:33,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:51:33,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:51:33,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:51:33,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:51:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:51:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:51:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:51:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:51:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:51:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:51:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:51:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:51:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:51:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:51:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:51:33,381 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:51:34,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:51:34,542 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:51:34,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:51:34 BoogieIcfgContainer [2019-12-27 21:51:34,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:51:34,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:51:34,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:51:34,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:51:34,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:51:32" (1/3) ... [2019-12-27 21:51:34,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af98a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:51:34, skipping insertion in model container [2019-12-27 21:51:34,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:51:33" (2/3) ... [2019-12-27 21:51:34,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af98a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:51:34, skipping insertion in model container [2019-12-27 21:51:34,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:51:34" (3/3) ... [2019-12-27 21:51:34,552 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.opt.i [2019-12-27 21:51:34,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:51:34,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:51:34,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:51:34,572 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:51:34,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:51:34,703 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:51:34,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:51:34,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:51:34,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:51:34,723 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:51:34,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:51:34,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:51:34,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:51:34,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:51:34,742 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 21:51:34,744 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:51:34,941 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:51:34,942 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:51:35,005 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:51:35,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:51:35,258 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:51:35,258 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:51:35,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:51:35,332 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 21:51:35,333 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:51:39,497 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:51:39,607 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:51:39,731 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-27 21:51:39,732 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 21:51:39,736 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-27 21:51:55,610 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-27 21:51:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-27 21:51:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:51:55,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:55,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:51:55,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-27 21:51:55,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:55,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729220336] [2019-12-27 21:51:55,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:51:55,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729220336] [2019-12-27 21:51:55,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:55,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:51:55,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373640228] [2019-12-27 21:51:55,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:55,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:55,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:51:55,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:55,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:55,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:51:55,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:55,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:51:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:51:55,869 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-27 21:51:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:59,363 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-27 21:51:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:51:59,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:51:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:00,020 INFO L225 Difference]: With dead ends: 120599 [2019-12-27 21:52:00,021 INFO L226 Difference]: Without dead ends: 118034 [2019-12-27 21:52:00,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:52:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-27 21:52:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-27 21:52:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-27 21:52:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-27 21:52:11,708 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-27 21:52:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:11,709 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-27 21:52:11,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:52:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-27 21:52:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:52:11,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:11,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:11,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-27 21:52:11,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:11,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133495628] [2019-12-27 21:52:11,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:11,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133495628] [2019-12-27 21:52:11,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:11,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:52:11,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1371102608] [2019-12-27 21:52:11,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:11,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:11,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:52:11,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:11,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:52:11,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:52:11,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:11,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:52:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:52:11,898 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 5 states. [2019-12-27 21:52:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:13,030 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-27 21:52:13,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:52:13,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:52:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:18,335 INFO L225 Difference]: With dead ends: 156706 [2019-12-27 21:52:18,336 INFO L226 Difference]: Without dead ends: 156706 [2019-12-27 21:52:18,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:52:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-27 21:52:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-27 21:52:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-27 21:52:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-27 21:52:28,287 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-27 21:52:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:28,289 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-27 21:52:28,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:52:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-27 21:52:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:52:28,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:28,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:28,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-27 21:52:28,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:28,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369990610] [2019-12-27 21:52:28,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:28,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369990610] [2019-12-27 21:52:28,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:28,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:52:28,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906166359] [2019-12-27 21:52:28,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:28,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:28,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:52:28,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:28,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:28,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:52:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:52:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:52:28,393 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-27 21:52:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:29,641 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-27 21:52:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:52:29,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:52:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:35,770 INFO L225 Difference]: With dead ends: 203727 [2019-12-27 21:52:35,770 INFO L226 Difference]: Without dead ends: 203727 [2019-12-27 21:52:35,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:52:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-27 21:52:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-27 21:52:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-27 21:52:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-27 21:52:46,551 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-27 21:52:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:46,551 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-27 21:52:46,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:52:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-27 21:52:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:52:46,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:46,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:46,560 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-27 21:52:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591189954] [2019-12-27 21:52:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:46,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591189954] [2019-12-27 21:52:46,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:46,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:52:46,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008761091] [2019-12-27 21:52:46,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:46,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:46,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 21:52:46,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:46,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:52:46,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:52:46,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:52:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:52:46,755 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 8 states. [2019-12-27 21:52:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:56,634 INFO L93 Difference]: Finished difference Result 259282 states and 919907 transitions. [2019-12-27 21:52:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:52:56,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 21:52:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:57,248 INFO L225 Difference]: With dead ends: 259282 [2019-12-27 21:52:57,249 INFO L226 Difference]: Without dead ends: 259282 [2019-12-27 21:52:57,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:53:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259282 states. [2019-12-27 21:53:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259282 to 188159. [2019-12-27 21:53:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-27 21:53:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679985 transitions. [2019-12-27 21:53:09,467 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679985 transitions. Word has length 17 [2019-12-27 21:53:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:09,468 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679985 transitions. [2019-12-27 21:53:09,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:53:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679985 transitions. [2019-12-27 21:53:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:53:09,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:09,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:09,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-27 21:53:09,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:09,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819073227] [2019-12-27 21:53:09,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:09,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819073227] [2019-12-27 21:53:09,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:09,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:53:09,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745950147] [2019-12-27 21:53:09,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:09,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:09,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 21:53:09,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:09,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:53:09,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:53:09,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:53:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:53:09,754 INFO L87 Difference]: Start difference. First operand 188159 states and 679985 transitions. Second operand 9 states. [2019-12-27 21:53:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:13,065 INFO L93 Difference]: Finished difference Result 258327 states and 918716 transitions. [2019-12-27 21:53:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:53:13,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 21:53:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:13,629 INFO L225 Difference]: With dead ends: 258327 [2019-12-27 21:53:13,629 INFO L226 Difference]: Without dead ends: 258327 [2019-12-27 21:53:13,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:53:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-27 21:53:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-27 21:53:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-27 21:53:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 868009 transitions. [2019-12-27 21:53:32,474 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 868009 transitions. Word has length 25 [2019-12-27 21:53:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:32,475 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 868009 transitions. [2019-12-27 21:53:32,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:53:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 868009 transitions. [2019-12-27 21:53:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:53:32,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:32,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:32,498 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-27 21:53:32,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:32,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291279832] [2019-12-27 21:53:32,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:32,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291279832] [2019-12-27 21:53:32,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:32,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:53:32,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1011875611] [2019-12-27 21:53:32,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:32,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:32,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:53:32,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:32,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:32,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:53:32,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:32,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:53:32,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:53:32,594 INFO L87 Difference]: Start difference. First operand 243454 states and 868009 transitions. Second operand 4 states. [2019-12-27 21:53:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:32,668 INFO L93 Difference]: Finished difference Result 14903 states and 40512 transitions. [2019-12-27 21:53:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:53:32,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:53:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:32,681 INFO L225 Difference]: With dead ends: 14903 [2019-12-27 21:53:32,681 INFO L226 Difference]: Without dead ends: 10760 [2019-12-27 21:53:32,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:53:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-27 21:53:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-27 21:53:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-27 21:53:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26331 transitions. [2019-12-27 21:53:37,986 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26331 transitions. Word has length 25 [2019-12-27 21:53:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:37,986 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26331 transitions. [2019-12-27 21:53:37,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:53:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26331 transitions. [2019-12-27 21:53:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 21:53:37,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:37,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:37,993 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-27 21:53:37,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:37,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762413576] [2019-12-27 21:53:37,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:38,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762413576] [2019-12-27 21:53:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:38,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:53:38,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389875662] [2019-12-27 21:53:38,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:38,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:38,167 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 21:53:38,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:38,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:53:38,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:53:38,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:53:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:53:38,258 INFO L87 Difference]: Start difference. First operand 10720 states and 26331 transitions. Second operand 11 states. [2019-12-27 21:53:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:39,665 INFO L93 Difference]: Finished difference Result 12029 states and 29137 transitions. [2019-12-27 21:53:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:53:39,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-27 21:53:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:39,678 INFO L225 Difference]: With dead ends: 12029 [2019-12-27 21:53:39,679 INFO L226 Difference]: Without dead ends: 11981 [2019-12-27 21:53:39,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:53:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-27 21:53:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-27 21:53:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-27 21:53:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28281 transitions. [2019-12-27 21:53:39,818 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28281 transitions. Word has length 38 [2019-12-27 21:53:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:39,819 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28281 transitions. [2019-12-27 21:53:39,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:53:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28281 transitions. [2019-12-27 21:53:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 21:53:39,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:39,826 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] [2019-12-27 21:53:39,826 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-27 21:53:39,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:39,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624634965] [2019-12-27 21:53:39,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:39,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624634965] [2019-12-27 21:53:39,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:39,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:53:39,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255609756] [2019-12-27 21:53:39,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:39,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:40,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 21:53:40,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:40,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:53:40,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:53:40,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:53:40,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:53:40,076 INFO L87 Difference]: Start difference. First operand 11601 states and 28281 transitions. Second operand 10 states. [2019-12-27 21:53:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:41,473 INFO L93 Difference]: Finished difference Result 13284 states and 32064 transitions. [2019-12-27 21:53:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:53:41,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 21:53:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:41,490 INFO L225 Difference]: With dead ends: 13284 [2019-12-27 21:53:41,490 INFO L226 Difference]: Without dead ends: 13284 [2019-12-27 21:53:41,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:53:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-12-27 21:53:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 11783. [2019-12-27 21:53:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-27 21:53:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-27 21:53:41,629 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-27 21:53:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:41,630 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-27 21:53:41,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:53:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-27 21:53:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:53:41,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:41,638 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-27 21:53:41,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:41,639 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-27 21:53:41,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:41,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17072709] [2019-12-27 21:53:41,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17072709] [2019-12-27 21:53:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:53:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764392976] [2019-12-27 21:53:41,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:41,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:41,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 21:53:41,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:41,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:41,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:53:41,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:53:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:53:41,861 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-27 21:53:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:42,738 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-27 21:53:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:53:42,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 21:53:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:42,755 INFO L225 Difference]: With dead ends: 13164 [2019-12-27 21:53:42,755 INFO L226 Difference]: Without dead ends: 13164 [2019-12-27 21:53:42,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:53:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-27 21:53:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-27 21:53:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-27 21:53:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-27 21:53:42,901 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-27 21:53:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:42,901 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-27 21:53:42,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:53:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-27 21:53:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:53:42,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:42,911 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] [2019-12-27 21:53:42,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-27 21:53:42,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:42,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725367394] [2019-12-27 21:53:42,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:43,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725367394] [2019-12-27 21:53:43,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:43,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:53:43,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1854735517] [2019-12-27 21:53:43,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:43,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:43,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 21:53:43,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:43,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:53:43,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:53:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:53:43,075 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 5 states. [2019-12-27 21:53:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:43,130 INFO L93 Difference]: Finished difference Result 5514 states and 12816 transitions. [2019-12-27 21:53:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:53:43,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:53:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:43,137 INFO L225 Difference]: With dead ends: 5514 [2019-12-27 21:53:43,137 INFO L226 Difference]: Without dead ends: 5256 [2019-12-27 21:53:43,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:53:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2019-12-27 21:53:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5103. [2019-12-27 21:53:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 21:53:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11978 transitions. [2019-12-27 21:53:43,220 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11978 transitions. Word has length 58 [2019-12-27 21:53:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:43,220 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11978 transitions. [2019-12-27 21:53:43,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:53:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11978 transitions. [2019-12-27 21:53:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:53:43,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:43,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:43,231 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-27 21:53:43,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:43,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654463335] [2019-12-27 21:53:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:43,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654463335] [2019-12-27 21:53:43,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:43,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:53:43,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1864291322] [2019-12-27 21:53:43,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:43,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:43,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 21:53:43,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:43,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:43,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:53:43,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:53:43,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:53:43,602 INFO L87 Difference]: Start difference. First operand 5103 states and 11978 transitions. Second operand 6 states. [2019-12-27 21:53:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:44,379 INFO L93 Difference]: Finished difference Result 6763 states and 15734 transitions. [2019-12-27 21:53:44,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:53:44,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 21:53:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:44,389 INFO L225 Difference]: With dead ends: 6763 [2019-12-27 21:53:44,390 INFO L226 Difference]: Without dead ends: 6763 [2019-12-27 21:53:44,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:53:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2019-12-27 21:53:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6314. [2019-12-27 21:53:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6314 states. [2019-12-27 21:53:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 14784 transitions. [2019-12-27 21:53:44,616 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 14784 transitions. Word has length 94 [2019-12-27 21:53:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:44,616 INFO L462 AbstractCegarLoop]: Abstraction has 6314 states and 14784 transitions. [2019-12-27 21:53:44,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:53:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 14784 transitions. [2019-12-27 21:53:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:53:44,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:44,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:44,626 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:44,627 INFO L82 PathProgramCache]: Analyzing trace with hash 275007721, now seen corresponding path program 2 times [2019-12-27 21:53:44,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:44,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495005135] [2019-12-27 21:53:44,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:44,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495005135] [2019-12-27 21:53:44,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:44,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:53:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53290586] [2019-12-27 21:53:44,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:44,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:44,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 21:53:44,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:45,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:53:45,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:53:45,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:53:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:53:45,009 INFO L87 Difference]: Start difference. First operand 6314 states and 14784 transitions. Second operand 8 states. [2019-12-27 21:53:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:46,858 INFO L93 Difference]: Finished difference Result 13174 states and 28978 transitions. [2019-12-27 21:53:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:53:46,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 21:53:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:46,874 INFO L225 Difference]: With dead ends: 13174 [2019-12-27 21:53:46,874 INFO L226 Difference]: Without dead ends: 13174 [2019-12-27 21:53:46,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:53:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13174 states. [2019-12-27 21:53:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13174 to 10406. [2019-12-27 21:53:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10406 states. [2019-12-27 21:53:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 23380 transitions. [2019-12-27 21:53:47,004 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 23380 transitions. Word has length 94 [2019-12-27 21:53:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:47,004 INFO L462 AbstractCegarLoop]: Abstraction has 10406 states and 23380 transitions. [2019-12-27 21:53:47,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:53:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 23380 transitions. [2019-12-27 21:53:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:53:47,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:47,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:47,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -860704691, now seen corresponding path program 3 times [2019-12-27 21:53:47,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:47,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369448384] [2019-12-27 21:53:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:47,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369448384] [2019-12-27 21:53:47,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:47,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:53:47,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880457962] [2019-12-27 21:53:47,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:47,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:47,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 21:53:47,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:47,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:53:47,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:53:47,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:53:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:53:47,456 INFO L87 Difference]: Start difference. First operand 10406 states and 23380 transitions. Second operand 5 states. [2019-12-27 21:53:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:48,015 INFO L93 Difference]: Finished difference Result 11199 states and 24989 transitions. [2019-12-27 21:53:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:53:48,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 21:53:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:48,028 INFO L225 Difference]: With dead ends: 11199 [2019-12-27 21:53:48,029 INFO L226 Difference]: Without dead ends: 11199 [2019-12-27 21:53:48,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:53:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2019-12-27 21:53:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 10628. [2019-12-27 21:53:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-12-27 21:53:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 23878 transitions. [2019-12-27 21:53:48,142 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 23878 transitions. Word has length 94 [2019-12-27 21:53:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:48,142 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 23878 transitions. [2019-12-27 21:53:48,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:53:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 23878 transitions. [2019-12-27 21:53:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:53:48,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:48,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:48,153 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1714542913, now seen corresponding path program 4 times [2019-12-27 21:53:48,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:48,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809191233] [2019-12-27 21:53:48,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:48,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809191233] [2019-12-27 21:53:48,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:48,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:53:48,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1824203822] [2019-12-27 21:53:48,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:48,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:48,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 21:53:48,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:48,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:48,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:53:48,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:53:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:53:48,533 INFO L87 Difference]: Start difference. First operand 10628 states and 23878 transitions. Second operand 3 states. [2019-12-27 21:53:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:48,612 INFO L93 Difference]: Finished difference Result 10628 states and 23877 transitions. [2019-12-27 21:53:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:53:48,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 21:53:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:48,625 INFO L225 Difference]: With dead ends: 10628 [2019-12-27 21:53:48,626 INFO L226 Difference]: Without dead ends: 10628 [2019-12-27 21:53:48,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:53:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10628 states. [2019-12-27 21:53:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10628 to 10504. [2019-12-27 21:53:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10504 states. [2019-12-27 21:53:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10504 states to 10504 states and 23648 transitions. [2019-12-27 21:53:48,742 INFO L78 Accepts]: Start accepts. Automaton has 10504 states and 23648 transitions. Word has length 94 [2019-12-27 21:53:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:48,742 INFO L462 AbstractCegarLoop]: Abstraction has 10504 states and 23648 transitions. [2019-12-27 21:53:48,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:53:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10504 states and 23648 transitions. [2019-12-27 21:53:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:53:48,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:48,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:48,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 874014353, now seen corresponding path program 1 times [2019-12-27 21:53:48,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:48,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808183224] [2019-12-27 21:53:48,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:48,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808183224] [2019-12-27 21:53:48,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:48,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:53:48,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337265661] [2019-12-27 21:53:48,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:49,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:49,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 186 transitions. [2019-12-27 21:53:49,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:49,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:53:49,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:53:49,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:53:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:53:49,303 INFO L87 Difference]: Start difference. First operand 10504 states and 23648 transitions. Second operand 9 states. [2019-12-27 21:53:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:50,054 INFO L93 Difference]: Finished difference Result 16820 states and 37593 transitions. [2019-12-27 21:53:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:53:50,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 21:53:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:50,071 INFO L225 Difference]: With dead ends: 16820 [2019-12-27 21:53:50,071 INFO L226 Difference]: Without dead ends: 14175 [2019-12-27 21:53:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:53:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14175 states. [2019-12-27 21:53:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14175 to 12167. [2019-12-27 21:53:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12167 states. [2019-12-27 21:53:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12167 states to 12167 states and 27359 transitions. [2019-12-27 21:53:50,209 INFO L78 Accepts]: Start accepts. Automaton has 12167 states and 27359 transitions. Word has length 95 [2019-12-27 21:53:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:50,209 INFO L462 AbstractCegarLoop]: Abstraction has 12167 states and 27359 transitions. [2019-12-27 21:53:50,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:53:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12167 states and 27359 transitions. [2019-12-27 21:53:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:53:50,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:50,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:50,219 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -510698891, now seen corresponding path program 2 times [2019-12-27 21:53:50,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:50,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671719280] [2019-12-27 21:53:50,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:50,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671719280] [2019-12-27 21:53:50,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:50,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:53:50,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950111232] [2019-12-27 21:53:50,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:50,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:50,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 174 transitions. [2019-12-27 21:53:50,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:50,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:53:50,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:53:50,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:53:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:53:50,456 INFO L87 Difference]: Start difference. First operand 12167 states and 27359 transitions. Second operand 4 states. [2019-12-27 21:53:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:50,918 INFO L93 Difference]: Finished difference Result 16892 states and 38461 transitions. [2019-12-27 21:53:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:53:50,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 21:53:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:50,938 INFO L225 Difference]: With dead ends: 16892 [2019-12-27 21:53:50,938 INFO L226 Difference]: Without dead ends: 16892 [2019-12-27 21:53:50,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:53:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16892 states. [2019-12-27 21:53:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16892 to 13387. [2019-12-27 21:53:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13387 states. [2019-12-27 21:53:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13387 states to 13387 states and 30154 transitions. [2019-12-27 21:53:51,158 INFO L78 Accepts]: Start accepts. Automaton has 13387 states and 30154 transitions. Word has length 95 [2019-12-27 21:53:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:51,158 INFO L462 AbstractCegarLoop]: Abstraction has 13387 states and 30154 transitions. [2019-12-27 21:53:51,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:53:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13387 states and 30154 transitions. [2019-12-27 21:53:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:51,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:51,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:51,173 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash -119254624, now seen corresponding path program 1 times [2019-12-27 21:53:51,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:51,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289954318] [2019-12-27 21:53:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:51,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289954318] [2019-12-27 21:53:51,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:51,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:53:51,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556161510] [2019-12-27 21:53:51,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:51,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:51,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 162 transitions. [2019-12-27 21:53:51,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:51,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:53:51,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:53:51,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:53:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:53:51,624 INFO L87 Difference]: Start difference. First operand 13387 states and 30154 transitions. Second operand 14 states. [2019-12-27 21:53:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:54,245 INFO L93 Difference]: Finished difference Result 27860 states and 61870 transitions. [2019-12-27 21:53:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 21:53:54,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 21:53:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:54,271 INFO L225 Difference]: With dead ends: 27860 [2019-12-27 21:53:54,271 INFO L226 Difference]: Without dead ends: 21971 [2019-12-27 21:53:54,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=1921, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 21:53:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21971 states. [2019-12-27 21:53:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21971 to 16487. [2019-12-27 21:53:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2019-12-27 21:53:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 37717 transitions. [2019-12-27 21:53:54,568 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 37717 transitions. Word has length 96 [2019-12-27 21:53:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:54,568 INFO L462 AbstractCegarLoop]: Abstraction has 16487 states and 37717 transitions. [2019-12-27 21:53:54,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:53:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 37717 transitions. [2019-12-27 21:53:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:54,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:54,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:54,589 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -882944868, now seen corresponding path program 2 times [2019-12-27 21:53:54,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:54,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822452011] [2019-12-27 21:53:54,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:53:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822452011] [2019-12-27 21:53:54,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:53:54,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [141909689] [2019-12-27 21:53:54,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:54,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:54,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 21:53:54,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:55,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 21:53:55,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 21:53:55,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 21:53:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:53:55,130 INFO L87 Difference]: Start difference. First operand 16487 states and 37717 transitions. Second operand 20 states. [2019-12-27 21:54:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:03,401 INFO L93 Difference]: Finished difference Result 38749 states and 86673 transitions. [2019-12-27 21:54:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-27 21:54:03,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-12-27 21:54:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:03,436 INFO L225 Difference]: With dead ends: 38749 [2019-12-27 21:54:03,436 INFO L226 Difference]: Without dead ends: 31619 [2019-12-27 21:54:03,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3111 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1272, Invalid=7848, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 21:54:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31619 states. [2019-12-27 21:54:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31619 to 20032. [2019-12-27 21:54:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20032 states. [2019-12-27 21:54:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20032 states to 20032 states and 46202 transitions. [2019-12-27 21:54:03,747 INFO L78 Accepts]: Start accepts. Automaton has 20032 states and 46202 transitions. Word has length 96 [2019-12-27 21:54:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:03,747 INFO L462 AbstractCegarLoop]: Abstraction has 20032 states and 46202 transitions. [2019-12-27 21:54:03,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 21:54:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 20032 states and 46202 transitions. [2019-12-27 21:54:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:03,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:03,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:03,767 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -869322052, now seen corresponding path program 3 times [2019-12-27 21:54:03,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:03,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408464243] [2019-12-27 21:54:03,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:04,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408464243] [2019-12-27 21:54:04,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:04,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:54:04,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169647577] [2019-12-27 21:54:04,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:04,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:04,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 220 transitions. [2019-12-27 21:54:04,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:04,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:54:04,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:54:04,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:54:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:54:04,235 INFO L87 Difference]: Start difference. First operand 20032 states and 46202 transitions. Second operand 12 states. [2019-12-27 21:54:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:07,259 INFO L93 Difference]: Finished difference Result 50160 states and 111753 transitions. [2019-12-27 21:54:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 21:54:07,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 21:54:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:07,317 INFO L225 Difference]: With dead ends: 50160 [2019-12-27 21:54:07,317 INFO L226 Difference]: Without dead ends: 47814 [2019-12-27 21:54:07,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=543, Invalid=3617, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:54:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47814 states. [2019-12-27 21:54:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47814 to 27422. [2019-12-27 21:54:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27422 states. [2019-12-27 21:54:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27422 states to 27422 states and 64090 transitions. [2019-12-27 21:54:07,922 INFO L78 Accepts]: Start accepts. Automaton has 27422 states and 64090 transitions. Word has length 96 [2019-12-27 21:54:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:07,922 INFO L462 AbstractCegarLoop]: Abstraction has 27422 states and 64090 transitions. [2019-12-27 21:54:07,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:54:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27422 states and 64090 transitions. [2019-12-27 21:54:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:07,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:07,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:07,948 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2008375454, now seen corresponding path program 4 times [2019-12-27 21:54:07,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:07,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396071688] [2019-12-27 21:54:07,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:08,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396071688] [2019-12-27 21:54:08,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:08,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:54:08,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673864270] [2019-12-27 21:54:08,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:08,138 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:08,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 21:54:08,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:08,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:54:08,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:08,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:08,261 INFO L87 Difference]: Start difference. First operand 27422 states and 64090 transitions. Second operand 10 states. [2019-12-27 21:54:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:09,102 INFO L93 Difference]: Finished difference Result 37939 states and 87142 transitions. [2019-12-27 21:54:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:54:09,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:54:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:09,147 INFO L225 Difference]: With dead ends: 37939 [2019-12-27 21:54:09,147 INFO L226 Difference]: Without dead ends: 37273 [2019-12-27 21:54:09,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:54:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37273 states. [2019-12-27 21:54:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37273 to 27432. [2019-12-27 21:54:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27432 states. [2019-12-27 21:54:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27432 states to 27432 states and 64105 transitions. [2019-12-27 21:54:09,782 INFO L78 Accepts]: Start accepts. Automaton has 27432 states and 64105 transitions. Word has length 96 [2019-12-27 21:54:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:09,782 INFO L462 AbstractCegarLoop]: Abstraction has 27432 states and 64105 transitions. [2019-12-27 21:54:09,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27432 states and 64105 transitions. [2019-12-27 21:54:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:09,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:09,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:09,810 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash -598513280, now seen corresponding path program 5 times [2019-12-27 21:54:09,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:09,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930763307] [2019-12-27 21:54:09,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:09,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930763307] [2019-12-27 21:54:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:54:09,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600319260] [2019-12-27 21:54:09,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:10,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:10,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 217 transitions. [2019-12-27 21:54:10,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:10,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 21:54:10,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:54:10,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:54:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:54:10,405 INFO L87 Difference]: Start difference. First operand 27432 states and 64105 transitions. Second operand 14 states. [2019-12-27 21:54:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:14,645 INFO L93 Difference]: Finished difference Result 40796 states and 92828 transitions. [2019-12-27 21:54:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 21:54:14,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-27 21:54:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:14,692 INFO L225 Difference]: With dead ends: 40796 [2019-12-27 21:54:14,693 INFO L226 Difference]: Without dead ends: 38721 [2019-12-27 21:54:14,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=643, Invalid=3263, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 21:54:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38721 states. [2019-12-27 21:54:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38721 to 28416. [2019-12-27 21:54:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28416 states. [2019-12-27 21:54:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28416 states to 28416 states and 66478 transitions. [2019-12-27 21:54:15,240 INFO L78 Accepts]: Start accepts. Automaton has 28416 states and 66478 transitions. Word has length 96 [2019-12-27 21:54:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:15,240 INFO L462 AbstractCegarLoop]: Abstraction has 28416 states and 66478 transitions. [2019-12-27 21:54:15,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:54:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 28416 states and 66478 transitions. [2019-12-27 21:54:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:15,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:15,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:15,267 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1143577418, now seen corresponding path program 6 times [2019-12-27 21:54:15,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:15,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53483806] [2019-12-27 21:54:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:15,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53483806] [2019-12-27 21:54:15,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:15,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:54:15,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175463013] [2019-12-27 21:54:15,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:15,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:15,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 301 transitions. [2019-12-27 21:54:15,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:15,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 21:54:15,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:54:15,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:54:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:54:15,738 INFO L87 Difference]: Start difference. First operand 28416 states and 66478 transitions. Second operand 13 states. [2019-12-27 21:54:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:18,566 INFO L93 Difference]: Finished difference Result 52128 states and 118892 transitions. [2019-12-27 21:54:18,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 21:54:18,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 21:54:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:18,624 INFO L225 Difference]: With dead ends: 52128 [2019-12-27 21:54:18,624 INFO L226 Difference]: Without dead ends: 50988 [2019-12-27 21:54:18,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=617, Invalid=2689, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 21:54:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50988 states. [2019-12-27 21:54:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50988 to 33942. [2019-12-27 21:54:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33942 states. [2019-12-27 21:54:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33942 states to 33942 states and 79784 transitions. [2019-12-27 21:54:19,208 INFO L78 Accepts]: Start accepts. Automaton has 33942 states and 79784 transitions. Word has length 96 [2019-12-27 21:54:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:19,208 INFO L462 AbstractCegarLoop]: Abstraction has 33942 states and 79784 transitions. [2019-12-27 21:54:19,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:54:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33942 states and 79784 transitions. [2019-12-27 21:54:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:19,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:19,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:19,241 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 775228996, now seen corresponding path program 7 times [2019-12-27 21:54:19,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:19,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966031494] [2019-12-27 21:54:19,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:19,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966031494] [2019-12-27 21:54:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:54:19,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095866276] [2019-12-27 21:54:19,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:19,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:19,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 200 transitions. [2019-12-27 21:54:19,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:19,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:19,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:54:19,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:54:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:19,509 INFO L87 Difference]: Start difference. First operand 33942 states and 79784 transitions. Second operand 6 states. [2019-12-27 21:54:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:20,859 INFO L93 Difference]: Finished difference Result 74390 states and 172227 transitions. [2019-12-27 21:54:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:54:20,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 21:54:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:20,957 INFO L225 Difference]: With dead ends: 74390 [2019-12-27 21:54:20,957 INFO L226 Difference]: Without dead ends: 74390 [2019-12-27 21:54:20,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:54:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74390 states. [2019-12-27 21:54:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74390 to 42249. [2019-12-27 21:54:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42249 states. [2019-12-27 21:54:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42249 states to 42249 states and 98973 transitions. [2019-12-27 21:54:21,680 INFO L78 Accepts]: Start accepts. Automaton has 42249 states and 98973 transitions. Word has length 96 [2019-12-27 21:54:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:21,680 INFO L462 AbstractCegarLoop]: Abstraction has 42249 states and 98973 transitions. [2019-12-27 21:54:21,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:54:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42249 states and 98973 transitions. [2019-12-27 21:54:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:21,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:21,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:21,718 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -954793174, now seen corresponding path program 8 times [2019-12-27 21:54:21,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:21,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380981943] [2019-12-27 21:54:21,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:21,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380981943] [2019-12-27 21:54:21,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:21,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:54:21,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129044116] [2019-12-27 21:54:21,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:21,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:21,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 167 transitions. [2019-12-27 21:54:21,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:21,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:21,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:21,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:21,989 INFO L87 Difference]: Start difference. First operand 42249 states and 98973 transitions. Second operand 5 states. [2019-12-27 21:54:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:22,721 INFO L93 Difference]: Finished difference Result 53725 states and 125214 transitions. [2019-12-27 21:54:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:54:22,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 21:54:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:22,783 INFO L225 Difference]: With dead ends: 53725 [2019-12-27 21:54:22,783 INFO L226 Difference]: Without dead ends: 53725 [2019-12-27 21:54:22,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:54:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53725 states. [2019-12-27 21:54:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53725 to 44259. [2019-12-27 21:54:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44259 states. [2019-12-27 21:54:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44259 states to 44259 states and 103851 transitions. [2019-12-27 21:54:23,348 INFO L78 Accepts]: Start accepts. Automaton has 44259 states and 103851 transitions. Word has length 96 [2019-12-27 21:54:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:23,348 INFO L462 AbstractCegarLoop]: Abstraction has 44259 states and 103851 transitions. [2019-12-27 21:54:23,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 44259 states and 103851 transitions. [2019-12-27 21:54:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:23,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:23,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:23,387 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 426582246, now seen corresponding path program 9 times [2019-12-27 21:54:23,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:23,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668743106] [2019-12-27 21:54:23,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:23,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668743106] [2019-12-27 21:54:23,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:23,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 21:54:23,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869143385] [2019-12-27 21:54:23,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:23,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:24,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-27 21:54:24,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:24,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:54:24,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:54:24,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 21:54:24,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 21:54:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:54:24,410 INFO L87 Difference]: Start difference. First operand 44259 states and 103851 transitions. Second operand 23 states. [2019-12-27 21:54:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:29,517 INFO L93 Difference]: Finished difference Result 50021 states and 116947 transitions. [2019-12-27 21:54:29,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:54:29,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-12-27 21:54:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:29,579 INFO L225 Difference]: With dead ends: 50021 [2019-12-27 21:54:29,579 INFO L226 Difference]: Without dead ends: 49974 [2019-12-27 21:54:29,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:54:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49974 states. [2019-12-27 21:54:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49974 to 47645. [2019-12-27 21:54:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47645 states. [2019-12-27 21:54:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47645 states to 47645 states and 111934 transitions. [2019-12-27 21:54:30,182 INFO L78 Accepts]: Start accepts. Automaton has 47645 states and 111934 transitions. Word has length 96 [2019-12-27 21:54:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:30,182 INFO L462 AbstractCegarLoop]: Abstraction has 47645 states and 111934 transitions. [2019-12-27 21:54:30,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 21:54:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 47645 states and 111934 transitions. [2019-12-27 21:54:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:30,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:30,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:30,227 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -591919628, now seen corresponding path program 10 times [2019-12-27 21:54:30,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:30,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785921508] [2019-12-27 21:54:30,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:30,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785921508] [2019-12-27 21:54:30,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:30,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:54:30,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730921250] [2019-12-27 21:54:30,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:30,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:31,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 182 transitions. [2019-12-27 21:54:31,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:31,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:31,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:54:31,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:31,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:54:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:54:31,193 INFO L87 Difference]: Start difference. First operand 47645 states and 111934 transitions. Second operand 16 states. [2019-12-27 21:54:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:32,648 INFO L93 Difference]: Finished difference Result 56297 states and 131159 transitions. [2019-12-27 21:54:32,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:54:32,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 21:54:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:32,719 INFO L225 Difference]: With dead ends: 56297 [2019-12-27 21:54:32,719 INFO L226 Difference]: Without dead ends: 56259 [2019-12-27 21:54:32,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:54:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56259 states. [2019-12-27 21:54:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56259 to 49244. [2019-12-27 21:54:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49244 states. [2019-12-27 21:54:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49244 states to 49244 states and 115651 transitions. [2019-12-27 21:54:33,378 INFO L78 Accepts]: Start accepts. Automaton has 49244 states and 115651 transitions. Word has length 96 [2019-12-27 21:54:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:33,379 INFO L462 AbstractCegarLoop]: Abstraction has 49244 states and 115651 transitions. [2019-12-27 21:54:33,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:54:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 49244 states and 115651 transitions. [2019-12-27 21:54:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:33,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:33,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:33,431 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1541402152, now seen corresponding path program 11 times [2019-12-27 21:54:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:33,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186118521] [2019-12-27 21:54:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:33,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186118521] [2019-12-27 21:54:33,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:33,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:54:33,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891230046] [2019-12-27 21:54:33,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:33,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:34,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 161 transitions. [2019-12-27 21:54:34,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:34,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:54:34,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:54:34,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:54:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:54:34,126 INFO L87 Difference]: Start difference. First operand 49244 states and 115651 transitions. Second operand 17 states. [2019-12-27 21:54:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:39,913 INFO L93 Difference]: Finished difference Result 100960 states and 234954 transitions. [2019-12-27 21:54:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 21:54:39,914 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 21:54:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:40,047 INFO L225 Difference]: With dead ends: 100960 [2019-12-27 21:54:40,048 INFO L226 Difference]: Without dead ends: 97330 [2019-12-27 21:54:40,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=484, Invalid=3056, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 21:54:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97330 states. [2019-12-27 21:54:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97330 to 48591. [2019-12-27 21:54:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48591 states. [2019-12-27 21:54:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48591 states to 48591 states and 114413 transitions. [2019-12-27 21:54:41,211 INFO L78 Accepts]: Start accepts. Automaton has 48591 states and 114413 transitions. Word has length 96 [2019-12-27 21:54:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:41,212 INFO L462 AbstractCegarLoop]: Abstraction has 48591 states and 114413 transitions. [2019-12-27 21:54:41,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:54:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48591 states and 114413 transitions. [2019-12-27 21:54:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:41,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:41,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:41,258 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1472880176, now seen corresponding path program 12 times [2019-12-27 21:54:41,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:41,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97975742] [2019-12-27 21:54:41,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:41,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97975742] [2019-12-27 21:54:41,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:41,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:54:41,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170458251] [2019-12-27 21:54:41,342 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:41,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:41,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 170 transitions. [2019-12-27 21:54:41,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:41,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:41,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:54:41,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:54:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:41,510 INFO L87 Difference]: Start difference. First operand 48591 states and 114413 transitions. Second operand 6 states. [2019-12-27 21:54:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:42,189 INFO L93 Difference]: Finished difference Result 49216 states and 115610 transitions. [2019-12-27 21:54:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:54:42,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 21:54:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:42,253 INFO L225 Difference]: With dead ends: 49216 [2019-12-27 21:54:42,253 INFO L226 Difference]: Without dead ends: 49216 [2019-12-27 21:54:42,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:54:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49216 states. [2019-12-27 21:54:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49216 to 48483. [2019-12-27 21:54:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48483 states. [2019-12-27 21:54:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48483 states to 48483 states and 114197 transitions. [2019-12-27 21:54:43,074 INFO L78 Accepts]: Start accepts. Automaton has 48483 states and 114197 transitions. Word has length 96 [2019-12-27 21:54:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:43,075 INFO L462 AbstractCegarLoop]: Abstraction has 48483 states and 114197 transitions. [2019-12-27 21:54:43,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:54:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 48483 states and 114197 transitions. [2019-12-27 21:54:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:43,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:43,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:43,119 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1289562784, now seen corresponding path program 13 times [2019-12-27 21:54:43,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:43,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843329675] [2019-12-27 21:54:43,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:43,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843329675] [2019-12-27 21:54:43,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:43,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:54:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445226600] [2019-12-27 21:54:43,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:43,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:43,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 314 transitions. [2019-12-27 21:54:43,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:43,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:54:43,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:43,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:43,590 INFO L87 Difference]: Start difference. First operand 48483 states and 114197 transitions. Second operand 10 states. [2019-12-27 21:54:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:44,661 INFO L93 Difference]: Finished difference Result 71324 states and 165081 transitions. [2019-12-27 21:54:44,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:54:44,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:54:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:44,750 INFO L225 Difference]: With dead ends: 71324 [2019-12-27 21:54:44,751 INFO L226 Difference]: Without dead ends: 68923 [2019-12-27 21:54:44,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:54:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68923 states. [2019-12-27 21:54:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68923 to 53559. [2019-12-27 21:54:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53559 states. [2019-12-27 21:54:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53559 states to 53559 states and 126232 transitions. [2019-12-27 21:54:45,781 INFO L78 Accepts]: Start accepts. Automaton has 53559 states and 126232 transitions. Word has length 96 [2019-12-27 21:54:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:45,781 INFO L462 AbstractCegarLoop]: Abstraction has 53559 states and 126232 transitions. [2019-12-27 21:54:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53559 states and 126232 transitions. [2019-12-27 21:54:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:45,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:45,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:45,841 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 923166496, now seen corresponding path program 14 times [2019-12-27 21:54:45,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:45,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489956362] [2019-12-27 21:54:45,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:46,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489956362] [2019-12-27 21:54:46,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:46,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:54:46,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451057472] [2019-12-27 21:54:46,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:46,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:46,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 197 transitions. [2019-12-27 21:54:46,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:46,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:46,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:46,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:46,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:46,193 INFO L87 Difference]: Start difference. First operand 53559 states and 126232 transitions. Second operand 10 states. [2019-12-27 21:54:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:47,528 INFO L93 Difference]: Finished difference Result 73628 states and 171641 transitions. [2019-12-27 21:54:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:54:47,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:54:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:47,626 INFO L225 Difference]: With dead ends: 73628 [2019-12-27 21:54:47,626 INFO L226 Difference]: Without dead ends: 73628 [2019-12-27 21:54:47,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:54:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73628 states. [2019-12-27 21:54:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73628 to 59952. [2019-12-27 21:54:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-27 21:54:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 141290 transitions. [2019-12-27 21:54:48,731 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 141290 transitions. Word has length 96 [2019-12-27 21:54:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:48,731 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 141290 transitions. [2019-12-27 21:54:48,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 141290 transitions. [2019-12-27 21:54:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:48,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:48,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:48,794 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1665832878, now seen corresponding path program 15 times [2019-12-27 21:54:48,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:48,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719625580] [2019-12-27 21:54:48,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:48,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719625580] [2019-12-27 21:54:48,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:48,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:54:48,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522839128] [2019-12-27 21:54:48,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:48,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:49,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 200 transitions. [2019-12-27 21:54:49,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:49,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:49,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:54:49,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:49,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:54:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:49,110 INFO L87 Difference]: Start difference. First operand 59952 states and 141290 transitions. Second operand 6 states. [2019-12-27 21:54:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:49,508 INFO L93 Difference]: Finished difference Result 54798 states and 129686 transitions. [2019-12-27 21:54:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:54:49,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 21:54:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:49,576 INFO L225 Difference]: With dead ends: 54798 [2019-12-27 21:54:49,576 INFO L226 Difference]: Without dead ends: 54798 [2019-12-27 21:54:49,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:54:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54798 states. [2019-12-27 21:54:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54798 to 54182. [2019-12-27 21:54:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54182 states. [2019-12-27 21:54:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54182 states to 54182 states and 128467 transitions. [2019-12-27 21:54:50,616 INFO L78 Accepts]: Start accepts. Automaton has 54182 states and 128467 transitions. Word has length 96 [2019-12-27 21:54:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:50,616 INFO L462 AbstractCegarLoop]: Abstraction has 54182 states and 128467 transitions. [2019-12-27 21:54:50,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:54:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54182 states and 128467 transitions. [2019-12-27 21:54:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:50,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:50,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:50,669 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -302238048, now seen corresponding path program 16 times [2019-12-27 21:54:50,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:50,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90400077] [2019-12-27 21:54:50,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:50,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90400077] [2019-12-27 21:54:50,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:50,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:54:50,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779539359] [2019-12-27 21:54:50,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:50,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:50,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 146 transitions. [2019-12-27 21:54:50,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:50,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:50,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:50,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:50,949 INFO L87 Difference]: Start difference. First operand 54182 states and 128467 transitions. Second operand 10 states. [2019-12-27 21:54:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:52,954 INFO L93 Difference]: Finished difference Result 90578 states and 212505 transitions. [2019-12-27 21:54:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:54:52,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:54:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:53,067 INFO L225 Difference]: With dead ends: 90578 [2019-12-27 21:54:53,067 INFO L226 Difference]: Without dead ends: 84423 [2019-12-27 21:54:53,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:54:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84423 states. [2019-12-27 21:54:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84423 to 54631. [2019-12-27 21:54:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54631 states. [2019-12-27 21:54:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54631 states to 54631 states and 129561 transitions. [2019-12-27 21:54:54,325 INFO L78 Accepts]: Start accepts. Automaton has 54631 states and 129561 transitions. Word has length 96 [2019-12-27 21:54:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:54,325 INFO L462 AbstractCegarLoop]: Abstraction has 54631 states and 129561 transitions. [2019-12-27 21:54:54,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 54631 states and 129561 transitions. [2019-12-27 21:54:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:54:54,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:54,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:54,383 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1065928292, now seen corresponding path program 17 times [2019-12-27 21:54:54,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:54,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523262589] [2019-12-27 21:54:54,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:54,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523262589] [2019-12-27 21:54:54,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:54,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 21:54:54,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372279439] [2019-12-27 21:54:54,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:54,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:54,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 199 transitions. [2019-12-27 21:54:54,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:55,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 21:54:55,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 21:54:55,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:55,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 21:54:55,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:54:55,178 INFO L87 Difference]: Start difference. First operand 54631 states and 129561 transitions. Second operand 24 states. Received shutdown request... [2019-12-27 21:55:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 21:55:04,181 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 21:55:04,186 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 21:55:04,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:55:04 BasicIcfg [2019-12-27 21:55:04,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:55:04,188 INFO L168 Benchmark]: Toolchain (without parser) took 211786.80 ms. Allocated memory was 139.5 MB in the beginning and 3.7 GB in the end (delta: 3.6 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.7 GB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,189 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.69 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.8 MB in the beginning and 155.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.21 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,190 INFO L168 Benchmark]: Boogie Preprocessor took 47.93 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 148.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,191 INFO L168 Benchmark]: RCFGBuilder took 1247.08 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 148.9 MB in the beginning and 188.8 MB in the end (delta: -39.9 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,191 INFO L168 Benchmark]: TraceAbstraction took 209641.89 ms. Allocated memory was 234.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 188.8 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:55:04,194 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.69 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.8 MB in the beginning and 155.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.21 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.93 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 148.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1247.08 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 148.9 MB in the beginning and 188.8 MB in the end (delta: -39.9 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209641.89 ms. Allocated memory was 234.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 188.8 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 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 (54631states) and FLOYD_HOARE automaton (currently 62 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (47373 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (54631states) and FLOYD_HOARE automaton (currently 62 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (47373 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 209.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 92.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16555 SDtfs, 25736 SDslu, 89000 SDs, 0 SdLazy, 43964 SolverSat, 1758 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1066 GetRequests, 295 SyntacticMatches, 37 SemanticMatches, 734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10462 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 82.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 346687 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2495 NumberOfCodeBlocks, 2495 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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