/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/mix003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:41:48,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:41:48,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:41:48,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:41:48,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:41:48,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:41:48,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:41:48,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:41:48,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:41:48,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:41:48,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:41:48,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:41:48,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:41:48,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:41:48,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:41:48,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:41:48,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:41:48,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:41:48,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:41:48,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:41:48,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:41:48,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:41:48,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:41:48,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:41:48,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:41:48,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:41:48,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:41:48,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:41:48,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:41:48,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:41:48,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:41:48,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:41:48,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:41:48,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:41:48,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:41:48,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:41:48,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:41:48,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:41:48,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:41:48,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:41:48,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:41:48,217 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 19:41:48,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:41:48,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:41:48,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:41:48,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:41:48,232 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:41:48,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:41:48,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:41:48,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:41:48,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:41:48,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:41:48,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:41:48,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:41:48,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:41:48,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:41:48,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:41:48,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:41:48,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:41:48,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:41:48,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:41:48,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:41:48,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:41:48,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:41:48,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:41:48,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:41:48,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:41:48,237 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:41:48,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:41:48,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:41:48,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:41:48,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:41:48,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:41:48,527 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:41:48,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 19:41:48,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62856c333/bf0d7c3d05bc428fa3057b1f3aa38b2b/FLAG629422d65 [2019-12-27 19:41:49,169 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:41:49,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.oepc.i [2019-12-27 19:41:49,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62856c333/bf0d7c3d05bc428fa3057b1f3aa38b2b/FLAG629422d65 [2019-12-27 19:41:49,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62856c333/bf0d7c3d05bc428fa3057b1f3aa38b2b [2019-12-27 19:41:49,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:41:49,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:41:49,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:41:49,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:41:49,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:41:49,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:41:49" (1/1) ... [2019-12-27 19:41:49,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36036b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:49, skipping insertion in model container [2019-12-27 19:41:49,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:41:49" (1/1) ... [2019-12-27 19:41:49,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:41:49,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:41:50,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:41:50,138 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:41:50,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:41:50,285 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:41:50,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50 WrapperNode [2019-12-27 19:41:50,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:41:50,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:41:50,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:41:50,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:41:50,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:41:50,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:41:50,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:41:50,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:41:50,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (1/1) ... [2019-12-27 19:41:50,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:41:50,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:41:50,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:41:50,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:41:50,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (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 19:41:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:41:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:41:50,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:41:50,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:41:50,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:41:50,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:41:50,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:41:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:41:50,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:41:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:41:50,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:41:50,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:41:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:41:50,477 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 19:41:51,389 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:41:51,389 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:41:51,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:41:51 BoogieIcfgContainer [2019-12-27 19:41:51,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:41:51,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:41:51,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:41:51,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:41:51,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:41:49" (1/3) ... [2019-12-27 19:41:51,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53332b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:41:51, skipping insertion in model container [2019-12-27 19:41:51,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:50" (2/3) ... [2019-12-27 19:41:51,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53332b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:41:51, skipping insertion in model container [2019-12-27 19:41:51,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:41:51" (3/3) ... [2019-12-27 19:41:51,400 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2019-12-27 19:41:51,410 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:41:51,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:41:51,418 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:41:51,419 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:41:51,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,512 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,575 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:51,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:41:51,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:41:51,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:41:51,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:41:51,616 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:41:51,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:41:51,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:41:51,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:41:51,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:41:51,637 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 19:41:51,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:41:51,754 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:41:51,754 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:41:51,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:41:51,797 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:41:51,858 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:41:51,858 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:41:51,866 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:41:51,887 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:41:51,888 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:41:55,360 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 19:41:55,518 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 19:41:55,547 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85139 [2019-12-27 19:41:55,547 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 19:41:55,551 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 19:42:14,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 19:42:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 19:42:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:42:14,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:14,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:42:14,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 19:42:14,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:14,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731627876] [2019-12-27 19:42:14,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:14,268 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 19:42:14,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731627876] [2019-12-27 19:42:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:14,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:42:14,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988348210] [2019-12-27 19:42:14,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:14,276 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:14,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:42:14,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:14,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:14,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:14,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:14,302 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 19:42:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:17,328 INFO L93 Difference]: Finished difference Result 114348 states and 491658 transitions. [2019-12-27 19:42:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:17,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:42:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:17,988 INFO L225 Difference]: With dead ends: 114348 [2019-12-27 19:42:17,988 INFO L226 Difference]: Without dead ends: 107250 [2019-12-27 19:42:17,989 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 19:42:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107250 states. [2019-12-27 19:42:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107250 to 107250. [2019-12-27 19:42:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107250 states. [2019-12-27 19:42:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107250 states to 107250 states and 460523 transitions. [2019-12-27 19:42:27,906 INFO L78 Accepts]: Start accepts. Automaton has 107250 states and 460523 transitions. Word has length 3 [2019-12-27 19:42:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:27,907 INFO L462 AbstractCegarLoop]: Abstraction has 107250 states and 460523 transitions. [2019-12-27 19:42:27,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 107250 states and 460523 transitions. [2019-12-27 19:42:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:42:27,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:27,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:27,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -906390211, now seen corresponding path program 1 times [2019-12-27 19:42:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:27,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251770904] [2019-12-27 19:42:27,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:28,027 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 19:42:28,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251770904] [2019-12-27 19:42:28,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:28,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:28,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274722088] [2019-12-27 19:42:28,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:28,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:28,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:42:28,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:28,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:28,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:28,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:28,036 INFO L87 Difference]: Start difference. First operand 107250 states and 460523 transitions. Second operand 4 states. [2019-12-27 19:42:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:33,316 INFO L93 Difference]: Finished difference Result 171260 states and 704759 transitions. [2019-12-27 19:42:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:33,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:42:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:34,114 INFO L225 Difference]: With dead ends: 171260 [2019-12-27 19:42:34,114 INFO L226 Difference]: Without dead ends: 171211 [2019-12-27 19:42:34,115 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 19:42:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171211 states. [2019-12-27 19:42:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171211 to 155734. [2019-12-27 19:42:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155734 states. [2019-12-27 19:42:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155734 states to 155734 states and 649769 transitions. [2019-12-27 19:42:43,828 INFO L78 Accepts]: Start accepts. Automaton has 155734 states and 649769 transitions. Word has length 11 [2019-12-27 19:42:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:43,829 INFO L462 AbstractCegarLoop]: Abstraction has 155734 states and 649769 transitions. [2019-12-27 19:42:43,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 155734 states and 649769 transitions. [2019-12-27 19:42:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:42:43,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:43,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:43,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1306732541, now seen corresponding path program 1 times [2019-12-27 19:42:43,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:43,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460511725] [2019-12-27 19:42:43,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:43,898 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 19:42:43,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460511725] [2019-12-27 19:42:43,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:43,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:43,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150648009] [2019-12-27 19:42:43,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:43,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:43,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:42:43,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:43,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:43,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:43,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:43,904 INFO L87 Difference]: Start difference. First operand 155734 states and 649769 transitions. Second operand 3 states. [2019-12-27 19:42:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:44,059 INFO L93 Difference]: Finished difference Result 34176 states and 112026 transitions. [2019-12-27 19:42:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:44,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:42:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:44,117 INFO L225 Difference]: With dead ends: 34176 [2019-12-27 19:42:44,117 INFO L226 Difference]: Without dead ends: 34176 [2019-12-27 19:42:44,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34176 states. [2019-12-27 19:42:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34176 to 34176. [2019-12-27 19:42:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34176 states. [2019-12-27 19:42:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34176 states to 34176 states and 112026 transitions. [2019-12-27 19:42:49,788 INFO L78 Accepts]: Start accepts. Automaton has 34176 states and 112026 transitions. Word has length 13 [2019-12-27 19:42:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:49,788 INFO L462 AbstractCegarLoop]: Abstraction has 34176 states and 112026 transitions. [2019-12-27 19:42:49,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 34176 states and 112026 transitions. [2019-12-27 19:42:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:49,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:49,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:49,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash 54051154, now seen corresponding path program 1 times [2019-12-27 19:42:49,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:49,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805736173] [2019-12-27 19:42:49,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:49,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805736173] [2019-12-27 19:42:49,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:49,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:49,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1193528953] [2019-12-27 19:42:49,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:49,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:49,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:49,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:49,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:49,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:49,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:49,890 INFO L87 Difference]: Start difference. First operand 34176 states and 112026 transitions. Second operand 4 states. [2019-12-27 19:42:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:50,246 INFO L93 Difference]: Finished difference Result 42178 states and 136956 transitions. [2019-12-27 19:42:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:50,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:42:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:50,317 INFO L225 Difference]: With dead ends: 42178 [2019-12-27 19:42:50,317 INFO L226 Difference]: Without dead ends: 42178 [2019-12-27 19:42:50,317 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 19:42:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42178 states. [2019-12-27 19:42:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42178 to 38132. [2019-12-27 19:42:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38132 states. [2019-12-27 19:42:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38132 states to 38132 states and 124449 transitions. [2019-12-27 19:42:51,044 INFO L78 Accepts]: Start accepts. Automaton has 38132 states and 124449 transitions. Word has length 16 [2019-12-27 19:42:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:51,046 INFO L462 AbstractCegarLoop]: Abstraction has 38132 states and 124449 transitions. [2019-12-27 19:42:51,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 38132 states and 124449 transitions. [2019-12-27 19:42:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:51,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:51,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:51,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:51,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:51,050 INFO L82 PathProgramCache]: Analyzing trace with hash 53948296, now seen corresponding path program 1 times [2019-12-27 19:42:51,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:51,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101801301] [2019-12-27 19:42:51,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:51,097 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 19:42:51,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101801301] [2019-12-27 19:42:51,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:51,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:51,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709294696] [2019-12-27 19:42:51,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:51,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:51,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:51,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:51,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:51,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:51,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:51,104 INFO L87 Difference]: Start difference. First operand 38132 states and 124449 transitions. Second operand 3 states. [2019-12-27 19:42:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:51,678 INFO L93 Difference]: Finished difference Result 55464 states and 180253 transitions. [2019-12-27 19:42:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:51,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 19:42:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:51,778 INFO L225 Difference]: With dead ends: 55464 [2019-12-27 19:42:51,778 INFO L226 Difference]: Without dead ends: 55464 [2019-12-27 19:42:51,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55464 states. [2019-12-27 19:42:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55464 to 42552. [2019-12-27 19:42:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42552 states. [2019-12-27 19:42:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 139903 transitions. [2019-12-27 19:42:52,584 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 139903 transitions. Word has length 16 [2019-12-27 19:42:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:52,584 INFO L462 AbstractCegarLoop]: Abstraction has 42552 states and 139903 transitions. [2019-12-27 19:42:52,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 139903 transitions. [2019-12-27 19:42:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:52,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:52,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:52,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1761611220, now seen corresponding path program 1 times [2019-12-27 19:42:52,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:52,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146121543] [2019-12-27 19:42:52,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:52,646 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 19:42:52,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146121543] [2019-12-27 19:42:52,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:52,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:52,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108799903] [2019-12-27 19:42:52,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:52,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:52,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:52,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:52,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:52,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:52,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:52,651 INFO L87 Difference]: Start difference. First operand 42552 states and 139903 transitions. Second operand 4 states. [2019-12-27 19:42:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:53,018 INFO L93 Difference]: Finished difference Result 50497 states and 164640 transitions. [2019-12-27 19:42:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:53,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:42:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:53,532 INFO L225 Difference]: With dead ends: 50497 [2019-12-27 19:42:53,533 INFO L226 Difference]: Without dead ends: 50497 [2019-12-27 19:42:53,533 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 19:42:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50497 states. [2019-12-27 19:42:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50497 to 44016. [2019-12-27 19:42:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2019-12-27 19:42:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 144770 transitions. [2019-12-27 19:42:54,274 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 144770 transitions. Word has length 16 [2019-12-27 19:42:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:54,275 INFO L462 AbstractCegarLoop]: Abstraction has 44016 states and 144770 transitions. [2019-12-27 19:42:54,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 144770 transitions. [2019-12-27 19:42:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:42:54,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:54,284 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 19:42:54,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1491539652, now seen corresponding path program 1 times [2019-12-27 19:42:54,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:54,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181741651] [2019-12-27 19:42:54,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:54,401 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 19:42:54,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181741651] [2019-12-27 19:42:54,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:54,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:54,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796303895] [2019-12-27 19:42:54,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:54,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:54,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:42:54,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:54,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:54,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:42:54,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:42:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:42:54,459 INFO L87 Difference]: Start difference. First operand 44016 states and 144770 transitions. Second operand 6 states. [2019-12-27 19:42:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:55,224 INFO L93 Difference]: Finished difference Result 60577 states and 194051 transitions. [2019-12-27 19:42:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:42:55,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:42:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:55,334 INFO L225 Difference]: With dead ends: 60577 [2019-12-27 19:42:55,334 INFO L226 Difference]: Without dead ends: 60570 [2019-12-27 19:42:55,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:42:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60570 states. [2019-12-27 19:42:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60570 to 45150. [2019-12-27 19:42:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-12-27 19:42:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 148226 transitions. [2019-12-27 19:42:56,465 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 148226 transitions. Word has length 22 [2019-12-27 19:42:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:56,466 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 148226 transitions. [2019-12-27 19:42:56,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:42:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 148226 transitions. [2019-12-27 19:42:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:42:56,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:56,475 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 19:42:56,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 987765270, now seen corresponding path program 1 times [2019-12-27 19:42:56,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:56,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721129111] [2019-12-27 19:42:56,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:56,596 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 19:42:56,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721129111] [2019-12-27 19:42:56,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:56,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:56,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945519967] [2019-12-27 19:42:56,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:56,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:56,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:42:56,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:56,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:56,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:42:56,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:42:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:42:56,622 INFO L87 Difference]: Start difference. First operand 45150 states and 148226 transitions. Second operand 6 states. [2019-12-27 19:42:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:57,553 INFO L93 Difference]: Finished difference Result 63824 states and 203774 transitions. [2019-12-27 19:42:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:42:57,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:42:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:57,717 INFO L225 Difference]: With dead ends: 63824 [2019-12-27 19:42:57,717 INFO L226 Difference]: Without dead ends: 63817 [2019-12-27 19:42:57,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:42:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63817 states. [2019-12-27 19:42:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63817 to 43599. [2019-12-27 19:42:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43599 states. [2019-12-27 19:42:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43599 states to 43599 states and 143212 transitions. [2019-12-27 19:42:58,965 INFO L78 Accepts]: Start accepts. Automaton has 43599 states and 143212 transitions. Word has length 22 [2019-12-27 19:42:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:58,966 INFO L462 AbstractCegarLoop]: Abstraction has 43599 states and 143212 transitions. [2019-12-27 19:42:58,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:42:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 43599 states and 143212 transitions. [2019-12-27 19:42:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:42:58,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:58,979 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 19:42:58,979 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1953235153, now seen corresponding path program 1 times [2019-12-27 19:42:58,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:58,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404730080] [2019-12-27 19:42:58,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:59,050 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 19:42:59,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404730080] [2019-12-27 19:42:59,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:59,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:59,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686287828] [2019-12-27 19:42:59,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:59,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:59,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:42:59,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:59,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:42:59,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:42:59,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:42:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:59,078 INFO L87 Difference]: Start difference. First operand 43599 states and 143212 transitions. Second operand 5 states. [2019-12-27 19:42:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:59,153 INFO L93 Difference]: Finished difference Result 17791 states and 55309 transitions. [2019-12-27 19:42:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:42:59,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:42:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:59,186 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 19:42:59,186 INFO L226 Difference]: Without dead ends: 17791 [2019-12-27 19:42:59,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17791 states. [2019-12-27 19:42:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17791 to 17428. [2019-12-27 19:42:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:42:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 54273 transitions. [2019-12-27 19:42:59,534 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 54273 transitions. Word has length 25 [2019-12-27 19:42:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:59,535 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 54273 transitions. [2019-12-27 19:42:59,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 54273 transitions. [2019-12-27 19:42:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:42:59,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:59,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:59,550 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 451000002, now seen corresponding path program 1 times [2019-12-27 19:42:59,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:59,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451849697] [2019-12-27 19:42:59,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:59,598 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 19:42:59,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451849697] [2019-12-27 19:42:59,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:59,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:59,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1917538171] [2019-12-27 19:42:59,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:59,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:59,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:42:59,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:59,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:59,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:59,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:59,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:59,611 INFO L87 Difference]: Start difference. First operand 17428 states and 54273 transitions. Second operand 3 states. [2019-12-27 19:42:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:59,772 INFO L93 Difference]: Finished difference Result 22857 states and 67585 transitions. [2019-12-27 19:42:59,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:59,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:42:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:59,823 INFO L225 Difference]: With dead ends: 22857 [2019-12-27 19:42:59,824 INFO L226 Difference]: Without dead ends: 22857 [2019-12-27 19:42:59,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-27 19:43:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 17428. [2019-12-27 19:43:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:43:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 51895 transitions. [2019-12-27 19:43:00,293 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 51895 transitions. Word has length 27 [2019-12-27 19:43:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:00,293 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 51895 transitions. [2019-12-27 19:43:00,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 51895 transitions. [2019-12-27 19:43:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:43:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:00,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:00,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash -319576223, now seen corresponding path program 1 times [2019-12-27 19:43:00,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:00,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133901860] [2019-12-27 19:43:00,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:00,389 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 19:43:00,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133901860] [2019-12-27 19:43:00,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:00,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:00,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415319465] [2019-12-27 19:43:00,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:00,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:00,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:43:00,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:00,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:00,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:00,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:00,401 INFO L87 Difference]: Start difference. First operand 17428 states and 51895 transitions. Second operand 5 states. [2019-12-27 19:43:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:00,841 INFO L93 Difference]: Finished difference Result 21434 states and 63020 transitions. [2019-12-27 19:43:00,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:43:00,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:43:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:00,877 INFO L225 Difference]: With dead ends: 21434 [2019-12-27 19:43:00,877 INFO L226 Difference]: Without dead ends: 21434 [2019-12-27 19:43:00,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-12-27 19:43:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20103. [2019-12-27 19:43:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2019-12-27 19:43:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 59665 transitions. [2019-12-27 19:43:01,328 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 59665 transitions. Word has length 27 [2019-12-27 19:43:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:01,328 INFO L462 AbstractCegarLoop]: Abstraction has 20103 states and 59665 transitions. [2019-12-27 19:43:01,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:43:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 59665 transitions. [2019-12-27 19:43:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 19:43:01,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:01,343 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 19:43:01,343 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -19850815, now seen corresponding path program 1 times [2019-12-27 19:43:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428560885] [2019-12-27 19:43:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:01,414 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 19:43:01,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428560885] [2019-12-27 19:43:01,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:01,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:01,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114298996] [2019-12-27 19:43:01,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:01,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:01,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 19:43:01,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:01,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:01,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:43:01,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:43:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:43:01,428 INFO L87 Difference]: Start difference. First operand 20103 states and 59665 transitions. Second operand 5 states. [2019-12-27 19:43:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:01,745 INFO L93 Difference]: Finished difference Result 23480 states and 68878 transitions. [2019-12-27 19:43:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:43:01,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 19:43:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:01,776 INFO L225 Difference]: With dead ends: 23480 [2019-12-27 19:43:01,776 INFO L226 Difference]: Without dead ends: 23480 [2019-12-27 19:43:01,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23480 states. [2019-12-27 19:43:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23480 to 20114. [2019-12-27 19:43:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20114 states. [2019-12-27 19:43:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20114 states to 20114 states and 59552 transitions. [2019-12-27 19:43:02,075 INFO L78 Accepts]: Start accepts. Automaton has 20114 states and 59552 transitions. Word has length 28 [2019-12-27 19:43:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:02,076 INFO L462 AbstractCegarLoop]: Abstraction has 20114 states and 59552 transitions. [2019-12-27 19:43:02,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:43:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20114 states and 59552 transitions. [2019-12-27 19:43:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:43:02,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:02,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:02,097 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 900090167, now seen corresponding path program 1 times [2019-12-27 19:43:02,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:02,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729545292] [2019-12-27 19:43:02,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:02,174 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 19:43:02,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729545292] [2019-12-27 19:43:02,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:02,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:43:02,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190160055] [2019-12-27 19:43:02,176 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:02,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:02,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:43:02,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:02,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:43:02,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:43:02,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:43:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:02,209 INFO L87 Difference]: Start difference. First operand 20114 states and 59552 transitions. Second operand 7 states. [2019-12-27 19:43:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:02,986 INFO L93 Difference]: Finished difference Result 27182 states and 79348 transitions. [2019-12-27 19:43:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:43:02,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:43:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:03,033 INFO L225 Difference]: With dead ends: 27182 [2019-12-27 19:43:03,033 INFO L226 Difference]: Without dead ends: 27182 [2019-12-27 19:43:03,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:43:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27182 states. [2019-12-27 19:43:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27182 to 21362. [2019-12-27 19:43:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21362 states. [2019-12-27 19:43:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21362 states to 21362 states and 63339 transitions. [2019-12-27 19:43:03,399 INFO L78 Accepts]: Start accepts. Automaton has 21362 states and 63339 transitions. Word has length 33 [2019-12-27 19:43:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:03,400 INFO L462 AbstractCegarLoop]: Abstraction has 21362 states and 63339 transitions. [2019-12-27 19:43:03,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:43:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21362 states and 63339 transitions. [2019-12-27 19:43:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:43:03,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:03,421 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] [2019-12-27 19:43:03,421 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -864898389, now seen corresponding path program 1 times [2019-12-27 19:43:03,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:03,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938923156] [2019-12-27 19:43:03,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:03,502 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 19:43:03,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938923156] [2019-12-27 19:43:03,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:03,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:43:03,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991485140] [2019-12-27 19:43:03,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:03,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:03,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 19:43:03,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:03,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:43:03,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:43:03,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:43:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:03,547 INFO L87 Difference]: Start difference. First operand 21362 states and 63339 transitions. Second operand 7 states. [2019-12-27 19:43:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:04,452 INFO L93 Difference]: Finished difference Result 26308 states and 76942 transitions. [2019-12-27 19:43:04,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:43:04,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 19:43:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:04,489 INFO L225 Difference]: With dead ends: 26308 [2019-12-27 19:43:04,489 INFO L226 Difference]: Without dead ends: 26308 [2019-12-27 19:43:04,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:43:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26308 states. [2019-12-27 19:43:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26308 to 18242. [2019-12-27 19:43:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18242 states. [2019-12-27 19:43:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18242 states to 18242 states and 54251 transitions. [2019-12-27 19:43:04,809 INFO L78 Accepts]: Start accepts. Automaton has 18242 states and 54251 transitions. Word has length 34 [2019-12-27 19:43:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:04,809 INFO L462 AbstractCegarLoop]: Abstraction has 18242 states and 54251 transitions. [2019-12-27 19:43:04,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:43:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 18242 states and 54251 transitions. [2019-12-27 19:43:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:43:04,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:04,827 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] [2019-12-27 19:43:04,827 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 173355914, now seen corresponding path program 1 times [2019-12-27 19:43:04,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:04,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565425178] [2019-12-27 19:43:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:04,887 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 19:43:04,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565425178] [2019-12-27 19:43:04,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:04,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:43:04,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [893944371] [2019-12-27 19:43:04,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:04,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:04,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 231 transitions. [2019-12-27 19:43:04,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:04,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:04,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:04,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:04,940 INFO L87 Difference]: Start difference. First operand 18242 states and 54251 transitions. Second operand 3 states. [2019-12-27 19:43:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:04,999 INFO L93 Difference]: Finished difference Result 18241 states and 54249 transitions. [2019-12-27 19:43:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:04,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:43:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:05,023 INFO L225 Difference]: With dead ends: 18241 [2019-12-27 19:43:05,023 INFO L226 Difference]: Without dead ends: 18241 [2019-12-27 19:43:05,023 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 19:43:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18241 states. [2019-12-27 19:43:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18241 to 18241. [2019-12-27 19:43:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18241 states. [2019-12-27 19:43:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18241 states to 18241 states and 54249 transitions. [2019-12-27 19:43:05,281 INFO L78 Accepts]: Start accepts. Automaton has 18241 states and 54249 transitions. Word has length 39 [2019-12-27 19:43:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:05,281 INFO L462 AbstractCegarLoop]: Abstraction has 18241 states and 54249 transitions. [2019-12-27 19:43:05,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18241 states and 54249 transitions. [2019-12-27 19:43:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:43:05,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:05,300 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 19:43:05,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -121906311, now seen corresponding path program 1 times [2019-12-27 19:43:05,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:05,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516409743] [2019-12-27 19:43:05,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:43:05,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516409743] [2019-12-27 19:43:05,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:05,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:05,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060339260] [2019-12-27 19:43:05,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:05,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:05,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 276 transitions. [2019-12-27 19:43:05,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:05,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:43:05,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:05,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:05,469 INFO L87 Difference]: Start difference. First operand 18241 states and 54249 transitions. Second operand 4 states. [2019-12-27 19:43:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:05,785 INFO L93 Difference]: Finished difference Result 26833 states and 77884 transitions. [2019-12-27 19:43:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:05,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 19:43:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:05,822 INFO L225 Difference]: With dead ends: 26833 [2019-12-27 19:43:05,823 INFO L226 Difference]: Without dead ends: 26833 [2019-12-27 19:43:05,823 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 19:43:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26833 states. [2019-12-27 19:43:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26833 to 18233. [2019-12-27 19:43:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18233 states. [2019-12-27 19:43:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18233 states to 18233 states and 53532 transitions. [2019-12-27 19:43:06,131 INFO L78 Accepts]: Start accepts. Automaton has 18233 states and 53532 transitions. Word has length 40 [2019-12-27 19:43:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:06,131 INFO L462 AbstractCegarLoop]: Abstraction has 18233 states and 53532 transitions. [2019-12-27 19:43:06,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18233 states and 53532 transitions. [2019-12-27 19:43:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 19:43:06,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:06,152 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 19:43:06,152 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1092762268, now seen corresponding path program 1 times [2019-12-27 19:43:06,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:06,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997230178] [2019-12-27 19:43:06,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:06,202 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 19:43:06,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997230178] [2019-12-27 19:43:06,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:06,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:43:06,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321106950] [2019-12-27 19:43:06,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:06,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:06,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 237 transitions. [2019-12-27 19:43:06,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:06,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:43:06,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:43:06,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:43:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:06,398 INFO L87 Difference]: Start difference. First operand 18233 states and 53532 transitions. Second operand 7 states. [2019-12-27 19:43:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:06,498 INFO L93 Difference]: Finished difference Result 17018 states and 50817 transitions. [2019-12-27 19:43:06,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:06,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 19:43:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:06,534 INFO L225 Difference]: With dead ends: 17018 [2019-12-27 19:43:06,534 INFO L226 Difference]: Without dead ends: 17018 [2019-12-27 19:43:06,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:43:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2019-12-27 19:43:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 16437. [2019-12-27 19:43:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16437 states. [2019-12-27 19:43:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16437 states to 16437 states and 49248 transitions. [2019-12-27 19:43:06,940 INFO L78 Accepts]: Start accepts. Automaton has 16437 states and 49248 transitions. Word has length 41 [2019-12-27 19:43:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:06,940 INFO L462 AbstractCegarLoop]: Abstraction has 16437 states and 49248 transitions. [2019-12-27 19:43:06,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:43:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16437 states and 49248 transitions. [2019-12-27 19:43:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:43:06,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:06,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:06,963 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash 264896823, now seen corresponding path program 1 times [2019-12-27 19:43:06,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:06,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925189651] [2019-12-27 19:43:06,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:07,059 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 19:43:07,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925189651] [2019-12-27 19:43:07,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:07,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:07,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564696540] [2019-12-27 19:43:07,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:07,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:07,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 421 transitions. [2019-12-27 19:43:07,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:07,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:43:07,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:07,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:07,309 INFO L87 Difference]: Start difference. First operand 16437 states and 49248 transitions. Second operand 3 states. [2019-12-27 19:43:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:07,421 INFO L93 Difference]: Finished difference Result 20453 states and 61255 transitions. [2019-12-27 19:43:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:07,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 19:43:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:07,446 INFO L225 Difference]: With dead ends: 20453 [2019-12-27 19:43:07,446 INFO L226 Difference]: Without dead ends: 20453 [2019-12-27 19:43:07,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 19:43:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20453 states. [2019-12-27 19:43:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20453 to 17334. [2019-12-27 19:43:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17334 states. [2019-12-27 19:43:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17334 states to 17334 states and 52172 transitions. [2019-12-27 19:43:07,717 INFO L78 Accepts]: Start accepts. Automaton has 17334 states and 52172 transitions. Word has length 65 [2019-12-27 19:43:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:07,717 INFO L462 AbstractCegarLoop]: Abstraction has 17334 states and 52172 transitions. [2019-12-27 19:43:07,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17334 states and 52172 transitions. [2019-12-27 19:43:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:07,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:07,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:07,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 664148053, now seen corresponding path program 1 times [2019-12-27 19:43:07,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:07,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606292993] [2019-12-27 19:43:07,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:07,791 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 19:43:07,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606292993] [2019-12-27 19:43:07,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:07,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:07,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1432916238] [2019-12-27 19:43:07,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:07,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:08,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 264 transitions. [2019-12-27 19:43:08,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:08,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:43:08,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:08,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:08,017 INFO L87 Difference]: Start difference. First operand 17334 states and 52172 transitions. Second operand 3 states. [2019-12-27 19:43:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:08,363 INFO L93 Difference]: Finished difference Result 23890 states and 72209 transitions. [2019-12-27 19:43:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:08,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:43:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:08,403 INFO L225 Difference]: With dead ends: 23890 [2019-12-27 19:43:08,403 INFO L226 Difference]: Without dead ends: 23890 [2019-12-27 19:43:08,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 19:43:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23890 states. [2019-12-27 19:43:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23890 to 17918. [2019-12-27 19:43:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17918 states. [2019-12-27 19:43:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17918 states to 17918 states and 54048 transitions. [2019-12-27 19:43:08,855 INFO L78 Accepts]: Start accepts. Automaton has 17918 states and 54048 transitions. Word has length 66 [2019-12-27 19:43:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:08,855 INFO L462 AbstractCegarLoop]: Abstraction has 17918 states and 54048 transitions. [2019-12-27 19:43:08,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17918 states and 54048 transitions. [2019-12-27 19:43:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:08,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:08,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:08,881 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash 642266433, now seen corresponding path program 2 times [2019-12-27 19:43:08,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:08,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961124744] [2019-12-27 19:43:08,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:08,995 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 19:43:08,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961124744] [2019-12-27 19:43:08,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:08,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:43:08,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903685882] [2019-12-27 19:43:08,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:09,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:09,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 337 transitions. [2019-12-27 19:43:09,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:09,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:43:09,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:43:09,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:43:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:43:09,272 INFO L87 Difference]: Start difference. First operand 17918 states and 54048 transitions. Second operand 10 states. [2019-12-27 19:43:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:11,539 INFO L93 Difference]: Finished difference Result 51696 states and 154951 transitions. [2019-12-27 19:43:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:43:11,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 19:43:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:11,610 INFO L225 Difference]: With dead ends: 51696 [2019-12-27 19:43:11,610 INFO L226 Difference]: Without dead ends: 51696 [2019-12-27 19:43:11,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:43:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51696 states. [2019-12-27 19:43:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51696 to 20063. [2019-12-27 19:43:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-27 19:43:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 61166 transitions. [2019-12-27 19:43:12,378 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 61166 transitions. Word has length 66 [2019-12-27 19:43:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:12,378 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 61166 transitions. [2019-12-27 19:43:12,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:43:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 61166 transitions. [2019-12-27 19:43:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:12,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:12,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:12,397 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 951281221, now seen corresponding path program 1 times [2019-12-27 19:43:12,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:12,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158286500] [2019-12-27 19:43:12,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:12,580 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 19:43:12,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158286500] [2019-12-27 19:43:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:43:12,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610930655] [2019-12-27 19:43:12,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:12,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:12,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 426 transitions. [2019-12-27 19:43:12,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:12,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:43:12,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:43:12,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:43:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:43:12,831 INFO L87 Difference]: Start difference. First operand 20063 states and 61166 transitions. Second operand 12 states. [2019-12-27 19:43:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:14,281 INFO L93 Difference]: Finished difference Result 36005 states and 109319 transitions. [2019-12-27 19:43:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 19:43:14,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 19:43:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:14,318 INFO L225 Difference]: With dead ends: 36005 [2019-12-27 19:43:14,318 INFO L226 Difference]: Without dead ends: 26001 [2019-12-27 19:43:14,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:43:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26001 states. [2019-12-27 19:43:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26001 to 23439. [2019-12-27 19:43:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23439 states. [2019-12-27 19:43:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23439 states to 23439 states and 71059 transitions. [2019-12-27 19:43:14,683 INFO L78 Accepts]: Start accepts. Automaton has 23439 states and 71059 transitions. Word has length 66 [2019-12-27 19:43:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:14,684 INFO L462 AbstractCegarLoop]: Abstraction has 23439 states and 71059 transitions. [2019-12-27 19:43:14,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:43:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23439 states and 71059 transitions. [2019-12-27 19:43:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:14,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:14,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:14,710 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1902961575, now seen corresponding path program 3 times [2019-12-27 19:43:14,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:14,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18474278] [2019-12-27 19:43:14,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:14,784 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 19:43:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18474278] [2019-12-27 19:43:14,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:14,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:43:14,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454587694] [2019-12-27 19:43:14,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:14,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:15,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 456 transitions. [2019-12-27 19:43:15,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:15,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:43:15,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:15,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:15,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:15,204 INFO L87 Difference]: Start difference. First operand 23439 states and 71059 transitions. Second operand 4 states. [2019-12-27 19:43:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:15,373 INFO L93 Difference]: Finished difference Result 23166 states and 70091 transitions. [2019-12-27 19:43:15,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:43:15,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 19:43:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:15,414 INFO L225 Difference]: With dead ends: 23166 [2019-12-27 19:43:15,414 INFO L226 Difference]: Without dead ends: 23166 [2019-12-27 19:43:15,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 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 19:43:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23166 states. [2019-12-27 19:43:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23166 to 18836. [2019-12-27 19:43:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18836 states. [2019-12-27 19:43:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18836 states to 18836 states and 56057 transitions. [2019-12-27 19:43:15,788 INFO L78 Accepts]: Start accepts. Automaton has 18836 states and 56057 transitions. Word has length 66 [2019-12-27 19:43:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:15,788 INFO L462 AbstractCegarLoop]: Abstraction has 18836 states and 56057 transitions. [2019-12-27 19:43:15,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18836 states and 56057 transitions. [2019-12-27 19:43:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:15,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:15,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:15,808 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1368451805, now seen corresponding path program 2 times [2019-12-27 19:43:15,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:15,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693677027] [2019-12-27 19:43:15,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:15,970 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 19:43:15,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693677027] [2019-12-27 19:43:15,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:15,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:43:15,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642771719] [2019-12-27 19:43:15,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:15,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:16,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 594 transitions. [2019-12-27 19:43:16,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:16,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:16,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:16,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:16,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:43:16,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:43:16,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:16,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:43:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:43:16,614 INFO L87 Difference]: Start difference. First operand 18836 states and 56057 transitions. Second operand 16 states. [2019-12-27 19:43:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:19,349 INFO L93 Difference]: Finished difference Result 30364 states and 89194 transitions. [2019-12-27 19:43:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:43:19,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 19:43:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:19,384 INFO L225 Difference]: With dead ends: 30364 [2019-12-27 19:43:19,384 INFO L226 Difference]: Without dead ends: 23899 [2019-12-27 19:43:19,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:43:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2019-12-27 19:43:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 19224. [2019-12-27 19:43:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19224 states. [2019-12-27 19:43:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19224 states to 19224 states and 57046 transitions. [2019-12-27 19:43:19,857 INFO L78 Accepts]: Start accepts. Automaton has 19224 states and 57046 transitions. Word has length 66 [2019-12-27 19:43:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:19,857 INFO L462 AbstractCegarLoop]: Abstraction has 19224 states and 57046 transitions. [2019-12-27 19:43:19,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:43:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19224 states and 57046 transitions. [2019-12-27 19:43:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:19,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:19,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:19,877 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash -885988701, now seen corresponding path program 3 times [2019-12-27 19:43:19,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:19,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126340447] [2019-12-27 19:43:19,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:43:20,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126340447] [2019-12-27 19:43:20,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:20,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:43:20,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227447378] [2019-12-27 19:43:20,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:20,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:20,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 492 transitions. [2019-12-27 19:43:20,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:20,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:43:20,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:43:20,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:43:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:43:20,652 INFO L87 Difference]: Start difference. First operand 19224 states and 57046 transitions. Second operand 15 states. [2019-12-27 19:43:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:22,306 INFO L93 Difference]: Finished difference Result 25050 states and 73905 transitions. [2019-12-27 19:43:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:43:22,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 19:43:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:22,335 INFO L225 Difference]: With dead ends: 25050 [2019-12-27 19:43:22,336 INFO L226 Difference]: Without dead ends: 22395 [2019-12-27 19:43:22,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:43:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2019-12-27 19:43:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 18904. [2019-12-27 19:43:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18904 states. [2019-12-27 19:43:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18904 states to 18904 states and 56086 transitions. [2019-12-27 19:43:22,638 INFO L78 Accepts]: Start accepts. Automaton has 18904 states and 56086 transitions. Word has length 66 [2019-12-27 19:43:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:22,638 INFO L462 AbstractCegarLoop]: Abstraction has 18904 states and 56086 transitions. [2019-12-27 19:43:22,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:43:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18904 states and 56086 transitions. [2019-12-27 19:43:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:22,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:22,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:22,660 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash 530097221, now seen corresponding path program 4 times [2019-12-27 19:43:22,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:22,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112331384] [2019-12-27 19:43:22,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:23,238 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 19:43:23,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112331384] [2019-12-27 19:43:23,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:23,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:43:23,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066801064] [2019-12-27 19:43:23,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:23,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:23,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 494 transitions. [2019-12-27 19:43:23,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:24,542 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-27 19:43:24,998 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-12-27 19:43:25,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-27 19:43:25,367 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 19:43:25,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 19:43:25,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 19:43:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 19:43:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:43:25,372 INFO L87 Difference]: Start difference. First operand 18904 states and 56086 transitions. Second operand 28 states. [2019-12-27 19:43:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:36,424 INFO L93 Difference]: Finished difference Result 50032 states and 146120 transitions. [2019-12-27 19:43:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 19:43:36,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 19:43:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:36,469 INFO L225 Difference]: With dead ends: 50032 [2019-12-27 19:43:36,470 INFO L226 Difference]: Without dead ends: 36025 [2019-12-27 19:43:36,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=661, Invalid=4309, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 19:43:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36025 states. [2019-12-27 19:43:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36025 to 23768. [2019-12-27 19:43:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2019-12-27 19:43:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 70600 transitions. [2019-12-27 19:43:36,888 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 70600 transitions. Word has length 66 [2019-12-27 19:43:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:36,888 INFO L462 AbstractCegarLoop]: Abstraction has 23768 states and 70600 transitions. [2019-12-27 19:43:36,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 19:43:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 70600 transitions. [2019-12-27 19:43:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:36,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:36,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:36,911 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -650377857, now seen corresponding path program 5 times [2019-12-27 19:43:36,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:36,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812538653] [2019-12-27 19:43:36,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:37,131 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 19:43:37,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812538653] [2019-12-27 19:43:37,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:37,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:43:37,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016120583] [2019-12-27 19:43:37,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:37,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:37,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 396 transitions. [2019-12-27 19:43:37,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:37,788 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-27 19:43:37,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 19:43:37,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 19:43:37,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:43:37,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:43:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:43:37,948 INFO L87 Difference]: Start difference. First operand 23768 states and 70600 transitions. Second operand 17 states. [2019-12-27 19:43:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:46,576 INFO L93 Difference]: Finished difference Result 79417 states and 234223 transitions. [2019-12-27 19:43:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 19:43:46,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 19:43:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:46,689 INFO L225 Difference]: With dead ends: 79417 [2019-12-27 19:43:46,689 INFO L226 Difference]: Without dead ends: 79129 [2019-12-27 19:43:46,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=565, Invalid=2975, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 19:43:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79129 states. [2019-12-27 19:43:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79129 to 34031. [2019-12-27 19:43:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-12-27 19:43:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 103011 transitions. [2019-12-27 19:43:47,543 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 103011 transitions. Word has length 66 [2019-12-27 19:43:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:47,543 INFO L462 AbstractCegarLoop]: Abstraction has 34031 states and 103011 transitions. [2019-12-27 19:43:47,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:43:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 103011 transitions. [2019-12-27 19:43:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:47,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:47,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:47,579 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1769267611, now seen corresponding path program 6 times [2019-12-27 19:43:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:47,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251698316] [2019-12-27 19:43:47,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:47,643 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 19:43:47,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251698316] [2019-12-27 19:43:47,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:47,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:47,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229494931] [2019-12-27 19:43:47,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:47,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:47,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 309 transitions. [2019-12-27 19:43:47,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:47,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:47,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:47,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:47,874 INFO L87 Difference]: Start difference. First operand 34031 states and 103011 transitions. Second operand 3 states. [2019-12-27 19:43:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:48,080 INFO L93 Difference]: Finished difference Result 34031 states and 103010 transitions. [2019-12-27 19:43:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:48,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:43:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:48,160 INFO L225 Difference]: With dead ends: 34031 [2019-12-27 19:43:48,160 INFO L226 Difference]: Without dead ends: 34031 [2019-12-27 19:43:48,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34031 states. [2019-12-27 19:43:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34031 to 25963. [2019-12-27 19:43:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25963 states. [2019-12-27 19:43:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25963 states to 25963 states and 79393 transitions. [2019-12-27 19:43:48,886 INFO L78 Accepts]: Start accepts. Automaton has 25963 states and 79393 transitions. Word has length 66 [2019-12-27 19:43:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:48,886 INFO L462 AbstractCegarLoop]: Abstraction has 25963 states and 79393 transitions. [2019-12-27 19:43:48,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 25963 states and 79393 transitions. [2019-12-27 19:43:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:48,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:48,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:48,915 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1421599499, now seen corresponding path program 1 times [2019-12-27 19:43:48,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:48,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854688640] [2019-12-27 19:43:48,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:49,363 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 19:43:49,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854688640] [2019-12-27 19:43:49,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:49,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 19:43:49,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958353131] [2019-12-27 19:43:49,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:49,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:49,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 397 transitions. [2019-12-27 19:43:49,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:50,465 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-27 19:43:50,929 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-12-27 19:43:50,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-27 19:43:51,294 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 19:43:51,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 19:43:51,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 19:43:51,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:51,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 19:43:51,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-12-27 19:43:51,296 INFO L87 Difference]: Start difference. First operand 25963 states and 79393 transitions. Second operand 30 states. [2019-12-27 19:44:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:13,490 INFO L93 Difference]: Finished difference Result 60159 states and 180620 transitions. [2019-12-27 19:44:13,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-27 19:44:13,490 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 19:44:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:13,565 INFO L225 Difference]: With dead ends: 60159 [2019-12-27 19:44:13,565 INFO L226 Difference]: Without dead ends: 51487 [2019-12-27 19:44:13,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3755 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1609, Invalid=10381, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 19:44:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51487 states. [2019-12-27 19:44:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51487 to 26848. [2019-12-27 19:44:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26848 states. [2019-12-27 19:44:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26848 states to 26848 states and 82055 transitions. [2019-12-27 19:44:14,141 INFO L78 Accepts]: Start accepts. Automaton has 26848 states and 82055 transitions. Word has length 67 [2019-12-27 19:44:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:14,141 INFO L462 AbstractCegarLoop]: Abstraction has 26848 states and 82055 transitions. [2019-12-27 19:44:14,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 19:44:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26848 states and 82055 transitions. [2019-12-27 19:44:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:14,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:14,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:44:14,169 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1948834343, now seen corresponding path program 2 times [2019-12-27 19:44:14,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:14,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291878720] [2019-12-27 19:44:14,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:14,669 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 19:44:14,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291878720] [2019-12-27 19:44:14,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:14,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 19:44:14,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679569098] [2019-12-27 19:44:14,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:14,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:14,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 518 transitions. [2019-12-27 19:44:14,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:16,356 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-27 19:44:16,876 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-12-27 19:44:16,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-27 19:44:17,333 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 19:44:17,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 19:44:17,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 19:44:17,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:17,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 19:44:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:44:17,336 INFO L87 Difference]: Start difference. First operand 26848 states and 82055 transitions. Second operand 32 states. [2019-12-27 19:44:21,217 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-12-27 19:44:25,921 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-12-27 19:44:28,867 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-12-27 19:44:32,639 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 19:44:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:44:44,273 INFO L93 Difference]: Finished difference Result 65133 states and 194239 transitions. [2019-12-27 19:44:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-27 19:44:44,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-12-27 19:44:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:44:44,357 INFO L225 Difference]: With dead ends: 65133 [2019-12-27 19:44:44,357 INFO L226 Difference]: Without dead ends: 55352 [2019-12-27 19:44:44,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4717 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1926, Invalid=12836, Unknown=0, NotChecked=0, Total=14762 [2019-12-27 19:44:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55352 states. [2019-12-27 19:44:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55352 to 29303. [2019-12-27 19:44:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29303 states. [2019-12-27 19:44:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29303 states to 29303 states and 89860 transitions. [2019-12-27 19:44:45,191 INFO L78 Accepts]: Start accepts. Automaton has 29303 states and 89860 transitions. Word has length 67 [2019-12-27 19:44:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:44:45,191 INFO L462 AbstractCegarLoop]: Abstraction has 29303 states and 89860 transitions. [2019-12-27 19:44:45,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 19:44:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29303 states and 89860 transitions. [2019-12-27 19:44:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:44:45,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:44:45,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:44:45,223 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:44:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:44:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash -600863853, now seen corresponding path program 3 times [2019-12-27 19:44:45,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:44:45,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374057543] [2019-12-27 19:44:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:44:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:44:45,726 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 19:44:45,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374057543] [2019-12-27 19:44:45,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:44:45,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 19:44:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704511901] [2019-12-27 19:44:45,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:44:45,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:44:45,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 479 transitions. [2019-12-27 19:44:45,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:44:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:44:47,291 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-27 19:44:48,106 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2019-12-27 19:44:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-27 19:44:48,960 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-27 19:44:48,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 19:44:48,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 19:44:48,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:44:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 19:44:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 19:44:48,964 INFO L87 Difference]: Start difference. First operand 29303 states and 89860 transitions. Second operand 36 states. [2019-12-27 19:44:51,518 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-27 19:44:52,204 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-12-27 19:44:52,952 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-12-27 19:44:53,358 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 19:44:55,473 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-12-27 19:44:57,971 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-12-27 19:45:05,099 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 19:45:05,327 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-27 19:45:07,683 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-27 19:45:10,340 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 19:45:13,800 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-27 19:45:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:45:19,302 INFO L93 Difference]: Finished difference Result 72733 states and 216846 transitions. [2019-12-27 19:45:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-12-27 19:45:19,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-12-27 19:45:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:45:19,400 INFO L225 Difference]: With dead ends: 72733 [2019-12-27 19:45:19,400 INFO L226 Difference]: Without dead ends: 66660 [2019-12-27 19:45:19,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13539 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4306, Invalid=32750, Unknown=0, NotChecked=0, Total=37056 [2019-12-27 19:45:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66660 states. [2019-12-27 19:45:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66660 to 28769. [2019-12-27 19:45:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28769 states. [2019-12-27 19:45:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28769 states to 28769 states and 88473 transitions. [2019-12-27 19:45:20,342 INFO L78 Accepts]: Start accepts. Automaton has 28769 states and 88473 transitions. Word has length 67 [2019-12-27 19:45:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:45:20,342 INFO L462 AbstractCegarLoop]: Abstraction has 28769 states and 88473 transitions. [2019-12-27 19:45:20,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 19:45:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28769 states and 88473 transitions. [2019-12-27 19:45:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:45:20,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:45:20,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:45:20,373 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:45:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:45:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash -626626987, now seen corresponding path program 4 times [2019-12-27 19:45:20,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:45:20,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810963255] [2019-12-27 19:45:20,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:45:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:45:21,062 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 19:45:21,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810963255] [2019-12-27 19:45:21,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:45:21,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:45:21,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986916772] [2019-12-27 19:45:21,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:45:21,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:45:21,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 419 transitions. [2019-12-27 19:45:21,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:45:22,168 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-27 19:45:22,918 WARN L192 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 171 [2019-12-27 19:45:22,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 15 terms [2019-12-27 19:45:23,700 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-12-27 19:45:23,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 19:45:23,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 19:45:23,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:45:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 19:45:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:45:23,703 INFO L87 Difference]: Start difference. First operand 28769 states and 88473 transitions. Second operand 27 states. [2019-12-27 19:45:26,789 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-27 19:45:27,416 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-12-27 19:45:28,140 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-12-27 19:45:29,651 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-27 19:45:32,547 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 19:45:33,992 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 Received shutdown request... [2019-12-27 19:45:34,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 19:45:34,097 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:45:34,100 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:45:34,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:45:34 BasicIcfg [2019-12-27 19:45:34,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:45:34,102 INFO L168 Benchmark]: Toolchain (without parser) took 224617.49 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,102 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 154.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,103 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,104 INFO L168 Benchmark]: RCFGBuilder took 1000.49 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 98.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,104 INFO L168 Benchmark]: TraceAbstraction took 222708.65 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:45:34,106 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.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 154.5 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1000.49 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 98.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222708.65 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7190 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85139 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (28769states) and FLOYD_HOARE automaton (currently 70 states, 27 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (28769states) and FLOYD_HOARE automaton (currently 70 states, 27 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: TIMEOUT, OverallTime: 222.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 136.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7568 SDtfs, 13773 SDslu, 39878 SDs, 0 SdLazy, 75454 SolverSat, 1381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1074 GetRequests, 176 SyntacticMatches, 81 SemanticMatches, 816 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26797 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155734occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 317894 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 361333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown