/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/safe013_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:25:37,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:25:37,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:25:37,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:25:37,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:25:37,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:25:37,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:25:37,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:25:37,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:25:37,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:25:37,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:25:37,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:25:37,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:25:37,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:25:37,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:25:37,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:25:37,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:25:37,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:25:37,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:25:37,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:25:37,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:25:37,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:25:37,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:25:37,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:25:37,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:25:37,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:25:37,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:25:37,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:25:37,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:25:37,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:25:37,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:25:37,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:25:37,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:25:37,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:25:37,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:25:37,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:25:37,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:25:37,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:25:37,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:25:37,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:25:37,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:25:37,139 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 22:25:37,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:25:37,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:25:37,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:25:37,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:25:37,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:25:37,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:25:37,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:25:37,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:25:37,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:25:37,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:25:37,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:25:37,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:25:37,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:25:37,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:25:37,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:25:37,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:25:37,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:25:37,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:25:37,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:25:37,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:25:37,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:25:37,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:37,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:25:37,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:25:37,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:25:37,165 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:25:37,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:25:37,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:25:37,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:25:37,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:25:37,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:25:37,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:25:37,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-27 22:25:37,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4d3f43b/a545380492fa4873989980b6f946c119/FLAG118fdc957 [2019-12-27 22:25:38,110 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:25:38,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-27 22:25:38,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4d3f43b/a545380492fa4873989980b6f946c119/FLAG118fdc957 [2019-12-27 22:25:38,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4d3f43b/a545380492fa4873989980b6f946c119 [2019-12-27 22:25:38,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:25:38,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:25:38,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:38,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:25:38,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:25:38,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:38" (1/1) ... [2019-12-27 22:25:38,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:38, skipping insertion in model container [2019-12-27 22:25:38,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:38" (1/1) ... [2019-12-27 22:25:38,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:25:38,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:25:38,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:39,017 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:25:39,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:39,197 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:25:39,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39 WrapperNode [2019-12-27 22:25:39,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:39,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:39,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:25:39,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:25:39,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:39,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:25:39,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:25:39,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:25:39,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (1/1) ... [2019-12-27 22:25:39,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:25:39,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:25:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:25:39,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:25:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (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 22:25:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:25:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:25:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:25:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:25:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:25:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:25:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:25:39,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:25:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:25:39,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:25:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:25:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:25:39,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:25:39,379 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 22:25:40,108 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:25:40,109 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:25:40,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:40 BoogieIcfgContainer [2019-12-27 22:25:40,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:25:40,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:25:40,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:25:40,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:25:40,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:25:38" (1/3) ... [2019-12-27 22:25:40,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1f35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:40, skipping insertion in model container [2019-12-27 22:25:40,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:39" (2/3) ... [2019-12-27 22:25:40,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1f35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:40, skipping insertion in model container [2019-12-27 22:25:40,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:40" (3/3) ... [2019-12-27 22:25:40,119 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.opt.i [2019-12-27 22:25:40,130 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:25:40,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:25:40,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:25:40,139 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:25:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,235 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,235 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:40,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:25:40,290 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:25:40,290 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:25:40,290 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:25:40,290 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:25:40,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:25:40,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:25:40,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:25:40,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:25:40,304 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:25:40,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:40,410 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:40,411 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:40,429 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:40,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:40,531 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:40,531 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:40,538 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:40,557 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:25:40,558 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:25:44,138 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:25:44,285 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:25:44,411 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 22:25:44,411 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:25:44,414 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 22:25:58,224 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 22:25:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 22:25:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:25:58,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:58,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:25:58,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 22:25:58,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:58,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506805585] [2019-12-27 22:25:58,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:58,467 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 22:25:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506805585] [2019-12-27 22:25:58,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:58,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:25:58,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158514601] [2019-12-27 22:25:58,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:58,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:58,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:25:58,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:58,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:58,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:58,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:58,509 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 22:25:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:59,897 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 22:25:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:59,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:25:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:03,015 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 22:26:03,015 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 22:26:03,020 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 22:26:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 22:26:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 22:26:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 22:26:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 22:26:09,132 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 22:26:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:09,133 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 22:26:09,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 22:26:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:09,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:09,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:09,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 22:26:09,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:09,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489438826] [2019-12-27 22:26:09,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:09,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 22:26:09,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489438826] [2019-12-27 22:26:09,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:09,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:09,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795289122] [2019-12-27 22:26:09,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:09,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:09,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:09,297 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:09,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:09,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:09,300 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 22:26:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:13,718 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 22:26:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:13,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:14,186 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 22:26:14,186 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 22:26:14,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 22:26:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 22:26:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 22:26:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 22:26:21,062 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 22:26:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:21,063 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 22:26:21,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 22:26:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:21,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:21,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:21,067 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 22:26:21,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:21,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877259118] [2019-12-27 22:26:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:21,188 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 22:26:21,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877259118] [2019-12-27 22:26:21,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:21,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:21,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894352583] [2019-12-27 22:26:21,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:21,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:21,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:21,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:21,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:21,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:21,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:21,196 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 22:26:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:25,947 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-27 22:26:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:25,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:26,511 INFO L225 Difference]: With dead ends: 161841 [2019-12-27 22:26:26,511 INFO L226 Difference]: Without dead ends: 161729 [2019-12-27 22:26:26,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-27 22:26:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-27 22:26:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-27 22:26:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-27 22:26:38,091 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-27 22:26:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:38,091 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-27 22:26:38,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-27 22:26:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:38,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:38,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:38,097 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 22:26:38,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:38,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572995203] [2019-12-27 22:26:38,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:38,163 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 22:26:38,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572995203] [2019-12-27 22:26:38,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:38,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:38,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663086276] [2019-12-27 22:26:38,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:38,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:38,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:38,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:38,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:26:38,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:38,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:38,233 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 5 states. [2019-12-27 22:26:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:40,353 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-27 22:26:40,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:40,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:40,897 INFO L225 Difference]: With dead ends: 181948 [2019-12-27 22:26:40,897 INFO L226 Difference]: Without dead ends: 181948 [2019-12-27 22:26:40,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-27 22:26:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-27 22:26:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-27 22:26:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-27 22:26:53,567 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-27 22:26:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:53,568 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-27 22:26:53,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-27 22:26:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:53,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:53,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:53,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 22:26:53,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:53,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605761523] [2019-12-27 22:26:53,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:53,648 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 22:26:53,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605761523] [2019-12-27 22:26:53,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:53,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:53,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [252288076] [2019-12-27 22:26:53,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:53,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:53,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:53,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:53,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:53,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:53,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:53,687 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 5 states. [2019-12-27 22:26:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:56,055 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-27 22:26:56,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:56,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:56,565 INFO L225 Difference]: With dead ends: 176806 [2019-12-27 22:26:56,566 INFO L226 Difference]: Without dead ends: 176726 [2019-12-27 22:26:56,566 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 22:27:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-27 22:27:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-27 22:27:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-27 22:27:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-27 22:27:10,093 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-27 22:27:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:10,093 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-27 22:27:10,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-27 22:27:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:27:10,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:10,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:10,098 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 22:27:10,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:10,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077967678] [2019-12-27 22:27:10,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:10,179 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 22:27:10,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077967678] [2019-12-27 22:27:10,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:10,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:10,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322143678] [2019-12-27 22:27:10,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:10,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:10,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:27:10,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:10,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:27:10,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:10,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:10,221 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 5 states. [2019-12-27 22:27:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:12,690 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-27 22:27:12,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:12,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:27:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:13,258 INFO L225 Difference]: With dead ends: 181899 [2019-12-27 22:27:13,258 INFO L226 Difference]: Without dead ends: 181811 [2019-12-27 22:27:13,259 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 22:27:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-27 22:27:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-27 22:27:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-27 22:27:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-27 22:27:28,046 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-27 22:27:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:28,046 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-27 22:27:28,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-27 22:27:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:27:28,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:28,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:28,066 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -757674417, now seen corresponding path program 1 times [2019-12-27 22:27:28,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:28,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170427124] [2019-12-27 22:27:28,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:28,121 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 22:27:28,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170427124] [2019-12-27 22:27:28,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:28,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:27:28,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369992121] [2019-12-27 22:27:28,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:28,126 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:28,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:27:28,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:28,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:27:28,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:27:28,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:27:28,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:27:28,130 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-27 22:27:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:28,906 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-27 22:27:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:27:28,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:27:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:35,582 INFO L225 Difference]: With dead ends: 155313 [2019-12-27 22:27:35,582 INFO L226 Difference]: Without dead ends: 155313 [2019-12-27 22:27:35,582 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 22:27:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-27 22:27:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-27 22:27:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-27 22:27:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-27 22:27:42,915 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-27 22:27:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:42,916 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-27 22:27:42,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:27:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-27 22:27:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:27:42,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:42,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:42,934 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -562123947, now seen corresponding path program 1 times [2019-12-27 22:27:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772989560] [2019-12-27 22:27:42,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:42,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772989560] [2019-12-27 22:27:42,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:42,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:42,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757447254] [2019-12-27 22:27:42,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:42,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:42,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 22:27:42,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:43,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:27:43,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:43,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:43,007 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 5 states. [2019-12-27 22:27:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:49,827 INFO L93 Difference]: Finished difference Result 306320 states and 1277665 transitions. [2019-12-27 22:27:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:49,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:27:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:51,149 INFO L225 Difference]: With dead ends: 306320 [2019-12-27 22:27:51,149 INFO L226 Difference]: Without dead ends: 183766 [2019-12-27 22:27:51,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 22:28:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183766 states. [2019-12-27 22:28:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183766 to 120708. [2019-12-27 22:28:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120708 states. [2019-12-27 22:28:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120708 states to 120708 states and 492233 transitions. [2019-12-27 22:28:03,620 INFO L78 Accepts]: Start accepts. Automaton has 120708 states and 492233 transitions. Word has length 19 [2019-12-27 22:28:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:03,620 INFO L462 AbstractCegarLoop]: Abstraction has 120708 states and 492233 transitions. [2019-12-27 22:28:03,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 120708 states and 492233 transitions. [2019-12-27 22:28:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:28:03,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:03,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:03,635 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1224805741, now seen corresponding path program 1 times [2019-12-27 22:28:03,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:03,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141836386] [2019-12-27 22:28:03,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:28:03,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141836386] [2019-12-27 22:28:03,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:03,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:03,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364081503] [2019-12-27 22:28:03,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:03,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:03,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:28:03,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:03,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:03,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:28:03,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:28:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:28:03,734 INFO L87 Difference]: Start difference. First operand 120708 states and 492233 transitions. Second operand 5 states. [2019-12-27 22:28:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:04,913 INFO L93 Difference]: Finished difference Result 160250 states and 638617 transitions. [2019-12-27 22:28:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:28:06,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:28:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:06,604 INFO L225 Difference]: With dead ends: 160250 [2019-12-27 22:28:06,604 INFO L226 Difference]: Without dead ends: 158095 [2019-12-27 22:28:06,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:28:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158095 states. [2019-12-27 22:28:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158095 to 124062. [2019-12-27 22:28:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124062 states. [2019-12-27 22:28:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124062 states to 124062 states and 506459 transitions. [2019-12-27 22:28:19,739 INFO L78 Accepts]: Start accepts. Automaton has 124062 states and 506459 transitions. Word has length 19 [2019-12-27 22:28:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:19,739 INFO L462 AbstractCegarLoop]: Abstraction has 124062 states and 506459 transitions. [2019-12-27 22:28:19,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 124062 states and 506459 transitions. [2019-12-27 22:28:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 22:28:19,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:19,758 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] [2019-12-27 22:28:19,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1903443732, now seen corresponding path program 1 times [2019-12-27 22:28:19,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:19,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010656947] [2019-12-27 22:28:19,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:19,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 22:28:19,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010656947] [2019-12-27 22:28:19,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:19,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:19,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596498716] [2019-12-27 22:28:19,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:19,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:19,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 60 transitions. [2019-12-27 22:28:19,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:19,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:19,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:28:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:28:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:19,813 INFO L87 Difference]: Start difference. First operand 124062 states and 506459 transitions. Second operand 3 states. [2019-12-27 22:28:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:21,939 INFO L93 Difference]: Finished difference Result 211901 states and 867827 transitions. [2019-12-27 22:28:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:28:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 22:28:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:22,247 INFO L225 Difference]: With dead ends: 211901 [2019-12-27 22:28:22,247 INFO L226 Difference]: Without dead ends: 108903 [2019-12-27 22:28:22,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108903 states. [2019-12-27 22:28:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108903 to 100216. [2019-12-27 22:28:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100216 states. [2019-12-27 22:28:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100216 states to 100216 states and 410838 transitions. [2019-12-27 22:28:33,153 INFO L78 Accepts]: Start accepts. Automaton has 100216 states and 410838 transitions. Word has length 20 [2019-12-27 22:28:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:33,154 INFO L462 AbstractCegarLoop]: Abstraction has 100216 states and 410838 transitions. [2019-12-27 22:28:33,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:28:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100216 states and 410838 transitions. [2019-12-27 22:28:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 22:28:33,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:33,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:33,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1337451788, now seen corresponding path program 1 times [2019-12-27 22:28:33,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365653821] [2019-12-27 22:28:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:33,241 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 22:28:33,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365653821] [2019-12-27 22:28:33,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:33,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:33,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470121166] [2019-12-27 22:28:33,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:33,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:33,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 95 transitions. [2019-12-27 22:28:33,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:33,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:28:33,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:28:33,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:28:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:28:33,280 INFO L87 Difference]: Start difference. First operand 100216 states and 410838 transitions. Second operand 5 states. [2019-12-27 22:28:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:34,317 INFO L93 Difference]: Finished difference Result 35927 states and 122909 transitions. [2019-12-27 22:28:34,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:34,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 22:28:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:34,374 INFO L225 Difference]: With dead ends: 35927 [2019-12-27 22:28:34,375 INFO L226 Difference]: Without dead ends: 31076 [2019-12-27 22:28:34,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 22:28:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31076 states. [2019-12-27 22:28:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31076 to 20261. [2019-12-27 22:28:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20261 states. [2019-12-27 22:28:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20261 states to 20261 states and 67415 transitions. [2019-12-27 22:28:34,841 INFO L78 Accepts]: Start accepts. Automaton has 20261 states and 67415 transitions. Word has length 21 [2019-12-27 22:28:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:34,841 INFO L462 AbstractCegarLoop]: Abstraction has 20261 states and 67415 transitions. [2019-12-27 22:28:34,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:28:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20261 states and 67415 transitions. [2019-12-27 22:28:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:28:34,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:34,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:34,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 22:28:34,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:34,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359737023] [2019-12-27 22:28:34,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:34,929 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 22:28:34,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359737023] [2019-12-27 22:28:34,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29992188] [2019-12-27 22:28:34,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:34,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:34,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:28:34,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:34,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:34,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:28:34,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:28:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:34,972 INFO L87 Difference]: Start difference. First operand 20261 states and 67415 transitions. Second operand 6 states. [2019-12-27 22:28:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:35,302 INFO L93 Difference]: Finished difference Result 20962 states and 68953 transitions. [2019-12-27 22:28:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:28:35,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:28:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:35,335 INFO L225 Difference]: With dead ends: 20962 [2019-12-27 22:28:35,335 INFO L226 Difference]: Without dead ends: 20643 [2019-12-27 22:28:35,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2019-12-27 22:28:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 20188. [2019-12-27 22:28:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20188 states. [2019-12-27 22:28:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20188 states to 20188 states and 67139 transitions. [2019-12-27 22:28:35,699 INFO L78 Accepts]: Start accepts. Automaton has 20188 states and 67139 transitions. Word has length 22 [2019-12-27 22:28:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:35,700 INFO L462 AbstractCegarLoop]: Abstraction has 20188 states and 67139 transitions. [2019-12-27 22:28:35,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:28:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20188 states and 67139 transitions. [2019-12-27 22:28:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:28:35,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:35,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:35,703 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:35,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:35,703 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 22:28:35,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:35,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693471785] [2019-12-27 22:28:35,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:35,768 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 22:28:35,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693471785] [2019-12-27 22:28:35,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:35,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:28:35,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730130678] [2019-12-27 22:28:35,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:35,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:35,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:28:35,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:35,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:35,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:28:35,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:28:35,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:35,808 INFO L87 Difference]: Start difference. First operand 20188 states and 67139 transitions. Second operand 6 states. [2019-12-27 22:28:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:36,742 INFO L93 Difference]: Finished difference Result 20141 states and 66503 transitions. [2019-12-27 22:28:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:28:36,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:28:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:36,793 INFO L225 Difference]: With dead ends: 20141 [2019-12-27 22:28:36,793 INFO L226 Difference]: Without dead ends: 19723 [2019-12-27 22:28:36,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:28:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2019-12-27 22:28:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19122. [2019-12-27 22:28:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 22:28:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 64070 transitions. [2019-12-27 22:28:37,189 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 64070 transitions. Word has length 22 [2019-12-27 22:28:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 64070 transitions. [2019-12-27 22:28:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:28:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 64070 transitions. [2019-12-27 22:28:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:28:37,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:37,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:37,197 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-27 22:28:37,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:37,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494181699] [2019-12-27 22:28:37,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:37,277 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 22:28:37,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494181699] [2019-12-27 22:28:37,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:37,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:28:37,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472797011] [2019-12-27 22:28:37,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:37,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:37,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:28:37,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:37,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:37,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:28:37,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:28:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:28:37,332 INFO L87 Difference]: Start difference. First operand 19122 states and 64070 transitions. Second operand 6 states. [2019-12-27 22:28:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:37,447 INFO L93 Difference]: Finished difference Result 7284 states and 22451 transitions. [2019-12-27 22:28:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:37,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 22:28:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:37,462 INFO L225 Difference]: With dead ends: 7284 [2019-12-27 22:28:37,463 INFO L226 Difference]: Without dead ends: 6220 [2019-12-27 22:28:37,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:28:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2019-12-27 22:28:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 6220. [2019-12-27 22:28:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-12-27 22:28:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 18995 transitions. [2019-12-27 22:28:37,622 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 18995 transitions. Word has length 28 [2019-12-27 22:28:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:37,623 INFO L462 AbstractCegarLoop]: Abstraction has 6220 states and 18995 transitions. [2019-12-27 22:28:37,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:28:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 18995 transitions. [2019-12-27 22:28:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:28:37,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:37,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:37,635 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:37,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 22:28:37,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:37,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795552750] [2019-12-27 22:28:37,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:37,770 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 22:28:37,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795552750] [2019-12-27 22:28:37,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:28:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792114690] [2019-12-27 22:28:37,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:37,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:37,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 22:28:37,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:37,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:28:37,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:37,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:37,849 INFO L87 Difference]: Start difference. First operand 6220 states and 18995 transitions. Second operand 7 states. [2019-12-27 22:28:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:37,946 INFO L93 Difference]: Finished difference Result 5287 states and 16625 transitions. [2019-12-27 22:28:37,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:28:37,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:28:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:37,955 INFO L225 Difference]: With dead ends: 5287 [2019-12-27 22:28:37,956 INFO L226 Difference]: Without dead ends: 4788 [2019-12-27 22:28:37,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-27 22:28:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4788. [2019-12-27 22:28:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-27 22:28:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 15565 transitions. [2019-12-27 22:28:38,037 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 15565 transitions. Word has length 40 [2019-12-27 22:28:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:38,037 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 15565 transitions. [2019-12-27 22:28:38,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 15565 transitions. [2019-12-27 22:28:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:38,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:38,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:38,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:38,045 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 22:28:38,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:38,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873714908] [2019-12-27 22:28:38,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:28:38,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873714908] [2019-12-27 22:28:38,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:38,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:38,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784671039] [2019-12-27 22:28:38,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:38,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:38,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 436 transitions. [2019-12-27 22:28:38,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:38,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:28:38,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:38,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:38,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:38,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:38,577 INFO L87 Difference]: Start difference. First operand 4788 states and 15565 transitions. Second operand 7 states. [2019-12-27 22:28:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:38,808 INFO L93 Difference]: Finished difference Result 9084 states and 28982 transitions. [2019-12-27 22:28:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:28:38,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:28:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:38,820 INFO L225 Difference]: With dead ends: 9084 [2019-12-27 22:28:38,820 INFO L226 Difference]: Without dead ends: 6576 [2019-12-27 22:28:38,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:28:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-27 22:28:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5930. [2019-12-27 22:28:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-12-27 22:28:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 19209 transitions. [2019-12-27 22:28:38,914 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 19209 transitions. Word has length 54 [2019-12-27 22:28:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:38,914 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 19209 transitions. [2019-12-27 22:28:38,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 19209 transitions. [2019-12-27 22:28:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:38,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:38,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:38,923 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:38,923 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 22:28:38,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:38,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483511935] [2019-12-27 22:28:38,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:39,007 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 22:28:39,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483511935] [2019-12-27 22:28:39,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:39,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:39,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152072528] [2019-12-27 22:28:39,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:39,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:39,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 637 transitions. [2019-12-27 22:28:39,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:39,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:28:39,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:28:39,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:28:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:28:39,406 INFO L87 Difference]: Start difference. First operand 5930 states and 19209 transitions. Second operand 8 states. [2019-12-27 22:28:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:40,405 INFO L93 Difference]: Finished difference Result 13352 states and 42359 transitions. [2019-12-27 22:28:40,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:28:40,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:28:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:40,423 INFO L225 Difference]: With dead ends: 13352 [2019-12-27 22:28:40,423 INFO L226 Difference]: Without dead ends: 10146 [2019-12-27 22:28:40,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:28:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10146 states. [2019-12-27 22:28:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10146 to 7238. [2019-12-27 22:28:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-27 22:28:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 23230 transitions. [2019-12-27 22:28:40,562 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 23230 transitions. Word has length 54 [2019-12-27 22:28:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 23230 transitions. [2019-12-27 22:28:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:28:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 23230 transitions. [2019-12-27 22:28:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:40,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:40,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:40,571 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 22:28:40,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:40,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347391680] [2019-12-27 22:28:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:40,672 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 22:28:40,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347391680] [2019-12-27 22:28:40,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:40,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:28:40,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283603204] [2019-12-27 22:28:40,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:40,690 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:40,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 614 transitions. [2019-12-27 22:28:40,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:41,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:28:41,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:28:41,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:41,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:28:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:41,110 INFO L87 Difference]: Start difference. First operand 7238 states and 23230 transitions. Second operand 10 states. [2019-12-27 22:28:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:42,756 INFO L93 Difference]: Finished difference Result 30335 states and 93023 transitions. [2019-12-27 22:28:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 22:28:42,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:28:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:42,795 INFO L225 Difference]: With dead ends: 30335 [2019-12-27 22:28:42,795 INFO L226 Difference]: Without dead ends: 24335 [2019-12-27 22:28:42,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:28:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24335 states. [2019-12-27 22:28:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24335 to 9222. [2019-12-27 22:28:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-12-27 22:28:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 29627 transitions. [2019-12-27 22:28:43,057 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 29627 transitions. Word has length 54 [2019-12-27 22:28:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:43,057 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 29627 transitions. [2019-12-27 22:28:43,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:28:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 29627 transitions. [2019-12-27 22:28:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:43,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:43,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:43,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 4 times [2019-12-27 22:28:43,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:43,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792159537] [2019-12-27 22:28:43,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:43,172 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 22:28:43,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792159537] [2019-12-27 22:28:43,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:43,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:28:43,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787728141] [2019-12-27 22:28:43,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:43,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:43,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 413 transitions. [2019-12-27 22:28:43,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:43,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:28:43,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:28:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:43,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:28:43,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:43,443 INFO L87 Difference]: Start difference. First operand 9222 states and 29627 transitions. Second operand 10 states. [2019-12-27 22:28:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:46,995 INFO L93 Difference]: Finished difference Result 42171 states and 128807 transitions. [2019-12-27 22:28:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 22:28:46,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:28:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:47,057 INFO L225 Difference]: With dead ends: 42171 [2019-12-27 22:28:47,057 INFO L226 Difference]: Without dead ends: 42087 [2019-12-27 22:28:47,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:28:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42087 states. [2019-12-27 22:28:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42087 to 16423. [2019-12-27 22:28:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16423 states. [2019-12-27 22:28:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16423 states to 16423 states and 51766 transitions. [2019-12-27 22:28:47,528 INFO L78 Accepts]: Start accepts. Automaton has 16423 states and 51766 transitions. Word has length 54 [2019-12-27 22:28:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:47,528 INFO L462 AbstractCegarLoop]: Abstraction has 16423 states and 51766 transitions. [2019-12-27 22:28:47,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:28:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16423 states and 51766 transitions. [2019-12-27 22:28:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:47,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:47,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:47,546 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 5 times [2019-12-27 22:28:47,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:47,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737905478] [2019-12-27 22:28:47,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:47,632 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 22:28:47,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737905478] [2019-12-27 22:28:47,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:47,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:28:47,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840382484] [2019-12-27 22:28:47,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:47,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:47,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 418 transitions. [2019-12-27 22:28:47,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:47,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:28:47,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:28:47,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:47,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:28:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:28:47,984 INFO L87 Difference]: Start difference. First operand 16423 states and 51766 transitions. Second operand 7 states. [2019-12-27 22:28:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:48,931 INFO L93 Difference]: Finished difference Result 28625 states and 87831 transitions. [2019-12-27 22:28:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:28:48,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:28:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:48,973 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 22:28:48,973 INFO L226 Difference]: Without dead ends: 28515 [2019-12-27 22:28:48,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:28:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28515 states. [2019-12-27 22:28:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28515 to 20157. [2019-12-27 22:28:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20157 states. [2019-12-27 22:28:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20157 states to 20157 states and 63053 transitions. [2019-12-27 22:28:49,345 INFO L78 Accepts]: Start accepts. Automaton has 20157 states and 63053 transitions. Word has length 54 [2019-12-27 22:28:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:49,345 INFO L462 AbstractCegarLoop]: Abstraction has 20157 states and 63053 transitions. [2019-12-27 22:28:49,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:28:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20157 states and 63053 transitions. [2019-12-27 22:28:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:28:49,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:49,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:49,373 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 6 times [2019-12-27 22:28:49,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:49,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068686441] [2019-12-27 22:28:49,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:49,429 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 22:28:49,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068686441] [2019-12-27 22:28:49,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:49,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:49,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869459046] [2019-12-27 22:28:49,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:49,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:49,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 442 transitions. [2019-12-27 22:28:49,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:49,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:49,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:28:49,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:28:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:49,637 INFO L87 Difference]: Start difference. First operand 20157 states and 63053 transitions. Second operand 3 states. [2019-12-27 22:28:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:49,701 INFO L93 Difference]: Finished difference Result 20155 states and 63048 transitions. [2019-12-27 22:28:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:28:49,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:28:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:49,732 INFO L225 Difference]: With dead ends: 20155 [2019-12-27 22:28:49,732 INFO L226 Difference]: Without dead ends: 20155 [2019-12-27 22:28:49,733 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 22:28:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20155 states. [2019-12-27 22:28:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20155 to 16597. [2019-12-27 22:28:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16597 states. [2019-12-27 22:28:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16597 states to 16597 states and 52439 transitions. [2019-12-27 22:28:50,178 INFO L78 Accepts]: Start accepts. Automaton has 16597 states and 52439 transitions. Word has length 54 [2019-12-27 22:28:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:50,178 INFO L462 AbstractCegarLoop]: Abstraction has 16597 states and 52439 transitions. [2019-12-27 22:28:50,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:28:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16597 states and 52439 transitions. [2019-12-27 22:28:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:28:50,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:50,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:50,206 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-27 22:28:50,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:50,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950543716] [2019-12-27 22:28:50,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:50,269 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 22:28:50,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950543716] [2019-12-27 22:28:50,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:50,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:28:50,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778802692] [2019-12-27 22:28:50,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:50,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:50,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 414 transitions. [2019-12-27 22:28:50,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:50,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:28:50,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:28:50,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:28:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:28:50,439 INFO L87 Difference]: Start difference. First operand 16597 states and 52439 transitions. Second operand 4 states. [2019-12-27 22:28:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:50,658 INFO L93 Difference]: Finished difference Result 15706 states and 48642 transitions. [2019-12-27 22:28:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:28:50,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 22:28:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:50,680 INFO L225 Difference]: With dead ends: 15706 [2019-12-27 22:28:50,680 INFO L226 Difference]: Without dead ends: 15706 [2019-12-27 22:28:50,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:28:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15706 states. [2019-12-27 22:28:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15706 to 11742. [2019-12-27 22:28:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11742 states. [2019-12-27 22:28:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11742 states to 11742 states and 36666 transitions. [2019-12-27 22:28:50,885 INFO L78 Accepts]: Start accepts. Automaton has 11742 states and 36666 transitions. Word has length 55 [2019-12-27 22:28:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:50,886 INFO L462 AbstractCegarLoop]: Abstraction has 11742 states and 36666 transitions. [2019-12-27 22:28:50,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:28:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11742 states and 36666 transitions. [2019-12-27 22:28:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:28:50,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:50,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:28:50,899 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-27 22:28:50,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034576124] [2019-12-27 22:28:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:28:51,357 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 22:28:51,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034576124] [2019-12-27 22:28:51,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:28:51,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:28:51,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836089209] [2019-12-27 22:28:51,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:28:51,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:51,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 426 transitions. [2019-12-27 22:28:51,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:51,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:28:51,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:28:51,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:51,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:28:51,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:28:51,710 INFO L87 Difference]: Start difference. First operand 11742 states and 36666 transitions. Second operand 16 states. Received shutdown request... [2019-12-27 22:28:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:28:52,774 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 22:28:52,778 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 22:28:52,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:28:52 BasicIcfg [2019-12-27 22:28:52,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:28:52,780 INFO L168 Benchmark]: Toolchain (without parser) took 194429.05 ms. Allocated memory was 138.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 102.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,781 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.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 22:28:52,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.24 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.24 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,782 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,783 INFO L168 Benchmark]: RCFGBuilder took 802.80 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 105.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,783 INFO L168 Benchmark]: TraceAbstraction took 192666.94 ms. Allocated memory was 202.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 104.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:52,786 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.24 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.24 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.63 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.80 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 105.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192666.94 ms. Allocated memory was 202.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 104.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 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 (11742states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (427 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 (11742states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (427 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 55.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3548 SDtfs, 5982 SDslu, 9065 SDs, 0 SdLazy, 6651 SolverSat, 409 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 97 SyntacticMatches, 56 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156231occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 112.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 298089 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 694 ConstructedInterpolants, 0 QuantifiedInterpolants, 108593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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