/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/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:17:06,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:17:06,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:17:06,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:17:06,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:17:06,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:17:06,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:17:06,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:17:06,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:17:06,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:17:06,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:17:06,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:17:06,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:17:06,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:17:06,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:17:06,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:17:06,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:17:06,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:17:06,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:17:06,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:17:06,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:17:06,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:17:06,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:17:06,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:17:06,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:17:06,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:17:06,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:17:06,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:17:06,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:17:06,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:17:06,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:17:06,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:17:06,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:17:06,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:17:06,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:17:06,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:17:06,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:17:06,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:17:06,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:17:06,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:17:06,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:17:06,240 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:17:06,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:17:06,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:17:06,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:17:06,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:17:06,258 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:17:06,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:17:06,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:17:06,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:17:06,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:17:06,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:17:06,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:17:06,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:17:06,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:17:06,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:17:06,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:17:06,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:17:06,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:17:06,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:17:06,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:17:06,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:17:06,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:17:06,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:17:06,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:17:06,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:17:06,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:17:06,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:17:06,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:17:06,264 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:17:06,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:17:06,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:17:06,266 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:17:06,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:17:06,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:17:06,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:17:06,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:17:06,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:17:06,572 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:17:06,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-27 22:17:06,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767274ede/6b5991ecf617419ca1d6ad471421b574/FLAG0ac2fb6b7 [2019-12-27 22:17:07,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:17:07,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-27 22:17:07,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767274ede/6b5991ecf617419ca1d6ad471421b574/FLAG0ac2fb6b7 [2019-12-27 22:17:07,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767274ede/6b5991ecf617419ca1d6ad471421b574 [2019-12-27 22:17:07,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:17:07,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:17:07,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:17:07,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:17:07,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:17:07,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:17:07" (1/1) ... [2019-12-27 22:17:07,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e7580e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:07, skipping insertion in model container [2019-12-27 22:17:07,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:17:07" (1/1) ... [2019-12-27 22:17:07,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:17:07,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:17:08,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:17:08,143 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:17:08,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:17:08,361 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:17:08,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08 WrapperNode [2019-12-27 22:17:08,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:17:08,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:17:08,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:17:08,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:17:08,374 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:17:08" (1/1) ... [2019-12-27 22:17:08,417 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:17:08" (1/1) ... [2019-12-27 22:17:08,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:17:08,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:17:08,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:17:08,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:17:08,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (1/1) ... [2019-12-27 22:17:08,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:17:08,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:17:08,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:17:08,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:17:08,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (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:17:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:17:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:17:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:17:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:17:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:17:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:17:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:17:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:17:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:17:08,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:17:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:17:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:17:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:17:08,580 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:17:09,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:17:09,323 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:17:09,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:17:09 BoogieIcfgContainer [2019-12-27 22:17:09,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:17:09,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:17:09,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:17:09,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:17:09,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:17:07" (1/3) ... [2019-12-27 22:17:09,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0c8f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:17:09, skipping insertion in model container [2019-12-27 22:17:09,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:17:08" (2/3) ... [2019-12-27 22:17:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0c8f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:17:09, skipping insertion in model container [2019-12-27 22:17:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:17:09" (3/3) ... [2019-12-27 22:17:09,333 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2019-12-27 22:17:09,343 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:17:09,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:17:09,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:17:09,353 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:17:09,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,394 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,464 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,465 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:17:09,489 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:17:09,505 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:17:09,505 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:17:09,505 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:17:09,505 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:17:09,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:17:09,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:17:09,506 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:17:09,506 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:17:09,523 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:17:09,525 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:17:09,631 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:17:09,631 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:17:09,649 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 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:17:09,670 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:17:09,758 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:17:09,758 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:17:09,769 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 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:17:09,792 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:17:09,793 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:17:13,455 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:17:13,591 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:17:13,685 INFO L206 etLargeBlockEncoding]: Checked pairs total: 69182 [2019-12-27 22:17:13,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 22:17:13,689 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 22:17:26,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 22:17:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 22:17:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:17:26,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:26,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:17:26,238 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:17:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash 794638691, now seen corresponding path program 1 times [2019-12-27 22:17:26,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:26,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751389871] [2019-12-27 22:17:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:26,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751389871] [2019-12-27 22:17:26,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:26,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:17:26,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784136122] [2019-12-27 22:17:26,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:26,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:26,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:17:26,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:26,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:26,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:26,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:26,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:26,488 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 22:17:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:28,972 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 22:17:28,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:28,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:17:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:29,582 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 22:17:29,582 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 22:17:29,584 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:17:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 22:17:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 22:17:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 22:17:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 22:17:40,276 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 22:17:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:40,277 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 22:17:40,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 22:17:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:40,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:40,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:40,288 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:17:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2064286334, now seen corresponding path program 1 times [2019-12-27 22:17:40,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:40,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70057985] [2019-12-27 22:17:40,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:40,428 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:17:40,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70057985] [2019-12-27 22:17:40,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:40,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:40,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [223176409] [2019-12-27 22:17:40,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:40,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:40,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:40,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:40,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:40,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:17:40,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:17:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:17:40,438 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 22:17:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:45,026 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 22:17:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:45,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:17:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:45,867 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 22:17:45,867 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 22:17:45,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 22:17:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 22:17:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 22:17:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 22:17:52,796 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 22:17:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:52,797 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 22:17:52,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:17:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 22:17:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:52,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:52,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:52,801 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:17:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1769810709, now seen corresponding path program 1 times [2019-12-27 22:17:52,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:52,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494322104] [2019-12-27 22:17:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:52,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494322104] [2019-12-27 22:17:52,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:52,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:52,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718098891] [2019-12-27 22:17:52,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:52,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:52,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:52,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:52,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:52,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:17:52,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:17:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:17:52,938 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 22:17:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:57,314 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-27 22:17:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:57,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:17:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:57,798 INFO L225 Difference]: With dead ends: 161841 [2019-12-27 22:17:57,798 INFO L226 Difference]: Without dead ends: 161729 [2019-12-27 22:17:57,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-27 22:18:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-27 22:18:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-27 22:18:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-27 22:18:06,873 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-27 22:18:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:06,873 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-27 22:18:06,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:18:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-27 22:18:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:18:06,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:06,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:06,879 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:18:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash 37773354, now seen corresponding path program 1 times [2019-12-27 22:18:06,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:06,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114576702] [2019-12-27 22:18:06,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:06,925 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:18:06,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114576702] [2019-12-27 22:18:06,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:06,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:18:06,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99840294] [2019-12-27 22:18:06,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:06,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:06,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:18:06,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:07,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:18:07,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:07,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:07,004 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 5 states. [2019-12-27 22:18:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:13,914 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-27 22:18:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:18:13,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:18:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:14,462 INFO L225 Difference]: With dead ends: 181948 [2019-12-27 22:18:14,462 INFO L226 Difference]: Without dead ends: 181948 [2019-12-27 22:18:14,463 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:18:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-27 22:18:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-27 22:18:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-27 22:18:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-27 22:18:21,896 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-27 22:18:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:21,897 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-27 22:18:21,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-27 22:18:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:18:21,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:21,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:21,901 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:18:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 37638690, now seen corresponding path program 1 times [2019-12-27 22:18:21,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:21,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40301131] [2019-12-27 22:18:21,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:21,984 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:18:21,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40301131] [2019-12-27 22:18:21,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:21,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:18:21,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411213885] [2019-12-27 22:18:21,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:21,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:21,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:18:21,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:22,007 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:18:22,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:22,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:22,009 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 5 states. [2019-12-27 22:18:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:24,204 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-27 22:18:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:18:24,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:18:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:24,716 INFO L225 Difference]: With dead ends: 176806 [2019-12-27 22:18:24,716 INFO L226 Difference]: Without dead ends: 176726 [2019-12-27 22:18:24,717 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:18:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-27 22:18:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-27 22:18:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-27 22:18:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-27 22:18:38,474 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-27 22:18:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:38,474 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-27 22:18:38,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-27 22:18:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:18:38,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:38,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:38,478 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:18:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 197780815, now seen corresponding path program 1 times [2019-12-27 22:18:38,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:38,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443230062] [2019-12-27 22:18:38,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:38,527 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:18:38,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443230062] [2019-12-27 22:18:38,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:38,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:18:38,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677732972] [2019-12-27 22:18:38,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:38,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:38,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:18:38,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:38,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:18:38,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:38,551 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 5 states. [2019-12-27 22:18:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:45,682 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-27 22:18:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:18:45,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:18:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:46,287 INFO L225 Difference]: With dead ends: 181899 [2019-12-27 22:18:46,287 INFO L226 Difference]: Without dead ends: 181811 [2019-12-27 22:18:46,288 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:18:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-27 22:18:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-27 22:18:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-27 22:18:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-27 22:18:53,903 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-27 22:18:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:53,904 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-27 22:18:53,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-27 22:18:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:18:53,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:53,927 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:18:53,928 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:18:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash -538416332, now seen corresponding path program 1 times [2019-12-27 22:18:53,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:53,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476176219] [2019-12-27 22:18:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:18:53,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476176219] [2019-12-27 22:18:53,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:53,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:18:53,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424087659] [2019-12-27 22:18:53,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:53,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:53,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:18:53,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:53,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:18:53,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:18:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:18:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:18:53,988 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-27 22:18:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:55,957 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-27 22:18:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:18:55,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:18:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:56,437 INFO L225 Difference]: With dead ends: 155313 [2019-12-27 22:18:56,438 INFO L226 Difference]: Without dead ends: 155313 [2019-12-27 22:18:56,438 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:19:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-27 22:19:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-27 22:19:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-27 22:19:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-27 22:19:10,452 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-27 22:19:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:10,452 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-27 22:19:10,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:19:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-27 22:19:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:19:10,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:10,472 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:19:10,472 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:19:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash -919407984, now seen corresponding path program 1 times [2019-12-27 22:19:10,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:10,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017342888] [2019-12-27 22:19:10,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:10,527 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:19:10,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017342888] [2019-12-27 22:19:10,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:10,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:10,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973672637] [2019-12-27 22:19:10,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:10,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:10,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 22:19:10,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:10,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:19:10,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:10,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:10,555 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 5 states. [2019-12-27 22:19:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:20,263 INFO L93 Difference]: Finished difference Result 370574 states and 1539692 transitions. [2019-12-27 22:19:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:20,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:19:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:21,070 INFO L225 Difference]: With dead ends: 370574 [2019-12-27 22:19:21,070 INFO L226 Difference]: Without dead ends: 248122 [2019-12-27 22:19:21,070 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:19:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248122 states. [2019-12-27 22:19:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248122 to 165407. [2019-12-27 22:19:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165407 states. [2019-12-27 22:19:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165407 states to 165407 states and 677577 transitions. [2019-12-27 22:19:30,731 INFO L78 Accepts]: Start accepts. Automaton has 165407 states and 677577 transitions. Word has length 19 [2019-12-27 22:19:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:30,732 INFO L462 AbstractCegarLoop]: Abstraction has 165407 states and 677577 transitions. [2019-12-27 22:19:30,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 165407 states and 677577 transitions. [2019-12-27 22:19:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:19:30,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:30,751 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:19:30,752 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:19:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash -112975457, now seen corresponding path program 1 times [2019-12-27 22:19:30,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:30,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631150074] [2019-12-27 22:19:30,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:30,825 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:19:30,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631150074] [2019-12-27 22:19:30,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:30,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598172251] [2019-12-27 22:19:30,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:30,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:30,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:19:30,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:30,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:19:30,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:30,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:30,869 INFO L87 Difference]: Start difference. First operand 165407 states and 677577 transitions. Second operand 5 states. [2019-12-27 22:19:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:35,782 INFO L93 Difference]: Finished difference Result 50857 states and 174233 transitions. [2019-12-27 22:19:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:35,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:19:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:35,862 INFO L225 Difference]: With dead ends: 50857 [2019-12-27 22:19:35,862 INFO L226 Difference]: Without dead ends: 40119 [2019-12-27 22:19:35,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 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:19:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40119 states. [2019-12-27 22:19:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40119 to 37087. [2019-12-27 22:19:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37087 states. [2019-12-27 22:19:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37087 states to 37087 states and 122652 transitions. [2019-12-27 22:19:36,533 INFO L78 Accepts]: Start accepts. Automaton has 37087 states and 122652 transitions. Word has length 19 [2019-12-27 22:19:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:36,533 INFO L462 AbstractCegarLoop]: Abstraction has 37087 states and 122652 transitions. [2019-12-27 22:19:36,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 37087 states and 122652 transitions. [2019-12-27 22:19:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:19:36,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:36,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:36,543 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:19:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash -299881963, now seen corresponding path program 1 times [2019-12-27 22:19:36,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:36,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33171509] [2019-12-27 22:19:36,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:36,606 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:19:36,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33171509] [2019-12-27 22:19:36,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:36,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:36,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947454676] [2019-12-27 22:19:36,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:36,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:36,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 22:19:36,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:36,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:19:36,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:36,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:36,628 INFO L87 Difference]: Start difference. First operand 37087 states and 122652 transitions. Second operand 5 states. [2019-12-27 22:19:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:37,230 INFO L93 Difference]: Finished difference Result 49987 states and 162271 transitions. [2019-12-27 22:19:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:19:37,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 22:19:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:37,329 INFO L225 Difference]: With dead ends: 49987 [2019-12-27 22:19:37,330 INFO L226 Difference]: Without dead ends: 49685 [2019-12-27 22:19:37,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49685 states. [2019-12-27 22:19:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49685 to 37766. [2019-12-27 22:19:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37766 states. [2019-12-27 22:19:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37766 states to 37766 states and 124837 transitions. [2019-12-27 22:19:38,431 INFO L78 Accepts]: Start accepts. Automaton has 37766 states and 124837 transitions. Word has length 22 [2019-12-27 22:19:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:38,431 INFO L462 AbstractCegarLoop]: Abstraction has 37766 states and 124837 transitions. [2019-12-27 22:19:38,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37766 states and 124837 transitions. [2019-12-27 22:19:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:19:38,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:38,439 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:19:38,439 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:19:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -863346088, now seen corresponding path program 1 times [2019-12-27 22:19:38,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:38,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050150515] [2019-12-27 22:19:38,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:38,523 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:19:38,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050150515] [2019-12-27 22:19:38,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:38,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:38,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481775955] [2019-12-27 22:19:38,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:38,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:38,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 22:19:38,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:38,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:38,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:38,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:38,598 INFO L87 Difference]: Start difference. First operand 37766 states and 124837 transitions. Second operand 6 states. [2019-12-27 22:19:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:39,579 INFO L93 Difference]: Finished difference Result 73921 states and 242243 transitions. [2019-12-27 22:19:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:19:39,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:19:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:39,715 INFO L225 Difference]: With dead ends: 73921 [2019-12-27 22:19:39,715 INFO L226 Difference]: Without dead ends: 73521 [2019-12-27 22:19:39,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:19:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73521 states. [2019-12-27 22:19:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73521 to 35630. [2019-12-27 22:19:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35630 states. [2019-12-27 22:19:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35630 states to 35630 states and 117569 transitions. [2019-12-27 22:19:40,947 INFO L78 Accepts]: Start accepts. Automaton has 35630 states and 117569 transitions. Word has length 22 [2019-12-27 22:19:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:40,948 INFO L462 AbstractCegarLoop]: Abstraction has 35630 states and 117569 transitions. [2019-12-27 22:19:40,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35630 states and 117569 transitions. [2019-12-27 22:19:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:19:40,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:40,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:40,960 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:19:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2029037298, now seen corresponding path program 1 times [2019-12-27 22:19:40,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:40,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663188565] [2019-12-27 22:19:40,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:41,038 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:19:41,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663188565] [2019-12-27 22:19:41,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:41,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:41,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1246447748] [2019-12-27 22:19:41,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:41,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:41,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:19:41,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:41,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:19:41,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:41,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:41,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:41,050 INFO L87 Difference]: Start difference. First operand 35630 states and 117569 transitions. Second operand 5 states. [2019-12-27 22:19:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:41,680 INFO L93 Difference]: Finished difference Result 49203 states and 158838 transitions. [2019-12-27 22:19:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:41,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:19:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:41,768 INFO L225 Difference]: With dead ends: 49203 [2019-12-27 22:19:41,768 INFO L226 Difference]: Without dead ends: 48783 [2019-12-27 22:19:41,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48783 states. [2019-12-27 22:19:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48783 to 39538. [2019-12-27 22:19:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39538 states. [2019-12-27 22:19:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39538 states to 39538 states and 129730 transitions. [2019-12-27 22:19:42,766 INFO L78 Accepts]: Start accepts. Automaton has 39538 states and 129730 transitions. Word has length 25 [2019-12-27 22:19:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:42,767 INFO L462 AbstractCegarLoop]: Abstraction has 39538 states and 129730 transitions. [2019-12-27 22:19:42,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 39538 states and 129730 transitions. [2019-12-27 22:19:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:19:42,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:42,785 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:19:42,785 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:19:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2090157818, now seen corresponding path program 1 times [2019-12-27 22:19:42,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:42,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319740627] [2019-12-27 22:19:42,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:42,848 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:19:42,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319740627] [2019-12-27 22:19:42,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:42,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:42,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609456414] [2019-12-27 22:19:42,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:42,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:42,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:19:42,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:42,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:42,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:42,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:42,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:42,917 INFO L87 Difference]: Start difference. First operand 39538 states and 129730 transitions. Second operand 7 states. [2019-12-27 22:19:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:43,417 INFO L93 Difference]: Finished difference Result 50004 states and 162444 transitions. [2019-12-27 22:19:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:43,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 22:19:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:43,522 INFO L225 Difference]: With dead ends: 50004 [2019-12-27 22:19:43,523 INFO L226 Difference]: Without dead ends: 49630 [2019-12-27 22:19:43,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49630 states. [2019-12-27 22:19:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49630 to 41317. [2019-12-27 22:19:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41317 states. [2019-12-27 22:19:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41317 states to 41317 states and 135542 transitions. [2019-12-27 22:19:44,287 INFO L78 Accepts]: Start accepts. Automaton has 41317 states and 135542 transitions. Word has length 28 [2019-12-27 22:19:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:44,287 INFO L462 AbstractCegarLoop]: Abstraction has 41317 states and 135542 transitions. [2019-12-27 22:19:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 41317 states and 135542 transitions. [2019-12-27 22:19:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:19:44,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:44,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:44,495 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:19:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash -893146615, now seen corresponding path program 1 times [2019-12-27 22:19:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:44,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345736340] [2019-12-27 22:19:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:44,528 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:19:44,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345736340] [2019-12-27 22:19:44,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:44,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:44,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031779253] [2019-12-27 22:19:44,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:44,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:44,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:19:44,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:44,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:19:44,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:44,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:44,635 INFO L87 Difference]: Start difference. First operand 41317 states and 135542 transitions. Second operand 7 states. [2019-12-27 22:19:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:44,888 INFO L93 Difference]: Finished difference Result 53099 states and 172547 transitions. [2019-12-27 22:19:44,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:44,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 22:19:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:44,975 INFO L225 Difference]: With dead ends: 53099 [2019-12-27 22:19:44,975 INFO L226 Difference]: Without dead ends: 53099 [2019-12-27 22:19:44,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53099 states. [2019-12-27 22:19:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53099 to 42877. [2019-12-27 22:19:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42877 states. [2019-12-27 22:19:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42877 states to 42877 states and 138134 transitions. [2019-12-27 22:19:45,749 INFO L78 Accepts]: Start accepts. Automaton has 42877 states and 138134 transitions. Word has length 28 [2019-12-27 22:19:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 42877 states and 138134 transitions. [2019-12-27 22:19:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 42877 states and 138134 transitions. [2019-12-27 22:19:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 22:19:45,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:45,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:45,768 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:19:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1145073619, now seen corresponding path program 1 times [2019-12-27 22:19:45,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:45,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026342039] [2019-12-27 22:19:45,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:45,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026342039] [2019-12-27 22:19:45,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:45,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:45,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610142907] [2019-12-27 22:19:45,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:45,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:45,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 22:19:45,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:45,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:45,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:45,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:45,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:45,913 INFO L87 Difference]: Start difference. First operand 42877 states and 138134 transitions. Second operand 7 states. [2019-12-27 22:19:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:46,656 INFO L93 Difference]: Finished difference Result 53252 states and 169937 transitions. [2019-12-27 22:19:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:46,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 22:19:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:46,759 INFO L225 Difference]: With dead ends: 53252 [2019-12-27 22:19:46,759 INFO L226 Difference]: Without dead ends: 52858 [2019-12-27 22:19:46,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52858 states. [2019-12-27 22:19:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52858 to 41876. [2019-12-27 22:19:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41876 states. [2019-12-27 22:19:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41876 states to 41876 states and 134705 transitions. [2019-12-27 22:19:47,528 INFO L78 Accepts]: Start accepts. Automaton has 41876 states and 134705 transitions. Word has length 29 [2019-12-27 22:19:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:47,528 INFO L462 AbstractCegarLoop]: Abstraction has 41876 states and 134705 transitions. [2019-12-27 22:19:47,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41876 states and 134705 transitions. [2019-12-27 22:19:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 22:19:47,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19: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] [2019-12-27 22:19:47,546 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:19:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1560097484, now seen corresponding path program 1 times [2019-12-27 22:19:47,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:47,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251731538] [2019-12-27 22:19:47,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:47,585 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:19:47,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251731538] [2019-12-27 22:19:47,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:47,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:47,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745472130] [2019-12-27 22:19:47,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:47,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:47,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 22:19:47,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:47,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:47,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:19:47,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:19:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:47,623 INFO L87 Difference]: Start difference. First operand 41876 states and 134705 transitions. Second operand 4 states. [2019-12-27 22:19:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:47,861 INFO L93 Difference]: Finished difference Result 65138 states and 211462 transitions. [2019-12-27 22:19:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:47,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 22:19:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:47,916 INFO L225 Difference]: With dead ends: 65138 [2019-12-27 22:19:47,916 INFO L226 Difference]: Without dead ends: 31472 [2019-12-27 22:19:47,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31472 states. [2019-12-27 22:19:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31472 to 30611. [2019-12-27 22:19:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30611 states. [2019-12-27 22:19:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30611 states to 30611 states and 97193 transitions. [2019-12-27 22:19:48,788 INFO L78 Accepts]: Start accepts. Automaton has 30611 states and 97193 transitions. Word has length 29 [2019-12-27 22:19:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:48,789 INFO L462 AbstractCegarLoop]: Abstraction has 30611 states and 97193 transitions. [2019-12-27 22:19:48,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:19:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30611 states and 97193 transitions. [2019-12-27 22:19:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:19:48,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:48,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:48,802 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:19:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2068336147, now seen corresponding path program 1 times [2019-12-27 22:19:48,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:48,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959313115] [2019-12-27 22:19:48,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:48,849 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:19:48,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959313115] [2019-12-27 22:19:48,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:48,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709137721] [2019-12-27 22:19:48,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:48,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:48,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 52 transitions. [2019-12-27 22:19:48,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:48,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:19:48,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:48,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:48,882 INFO L87 Difference]: Start difference. First operand 30611 states and 97193 transitions. Second operand 5 states. [2019-12-27 22:19:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:49,365 INFO L93 Difference]: Finished difference Result 68373 states and 223368 transitions. [2019-12-27 22:19:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:49,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 22:19:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:49,441 INFO L225 Difference]: With dead ends: 68373 [2019-12-27 22:19:49,442 INFO L226 Difference]: Without dead ends: 40821 [2019-12-27 22:19:49,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40821 states. [2019-12-27 22:19:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40821 to 23978. [2019-12-27 22:19:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23978 states. [2019-12-27 22:19:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23978 states to 23978 states and 78428 transitions. [2019-12-27 22:19:50,010 INFO L78 Accepts]: Start accepts. Automaton has 23978 states and 78428 transitions. Word has length 30 [2019-12-27 22:19:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:50,011 INFO L462 AbstractCegarLoop]: Abstraction has 23978 states and 78428 transitions. [2019-12-27 22:19:50,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23978 states and 78428 transitions. [2019-12-27 22:19:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:19:50,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:50,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:50,025 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:19:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1129404662, now seen corresponding path program 1 times [2019-12-27 22:19:50,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:50,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649006036] [2019-12-27 22:19:50,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:50,085 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:19:50,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649006036] [2019-12-27 22:19:50,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:50,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:19:50,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902091842] [2019-12-27 22:19:50,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:50,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:50,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 22:19:50,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:50,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:19:50,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:19:50,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:19:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:19:50,196 INFO L87 Difference]: Start difference. First operand 23978 states and 78428 transitions. Second operand 8 states. [2019-12-27 22:19:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:51,093 INFO L93 Difference]: Finished difference Result 38751 states and 124676 transitions. [2019-12-27 22:19:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:51,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 22:19:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:51,365 INFO L225 Difference]: With dead ends: 38751 [2019-12-27 22:19:51,365 INFO L226 Difference]: Without dead ends: 38751 [2019-12-27 22:19:51,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38751 states. [2019-12-27 22:19:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38751 to 31393. [2019-12-27 22:19:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31393 states. [2019-12-27 22:19:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31393 states to 31393 states and 101821 transitions. [2019-12-27 22:19:51,937 INFO L78 Accepts]: Start accepts. Automaton has 31393 states and 101821 transitions. Word has length 30 [2019-12-27 22:19:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:51,937 INFO L462 AbstractCegarLoop]: Abstraction has 31393 states and 101821 transitions. [2019-12-27 22:19:51,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:19:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 31393 states and 101821 transitions. [2019-12-27 22:19:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:19:51,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:51,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:51,959 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:19:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1533119952, now seen corresponding path program 1 times [2019-12-27 22:19:51,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:51,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113175802] [2019-12-27 22:19:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:52,037 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:19:52,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113175802] [2019-12-27 22:19:52,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:52,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:52,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291844268] [2019-12-27 22:19:52,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:52,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:52,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 22:19:52,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:52,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:19:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:52,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:52,087 INFO L87 Difference]: Start difference. First operand 31393 states and 101821 transitions. Second operand 6 states. [2019-12-27 22:19:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:52,209 INFO L93 Difference]: Finished difference Result 14683 states and 43981 transitions. [2019-12-27 22:19:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:52,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:19:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:52,232 INFO L225 Difference]: With dead ends: 14683 [2019-12-27 22:19:52,232 INFO L226 Difference]: Without dead ends: 12336 [2019-12-27 22:19:52,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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:19:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2019-12-27 22:19:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 12139. [2019-12-27 22:19:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12139 states. [2019-12-27 22:19:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12139 states to 12139 states and 36048 transitions. [2019-12-27 22:19:52,442 INFO L78 Accepts]: Start accepts. Automaton has 12139 states and 36048 transitions. Word has length 31 [2019-12-27 22:19:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:52,442 INFO L462 AbstractCegarLoop]: Abstraction has 12139 states and 36048 transitions. [2019-12-27 22:19:52,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 12139 states and 36048 transitions. [2019-12-27 22:19:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:52,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:52,454 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:19:52,454 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:19:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -210063419, now seen corresponding path program 1 times [2019-12-27 22:19:52,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:52,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042602158] [2019-12-27 22:19:52,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:52,529 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:19:52,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042602158] [2019-12-27 22:19:52,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:52,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:52,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009827639] [2019-12-27 22:19:52,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:52,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:52,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 22:19:52,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:52,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:52,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:52,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:52,618 INFO L87 Difference]: Start difference. First operand 12139 states and 36048 transitions. Second operand 6 states. [2019-12-27 22:19:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:52,918 INFO L93 Difference]: Finished difference Result 12265 states and 36282 transitions. [2019-12-27 22:19:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:52,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 22:19:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:52,943 INFO L225 Difference]: With dead ends: 12265 [2019-12-27 22:19:52,943 INFO L226 Difference]: Without dead ends: 12038 [2019-12-27 22:19:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2019-12-27 22:19:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 12038. [2019-12-27 22:19:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12038 states. [2019-12-27 22:19:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12038 states to 12038 states and 35837 transitions. [2019-12-27 22:19:53,199 INFO L78 Accepts]: Start accepts. Automaton has 12038 states and 35837 transitions. Word has length 40 [2019-12-27 22:19:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:53,199 INFO L462 AbstractCegarLoop]: Abstraction has 12038 states and 35837 transitions. [2019-12-27 22:19:53,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12038 states and 35837 transitions. [2019-12-27 22:19:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:53,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:53,217 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:19:53,217 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:19:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1917096257, now seen corresponding path program 1 times [2019-12-27 22:19:53,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:53,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250111679] [2019-12-27 22:19:53,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:53,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:19:53,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250111679] [2019-12-27 22:19:53,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:53,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:53,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734208972] [2019-12-27 22:19:53,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:53,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:53,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 22:19:53,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:53,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:53,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:19:53,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:19:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:53,352 INFO L87 Difference]: Start difference. First operand 12038 states and 35837 transitions. Second operand 4 states. [2019-12-27 22:19:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:53,744 INFO L93 Difference]: Finished difference Result 15244 states and 44262 transitions. [2019-12-27 22:19:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:53,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:19:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:53,767 INFO L225 Difference]: With dead ends: 15244 [2019-12-27 22:19:53,767 INFO L226 Difference]: Without dead ends: 15244 [2019-12-27 22:19:53,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15244 states. [2019-12-27 22:19:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15244 to 11302. [2019-12-27 22:19:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11302 states. [2019-12-27 22:19:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11302 states to 11302 states and 33044 transitions. [2019-12-27 22:19:53,945 INFO L78 Accepts]: Start accepts. Automaton has 11302 states and 33044 transitions. Word has length 40 [2019-12-27 22:19:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:53,945 INFO L462 AbstractCegarLoop]: Abstraction has 11302 states and 33044 transitions. [2019-12-27 22:19:53,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:19:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 11302 states and 33044 transitions. [2019-12-27 22:19:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:19:53,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:53,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:53,956 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:19:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1341792848, now seen corresponding path program 1 times [2019-12-27 22:19:53,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:53,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728917276] [2019-12-27 22:19:53,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:54,113 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:19:54,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728917276] [2019-12-27 22:19:54,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:54,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:54,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536578412] [2019-12-27 22:19:54,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:54,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:54,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 161 transitions. [2019-12-27 22:19:54,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:54,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:19:54,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:54,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:54,316 INFO L87 Difference]: Start difference. First operand 11302 states and 33044 transitions. Second operand 7 states. [2019-12-27 22:19:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:55,127 INFO L93 Difference]: Finished difference Result 19218 states and 55602 transitions. [2019-12-27 22:19:55,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:19:55,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 22:19:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:55,156 INFO L225 Difference]: With dead ends: 19218 [2019-12-27 22:19:55,156 INFO L226 Difference]: Without dead ends: 18877 [2019-12-27 22:19:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:19:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2019-12-27 22:19:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 11330. [2019-12-27 22:19:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11330 states. [2019-12-27 22:19:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11330 states to 11330 states and 33334 transitions. [2019-12-27 22:19:55,363 INFO L78 Accepts]: Start accepts. Automaton has 11330 states and 33334 transitions. Word has length 41 [2019-12-27 22:19:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:55,364 INFO L462 AbstractCegarLoop]: Abstraction has 11330 states and 33334 transitions. [2019-12-27 22:19:55,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11330 states and 33334 transitions. [2019-12-27 22:19:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:19:55,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:55,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:55,375 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:19:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1227192015, now seen corresponding path program 1 times [2019-12-27 22:19:55,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:55,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561688101] [2019-12-27 22:19:55,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:55,421 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:19:55,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561688101] [2019-12-27 22:19:55,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:55,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:55,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357809389] [2019-12-27 22:19:55,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:55,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:55,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 149 transitions. [2019-12-27 22:19:55,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:55,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:19:55,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:19:55,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:19:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:19:55,470 INFO L87 Difference]: Start difference. First operand 11330 states and 33334 transitions. Second operand 3 states. [2019-12-27 22:19:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:55,523 INFO L93 Difference]: Finished difference Result 11249 states and 33055 transitions. [2019-12-27 22:19:55,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:55,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 22:19:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:55,542 INFO L225 Difference]: With dead ends: 11249 [2019-12-27 22:19:55,542 INFO L226 Difference]: Without dead ends: 11249 [2019-12-27 22:19:55,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:19:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11249 states. [2019-12-27 22:19:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11249 to 9037. [2019-12-27 22:19:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9037 states. [2019-12-27 22:19:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9037 states to 9037 states and 26795 transitions. [2019-12-27 22:19:55,764 INFO L78 Accepts]: Start accepts. Automaton has 9037 states and 26795 transitions. Word has length 41 [2019-12-27 22:19:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:55,765 INFO L462 AbstractCegarLoop]: Abstraction has 9037 states and 26795 transitions. [2019-12-27 22:19:55,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:19:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9037 states and 26795 transitions. [2019-12-27 22:19:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:19:55,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:55,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:55,777 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1573172907, now seen corresponding path program 1 times [2019-12-27 22:19:55,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:55,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325725680] [2019-12-27 22:19:55,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:55,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325725680] [2019-12-27 22:19:55,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:55,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:19:55,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1310144816] [2019-12-27 22:19:55,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:55,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:55,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 152 transitions. [2019-12-27 22:19:55,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:55,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:55,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:55,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:55,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:55,933 INFO L87 Difference]: Start difference. First operand 9037 states and 26795 transitions. Second operand 6 states. [2019-12-27 22:19:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:56,024 INFO L93 Difference]: Finished difference Result 8009 states and 24347 transitions. [2019-12-27 22:19:56,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:56,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 22:19:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:56,037 INFO L225 Difference]: With dead ends: 8009 [2019-12-27 22:19:56,037 INFO L226 Difference]: Without dead ends: 7901 [2019-12-27 22:19:56,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2019-12-27 22:19:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 7607. [2019-12-27 22:19:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7607 states. [2019-12-27 22:19:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 23309 transitions. [2019-12-27 22:19:56,150 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 23309 transitions. Word has length 42 [2019-12-27 22:19:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:56,150 INFO L462 AbstractCegarLoop]: Abstraction has 7607 states and 23309 transitions. [2019-12-27 22:19:56,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 23309 transitions. [2019-12-27 22:19:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:56,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:56,158 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:19:56,158 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash 612223072, now seen corresponding path program 1 times [2019-12-27 22:19:56,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:56,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763778946] [2019-12-27 22:19:56,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:56,270 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:19:56,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763778946] [2019-12-27 22:19:56,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:56,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:19:56,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317721518] [2019-12-27 22:19:56,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:56,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:56,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 359 transitions. [2019-12-27 22:19:56,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:56,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:19:56,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:19:56,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:19:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:19:56,569 INFO L87 Difference]: Start difference. First operand 7607 states and 23309 transitions. Second operand 11 states. [2019-12-27 22:19:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:57,870 INFO L93 Difference]: Finished difference Result 14574 states and 43805 transitions. [2019-12-27 22:19:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:19:57,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 22:19:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:57,887 INFO L225 Difference]: With dead ends: 14574 [2019-12-27 22:19:57,887 INFO L226 Difference]: Without dead ends: 9583 [2019-12-27 22:19:57,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:19:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9583 states. [2019-12-27 22:19:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9583 to 9005. [2019-12-27 22:19:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-12-27 22:19:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 26972 transitions. [2019-12-27 22:19:58,023 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 26972 transitions. Word has length 56 [2019-12-27 22:19:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:58,024 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 26972 transitions. [2019-12-27 22:19:58,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:19:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 26972 transitions. [2019-12-27 22:19:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:58,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:58,036 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:19:58,036 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1401618532, now seen corresponding path program 2 times [2019-12-27 22:19:58,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:58,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447668534] [2019-12-27 22:19:58,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:58,191 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:19:58,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447668534] [2019-12-27 22:19:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:19:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965725346] [2019-12-27 22:19:58,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:58,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:58,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 288 transitions. [2019-12-27 22:19:58,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:58,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:19:58,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:19:58,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:19:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:19:58,454 INFO L87 Difference]: Start difference. First operand 9005 states and 26972 transitions. Second operand 15 states. [2019-12-27 22:20:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:20:01,895 INFO L93 Difference]: Finished difference Result 19597 states and 57366 transitions. [2019-12-27 22:20:01,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 22:20:01,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:20:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:20:01,920 INFO L225 Difference]: With dead ends: 19597 [2019-12-27 22:20:01,920 INFO L226 Difference]: Without dead ends: 14849 [2019-12-27 22:20:01,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 22:20:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14849 states. [2019-12-27 22:20:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14849 to 9700. [2019-12-27 22:20:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9700 states. [2019-12-27 22:20:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9700 states to 9700 states and 28563 transitions. [2019-12-27 22:20:02,133 INFO L78 Accepts]: Start accepts. Automaton has 9700 states and 28563 transitions. Word has length 56 [2019-12-27 22:20:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:20:02,133 INFO L462 AbstractCegarLoop]: Abstraction has 9700 states and 28563 transitions. [2019-12-27 22:20:02,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:20:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9700 states and 28563 transitions. [2019-12-27 22:20:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:20:02,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:02,148 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:20:02,148 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1328827784, now seen corresponding path program 3 times [2019-12-27 22:20:02,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:02,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748077167] [2019-12-27 22:20:02,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:02,627 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:20:02,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748077167] [2019-12-27 22:20:02,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:02,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:20:02,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947717164] [2019-12-27 22:20:02,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:02,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:02,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 359 transitions. [2019-12-27 22:20:02,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:20:03,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 22:20:03,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 22:20:03,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 22:20:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-12-27 22:20:03,716 INFO L87 Difference]: Start difference. First operand 9700 states and 28563 transitions. Second operand 29 states. [2019-12-27 22:20:05,012 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-12-27 22:20:05,410 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-12-27 22:20:06,151 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 22:20:07,671 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-12-27 22:20:09,535 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 22:20:09,745 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-12-27 22:20:11,210 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 22:20:11,794 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 22:20:13,704 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-27 22:20:14,183 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-12-27 22:20:14,490 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-27 22:20:15,246 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-27 22:20:16,742 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 22:20:17,139 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-27 22:20:17,540 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-12-27 22:20:18,666 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-27 22:20:19,011 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-27 22:20:19,865 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 22:20:21,581 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-27 22:20:24,767 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-12-27 22:20:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:20:25,731 INFO L93 Difference]: Finished difference Result 36957 states and 108523 transitions. [2019-12-27 22:20:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-12-27 22:20:25,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-12-27 22:20:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:20:25,770 INFO L225 Difference]: With dead ends: 36957 [2019-12-27 22:20:25,770 INFO L226 Difference]: Without dead ends: 27076 [2019-12-27 22:20:25,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9206 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3478, Invalid=22928, Unknown=0, NotChecked=0, Total=26406 [2019-12-27 22:20:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27076 states. [2019-12-27 22:20:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27076 to 12098. [2019-12-27 22:20:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12098 states. [2019-12-27 22:20:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 35819 transitions. [2019-12-27 22:20:26,158 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 35819 transitions. Word has length 56 [2019-12-27 22:20:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:20:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 12098 states and 35819 transitions. [2019-12-27 22:20:26,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 22:20:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 35819 transitions. [2019-12-27 22:20:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:20:26,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:26,174 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:20:26,174 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -365356066, now seen corresponding path program 4 times [2019-12-27 22:20:26,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:26,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965697471] [2019-12-27 22:20:26,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:26,421 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:20:26,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965697471] [2019-12-27 22:20:26,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:20:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563834103] [2019-12-27 22:20:26,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:26,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:26,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 294 transitions. [2019-12-27 22:20:26,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:26,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:20:26,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:20:26,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:26,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:20:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:20:26,904 INFO L87 Difference]: Start difference. First operand 12098 states and 35819 transitions. Second operand 19 states. Received shutdown request... [2019-12-27 22:20:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:20:27,680 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 22:20:27,686 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 22:20:27,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:20:27 BasicIcfg [2019-12-27 22:20:27,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:20:27,687 INFO L168 Benchmark]: Toolchain (without parser) took 200161.45 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 22:20:27,688 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:20:27,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.51 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:20:27,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.11 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 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:20:27,689 INFO L168 Benchmark]: Boogie Preprocessor took 70.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 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:20:27,690 INFO L168 Benchmark]: RCFGBuilder took 806.14 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 104.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:20:27,690 INFO L168 Benchmark]: TraceAbstraction took 198360.63 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 104.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 22:20:27,693 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.51 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.11 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.27 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.14 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 104.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198360.63 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 104.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 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, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 6606 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 69182 CheckedPairsTotal, 111 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 (12098states) and FLOYD_HOARE automaton (currently 15 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (188 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 (12098states) and FLOYD_HOARE automaton (currently 15 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (188 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 198.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 85.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4360 SDtfs, 7990 SDslu, 13119 SDs, 0 SdLazy, 16400 SolverSat, 588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165407occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 354507 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 121144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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