/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/mix011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:59:45,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:59:45,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:59:45,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:59:45,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:59:45,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:59:45,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:59:45,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:59:45,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:59:45,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:59:45,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:59:45,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:59:45,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:59:45,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:59:45,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:59:45,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:59:45,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:59:45,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:59:45,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:59:45,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:59:45,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:59:45,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:59:45,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:59:45,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:59:45,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:59:45,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:59:45,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:59:45,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:59:45,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:59:45,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:59:45,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:59:45,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:59:45,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:59:45,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:59:45,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:59:45,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:59:45,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:59:45,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:59:45,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:59:45,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:59:45,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:59:45,322 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:59:45,336 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:59:45,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:59:45,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:59:45,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:59:45,338 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:59:45,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:59:45,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:59:45,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:59:45,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:59:45,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:59:45,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:59:45,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:59:45,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:59:45,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:59:45,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:59:45,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:59:45,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:59:45,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:59:45,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:59:45,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:59:45,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:59:45,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:59:45,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:59:45,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:59:45,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:59:45,343 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:59:45,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:59:45,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:59:45,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:59:45,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:59:45,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:59:45,661 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:59:45,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-27 19:59:45,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28047255e/c334b4d7727242709e6771ebff1817eb/FLAG9400ead6c [2019-12-27 19:59:46,295 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:59:46,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-27 19:59:46,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28047255e/c334b4d7727242709e6771ebff1817eb/FLAG9400ead6c [2019-12-27 19:59:46,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28047255e/c334b4d7727242709e6771ebff1817eb [2019-12-27 19:59:46,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:59:46,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:59:46,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:59:46,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:59:46,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:59:46,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:46" (1/1) ... [2019-12-27 19:59:46,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:46, skipping insertion in model container [2019-12-27 19:59:46,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:46" (1/1) ... [2019-12-27 19:59:46,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:59:46,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:59:47,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:59:47,231 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:59:47,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:59:47,382 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:59:47,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47 WrapperNode [2019-12-27 19:59:47,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:59:47,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:59:47,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:59:47,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:59:47,393 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:59:47" (1/1) ... [2019-12-27 19:59:47,415 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:59:47" (1/1) ... [2019-12-27 19:59:47,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:59:47,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:59:47,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:59:47,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:59:47,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (1/1) ... [2019-12-27 19:59:47,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:59:47,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:59:47,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:59:47,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:59:47,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (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:59:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:59:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:59:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:59:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:59:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:59:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:59:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:59:47,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:59:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:59:47,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:59:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:59:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:59:47,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:59:47,574 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:59:48,367 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:59:48,368 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:59:48,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:48 BoogieIcfgContainer [2019-12-27 19:59:48,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:59:48,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:59:48,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:59:48,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:59:48,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:59:46" (1/3) ... [2019-12-27 19:59:48,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:48, skipping insertion in model container [2019-12-27 19:59:48,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:47" (2/3) ... [2019-12-27 19:59:48,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:48, skipping insertion in model container [2019-12-27 19:59:48,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:48" (3/3) ... [2019-12-27 19:59:48,378 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2019-12-27 19:59:48,388 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:59:48,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:59:48,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:59:48,397 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:59:48,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,459 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,459 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,521 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:48,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:59:48,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:59:48,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:59:48,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:59:48,577 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:59:48,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:59:48,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:59:48,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:59:48,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:59:48,594 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 19:59:48,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:59:48,716 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:59:48,716 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:59:48,732 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 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:59:48,756 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:59:48,811 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:59:48,811 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:59:48,820 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 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:59:48,842 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:59:48,843 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:59:52,469 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 19:59:52,596 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 19:59:52,879 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 19:59:53,051 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 19:59:53,091 INFO L206 etLargeBlockEncoding]: Checked pairs total: 94688 [2019-12-27 19:59:53,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 19:59:53,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 20:00:19,193 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 134882 states. [2019-12-27 20:00:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 134882 states. [2019-12-27 20:00:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:00:19,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:19,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:00:19,201 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 20:00:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 915989, now seen corresponding path program 1 times [2019-12-27 20:00:19,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:19,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544801201] [2019-12-27 20:00:19,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:19,413 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 20:00:19,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544801201] [2019-12-27 20:00:19,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:19,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:00:19,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1112411334] [2019-12-27 20:00:19,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:19,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:19,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:00:19,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:19,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:19,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:19,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:19,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:19,450 INFO L87 Difference]: Start difference. First operand 134882 states. Second operand 3 states. [2019-12-27 20:00:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:23,221 INFO L93 Difference]: Finished difference Result 125324 states and 534602 transitions. [2019-12-27 20:00:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:23,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:00:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:23,908 INFO L225 Difference]: With dead ends: 125324 [2019-12-27 20:00:23,908 INFO L226 Difference]: Without dead ends: 118044 [2019-12-27 20:00:23,909 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 20:00:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118044 states. [2019-12-27 20:00:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118044 to 118044. [2019-12-27 20:00:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118044 states. [2019-12-27 20:00:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118044 states to 118044 states and 502920 transitions. [2019-12-27 20:00:35,228 INFO L78 Accepts]: Start accepts. Automaton has 118044 states and 502920 transitions. Word has length 3 [2019-12-27 20:00:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:35,228 INFO L462 AbstractCegarLoop]: Abstraction has 118044 states and 502920 transitions. [2019-12-27 20:00:35,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 118044 states and 502920 transitions. [2019-12-27 20:00:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:00:35,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:35,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:35,232 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 20:00:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -31291973, now seen corresponding path program 1 times [2019-12-27 20:00:35,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:35,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043540515] [2019-12-27 20:00:35,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:35,352 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 20:00:35,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043540515] [2019-12-27 20:00:35,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:35,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:35,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856627908] [2019-12-27 20:00:35,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:35,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:35,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:00:35,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:35,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:35,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:00:35,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:00:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:00:35,365 INFO L87 Difference]: Start difference. First operand 118044 states and 502920 transitions. Second operand 4 states. [2019-12-27 20:00:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:41,933 INFO L93 Difference]: Finished difference Result 183348 states and 749807 transitions. [2019-12-27 20:00:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:41,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:00:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:42,804 INFO L225 Difference]: With dead ends: 183348 [2019-12-27 20:00:42,804 INFO L226 Difference]: Without dead ends: 183299 [2019-12-27 20:00:42,806 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 20:00:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183299 states. [2019-12-27 20:00:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183299 to 167419. [2019-12-27 20:00:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167419 states. [2019-12-27 20:00:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167419 states to 167419 states and 693327 transitions. [2019-12-27 20:00:53,213 INFO L78 Accepts]: Start accepts. Automaton has 167419 states and 693327 transitions. Word has length 11 [2019-12-27 20:00:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:53,213 INFO L462 AbstractCegarLoop]: Abstraction has 167419 states and 693327 transitions. [2019-12-27 20:00:53,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:00:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand 167419 states and 693327 transitions. [2019-12-27 20:00:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:00:57,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:57,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:57,974 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 20:00:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2078499822, now seen corresponding path program 1 times [2019-12-27 20:00:57,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:57,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377575118] [2019-12-27 20:00:57,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:58,067 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 20:00:58,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377575118] [2019-12-27 20:00:58,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:58,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:58,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545460815] [2019-12-27 20:00:58,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:58,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:58,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:00:58,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:58,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:58,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:58,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:58,075 INFO L87 Difference]: Start difference. First operand 167419 states and 693327 transitions. Second operand 3 states. [2019-12-27 20:00:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:58,237 INFO L93 Difference]: Finished difference Result 35457 states and 115033 transitions. [2019-12-27 20:00:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:58,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:00:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:58,310 INFO L225 Difference]: With dead ends: 35457 [2019-12-27 20:00:58,311 INFO L226 Difference]: Without dead ends: 35457 [2019-12-27 20:00:58,311 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 20:00:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35457 states. [2019-12-27 20:00:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35457 to 35457. [2019-12-27 20:00:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35457 states. [2019-12-27 20:00:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35457 states to 35457 states and 115033 transitions. [2019-12-27 20:00:59,034 INFO L78 Accepts]: Start accepts. Automaton has 35457 states and 115033 transitions. Word has length 13 [2019-12-27 20:00:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:59,034 INFO L462 AbstractCegarLoop]: Abstraction has 35457 states and 115033 transitions. [2019-12-27 20:00:59,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35457 states and 115033 transitions. [2019-12-27 20:00:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:00:59,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:59,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:59,038 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 20:00:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1087155049, now seen corresponding path program 1 times [2019-12-27 20:00:59,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:59,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641823086] [2019-12-27 20:00:59,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:59,127 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 20:00:59,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641823086] [2019-12-27 20:00:59,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:59,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:59,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161305458] [2019-12-27 20:00:59,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:59,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:59,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:00:59,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:59,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:59,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:00:59,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:59,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:00:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:59,136 INFO L87 Difference]: Start difference. First operand 35457 states and 115033 transitions. Second operand 5 states. [2019-12-27 20:00:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:59,699 INFO L93 Difference]: Finished difference Result 48336 states and 154905 transitions. [2019-12-27 20:00:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:00:59,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:00:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:59,776 INFO L225 Difference]: With dead ends: 48336 [2019-12-27 20:00:59,776 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 20:00:59,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:01:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 20:01:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 40811. [2019-12-27 20:01:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40811 states. [2019-12-27 20:01:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40811 states to 40811 states and 131928 transitions. [2019-12-27 20:01:00,884 INFO L78 Accepts]: Start accepts. Automaton has 40811 states and 131928 transitions. Word has length 16 [2019-12-27 20:01:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:00,886 INFO L462 AbstractCegarLoop]: Abstraction has 40811 states and 131928 transitions. [2019-12-27 20:01:00,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:01:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 40811 states and 131928 transitions. [2019-12-27 20:01:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:01:00,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:00,896 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 20:01:00,896 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 20:01:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 331077478, now seen corresponding path program 1 times [2019-12-27 20:01:00,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:00,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140959837] [2019-12-27 20:01:00,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:01,045 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 20:01:01,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140959837] [2019-12-27 20:01:01,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:01,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:01:01,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420043081] [2019-12-27 20:01:01,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:01,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:01,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 20:01:01,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:01,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:01,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:01:01,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:01:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:01:01,060 INFO L87 Difference]: Start difference. First operand 40811 states and 131928 transitions. Second operand 6 states. [2019-12-27 20:01:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:02,082 INFO L93 Difference]: Finished difference Result 60696 states and 191428 transitions. [2019-12-27 20:01:02,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:01:02,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 20:01:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:02,187 INFO L225 Difference]: With dead ends: 60696 [2019-12-27 20:01:02,188 INFO L226 Difference]: Without dead ends: 60689 [2019-12-27 20:01:02,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:01:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60689 states. [2019-12-27 20:01:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60689 to 41267. [2019-12-27 20:01:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-12-27 20:01:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 132739 transitions. [2019-12-27 20:01:03,066 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 132739 transitions. Word has length 22 [2019-12-27 20:01:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:03,066 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 132739 transitions. [2019-12-27 20:01:03,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:01:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 132739 transitions. [2019-12-27 20:01:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:01:03,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:03,080 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 20:01:03,081 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 20:01:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1815979917, now seen corresponding path program 1 times [2019-12-27 20:01:03,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:03,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686127155] [2019-12-27 20:01:03,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:03,137 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 20:01:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686127155] [2019-12-27 20:01:03,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:03,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:01:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1627166523] [2019-12-27 20:01:03,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:03,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:03,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:01:03,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:03,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:01:03,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:01:03,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:01:03,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:03,190 INFO L87 Difference]: Start difference. First operand 41267 states and 132739 transitions. Second operand 5 states. [2019-12-27 20:01:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:03,267 INFO L93 Difference]: Finished difference Result 16400 states and 49837 transitions. [2019-12-27 20:01:03,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:01:03,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:01:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:03,292 INFO L225 Difference]: With dead ends: 16400 [2019-12-27 20:01:03,292 INFO L226 Difference]: Without dead ends: 16400 [2019-12-27 20:01:03,292 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 20:01:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-27 20:01:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 16107. [2019-12-27 20:01:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16107 states. [2019-12-27 20:01:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16107 states to 16107 states and 49001 transitions. [2019-12-27 20:01:03,763 INFO L78 Accepts]: Start accepts. Automaton has 16107 states and 49001 transitions. Word has length 25 [2019-12-27 20:01:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:03,763 INFO L462 AbstractCegarLoop]: Abstraction has 16107 states and 49001 transitions. [2019-12-27 20:01:03,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:01:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16107 states and 49001 transitions. [2019-12-27 20:01:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:01:03,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:03,774 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 20:01:03,774 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 20:01:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1743661769, now seen corresponding path program 1 times [2019-12-27 20:01:03,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:03,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336094896] [2019-12-27 20:01:03,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:03,891 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 20:01:03,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336094896] [2019-12-27 20:01:03,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:03,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:01:03,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327802800] [2019-12-27 20:01:03,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:03,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:03,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:01:03,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:03,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:01:03,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:01:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:01:03,909 INFO L87 Difference]: Start difference. First operand 16107 states and 49001 transitions. Second operand 6 states. [2019-12-27 20:01:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:04,425 INFO L93 Difference]: Finished difference Result 23083 states and 68424 transitions. [2019-12-27 20:01:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:01:04,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:01:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:04,459 INFO L225 Difference]: With dead ends: 23083 [2019-12-27 20:01:04,459 INFO L226 Difference]: Without dead ends: 23083 [2019-12-27 20:01:04,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:01:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23083 states. [2019-12-27 20:01:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23083 to 18424. [2019-12-27 20:01:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18424 states. [2019-12-27 20:01:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 55823 transitions. [2019-12-27 20:01:04,763 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 55823 transitions. Word has length 27 [2019-12-27 20:01:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:04,764 INFO L462 AbstractCegarLoop]: Abstraction has 18424 states and 55823 transitions. [2019-12-27 20:01:04,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:01:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 55823 transitions. [2019-12-27 20:01:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:01:04,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:04,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:04,781 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 20:01:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash 805811820, now seen corresponding path program 1 times [2019-12-27 20:01:04,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:04,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229066381] [2019-12-27 20:01:04,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:04,874 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 20:01:04,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229066381] [2019-12-27 20:01:04,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:04,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:01:04,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109801449] [2019-12-27 20:01:04,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:04,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:04,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 49 transitions. [2019-12-27 20:01:04,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:04,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:04,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:01:04,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:01:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:01:04,896 INFO L87 Difference]: Start difference. First operand 18424 states and 55823 transitions. Second operand 7 states. [2019-12-27 20:01:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:05,933 INFO L93 Difference]: Finished difference Result 25102 states and 74108 transitions. [2019-12-27 20:01:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:01:05,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 20:01:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:05,971 INFO L225 Difference]: With dead ends: 25102 [2019-12-27 20:01:05,971 INFO L226 Difference]: Without dead ends: 25102 [2019-12-27 20:01:05,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:01:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25102 states. [2019-12-27 20:01:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25102 to 17010. [2019-12-27 20:01:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17010 states. [2019-12-27 20:01:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17010 states to 17010 states and 51608 transitions. [2019-12-27 20:01:06,285 INFO L78 Accepts]: Start accepts. Automaton has 17010 states and 51608 transitions. Word has length 33 [2019-12-27 20:01:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:06,285 INFO L462 AbstractCegarLoop]: Abstraction has 17010 states and 51608 transitions. [2019-12-27 20:01:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:01:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17010 states and 51608 transitions. [2019-12-27 20:01:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:01:06,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:06,308 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 20:01:06,309 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 20:01:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1882924927, now seen corresponding path program 1 times [2019-12-27 20:01:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:06,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509427474] [2019-12-27 20:01:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:06,372 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 20:01:06,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509427474] [2019-12-27 20:01:06,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:06,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:06,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426599273] [2019-12-27 20:01:06,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:06,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:06,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 375 transitions. [2019-12-27 20:01:06,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:06,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:06,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:06,468 INFO L87 Difference]: Start difference. First operand 17010 states and 51608 transitions. Second operand 3 states. [2019-12-27 20:01:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:06,597 INFO L93 Difference]: Finished difference Result 28822 states and 87795 transitions. [2019-12-27 20:01:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:06,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:01:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:06,623 INFO L225 Difference]: With dead ends: 28822 [2019-12-27 20:01:06,624 INFO L226 Difference]: Without dead ends: 14466 [2019-12-27 20:01:06,624 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 20:01:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-27 20:01:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 14406. [2019-12-27 20:01:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14406 states. [2019-12-27 20:01:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 43046 transitions. [2019-12-27 20:01:07,030 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 43046 transitions. Word has length 39 [2019-12-27 20:01:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:07,030 INFO L462 AbstractCegarLoop]: Abstraction has 14406 states and 43046 transitions. [2019-12-27 20:01:07,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 43046 transitions. [2019-12-27 20:01:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:01:07,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:07,047 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 20:01:07,047 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 20:01:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1781220711, now seen corresponding path program 2 times [2019-12-27 20:01:07,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:07,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465746251] [2019-12-27 20:01:07,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:07,110 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 20:01:07,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465746251] [2019-12-27 20:01:07,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:07,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:07,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700408498] [2019-12-27 20:01:07,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:07,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:07,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 20:01:07,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:07,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:07,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:07,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:07,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:07,188 INFO L87 Difference]: Start difference. First operand 14406 states and 43046 transitions. Second operand 3 states. [2019-12-27 20:01:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:07,260 INFO L93 Difference]: Finished difference Result 14405 states and 43044 transitions. [2019-12-27 20:01:07,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:07,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:01:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:07,293 INFO L225 Difference]: With dead ends: 14405 [2019-12-27 20:01:07,293 INFO L226 Difference]: Without dead ends: 14405 [2019-12-27 20:01:07,294 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 20:01:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14405 states. [2019-12-27 20:01:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14405 to 14405. [2019-12-27 20:01:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14405 states. [2019-12-27 20:01:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14405 states to 14405 states and 43044 transitions. [2019-12-27 20:01:07,679 INFO L78 Accepts]: Start accepts. Automaton has 14405 states and 43044 transitions. Word has length 39 [2019-12-27 20:01:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:07,680 INFO L462 AbstractCegarLoop]: Abstraction has 14405 states and 43044 transitions. [2019-12-27 20:01:07,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 14405 states and 43044 transitions. [2019-12-27 20:01:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:01:07,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:07,706 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 20:01:07,706 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 20:01:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -918298112, now seen corresponding path program 1 times [2019-12-27 20:01:07,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:07,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758993068] [2019-12-27 20:01:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:07,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758993068] [2019-12-27 20:01:07,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:07,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:01:07,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030169122] [2019-12-27 20:01:07,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:07,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:07,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 20:01:07,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:07,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:01:07,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:01:07,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:01:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:01:07,975 INFO L87 Difference]: Start difference. First operand 14405 states and 43044 transitions. Second operand 6 states. [2019-12-27 20:01:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:08,083 INFO L93 Difference]: Finished difference Result 13331 states and 40580 transitions. [2019-12-27 20:01:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:08,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:01:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:08,111 INFO L225 Difference]: With dead ends: 13331 [2019-12-27 20:01:08,112 INFO L226 Difference]: Without dead ends: 11780 [2019-12-27 20:01:08,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:01:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11780 states. [2019-12-27 20:01:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11780 to 11367. [2019-12-27 20:01:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11367 states. [2019-12-27 20:01:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 35647 transitions. [2019-12-27 20:01:08,422 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 35647 transitions. Word has length 40 [2019-12-27 20:01:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:08,423 INFO L462 AbstractCegarLoop]: Abstraction has 11367 states and 35647 transitions. [2019-12-27 20:01:08,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:01:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 35647 transitions. [2019-12-27 20:01:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:01:08,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:08,444 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] [2019-12-27 20:01:08,444 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 20:01:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash 35945, now seen corresponding path program 1 times [2019-12-27 20:01:08,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466325765] [2019-12-27 20:01:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:08,510 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 20:01:08,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466325765] [2019-12-27 20:01:08,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:08,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:01:08,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216446634] [2019-12-27 20:01:08,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:08,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:08,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 20:01:08,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:08,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:01:08,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:08,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:08,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:08,738 INFO L87 Difference]: Start difference. First operand 11367 states and 35647 transitions. Second operand 3 states. [2019-12-27 20:01:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:08,825 INFO L93 Difference]: Finished difference Result 18105 states and 55572 transitions. [2019-12-27 20:01:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:08,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:01:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:08,860 INFO L225 Difference]: With dead ends: 18105 [2019-12-27 20:01:08,860 INFO L226 Difference]: Without dead ends: 18105 [2019-12-27 20:01:08,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 20:01:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18105 states. [2019-12-27 20:01:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18105 to 13117. [2019-12-27 20:01:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13117 states. [2019-12-27 20:01:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13117 states to 13117 states and 40802 transitions. [2019-12-27 20:01:09,228 INFO L78 Accepts]: Start accepts. Automaton has 13117 states and 40802 transitions. Word has length 64 [2019-12-27 20:01:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:09,228 INFO L462 AbstractCegarLoop]: Abstraction has 13117 states and 40802 transitions. [2019-12-27 20:01:09,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 13117 states and 40802 transitions. [2019-12-27 20:01:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:01:09,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:09,243 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] [2019-12-27 20:01:09,243 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 20:01:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 529429650, now seen corresponding path program 1 times [2019-12-27 20:01:09,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:09,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475672290] [2019-12-27 20:01:09,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:09,352 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 20:01:09,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475672290] [2019-12-27 20:01:09,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:09,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:01:09,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746532715] [2019-12-27 20:01:09,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:09,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:09,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 20:01:09,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:09,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:01:09,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:01:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:01:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:01:09,737 INFO L87 Difference]: Start difference. First operand 13117 states and 40802 transitions. Second operand 9 states. [2019-12-27 20:01:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:11,673 INFO L93 Difference]: Finished difference Result 56381 states and 171825 transitions. [2019-12-27 20:01:11,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:01:11,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 20:01:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:11,735 INFO L225 Difference]: With dead ends: 56381 [2019-12-27 20:01:11,735 INFO L226 Difference]: Without dead ends: 41488 [2019-12-27 20:01:11,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:01:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41488 states. [2019-12-27 20:01:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41488 to 15884. [2019-12-27 20:01:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15884 states. [2019-12-27 20:01:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15884 states to 15884 states and 49663 transitions. [2019-12-27 20:01:12,204 INFO L78 Accepts]: Start accepts. Automaton has 15884 states and 49663 transitions. Word has length 64 [2019-12-27 20:01:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:12,205 INFO L462 AbstractCegarLoop]: Abstraction has 15884 states and 49663 transitions. [2019-12-27 20:01:12,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:01:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15884 states and 49663 transitions. [2019-12-27 20:01:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:01:12,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:12,225 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] [2019-12-27 20:01:12,225 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 20:01:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash -660129416, now seen corresponding path program 2 times [2019-12-27 20:01:12,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:12,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954885076] [2019-12-27 20:01:12,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:12,328 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 20:01:12,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954885076] [2019-12-27 20:01:12,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:12,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:01:12,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957684957] [2019-12-27 20:01:12,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:12,351 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:12,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 545 transitions. [2019-12-27 20:01:12,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:12,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:01:12,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:01:12,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:01:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:01:12,676 INFO L87 Difference]: Start difference. First operand 15884 states and 49663 transitions. Second operand 10 states. [2019-12-27 20:01:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:13,336 INFO L93 Difference]: Finished difference Result 41934 states and 128892 transitions. [2019-12-27 20:01:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:01:13,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 20:01:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:13,382 INFO L225 Difference]: With dead ends: 41934 [2019-12-27 20:01:13,382 INFO L226 Difference]: Without dead ends: 30465 [2019-12-27 20:01:13,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:01:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30465 states. [2019-12-27 20:01:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30465 to 18556. [2019-12-27 20:01:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18556 states. [2019-12-27 20:01:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18556 states to 18556 states and 58034 transitions. [2019-12-27 20:01:13,782 INFO L78 Accepts]: Start accepts. Automaton has 18556 states and 58034 transitions. Word has length 64 [2019-12-27 20:01:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:13,782 INFO L462 AbstractCegarLoop]: Abstraction has 18556 states and 58034 transitions. [2019-12-27 20:01:13,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:01:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18556 states and 58034 transitions. [2019-12-27 20:01:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:01:13,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:13,809 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] [2019-12-27 20:01:13,809 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 20:01:13,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1274071658, now seen corresponding path program 3 times [2019-12-27 20:01:13,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:13,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314435077] [2019-12-27 20:01:13,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:13,927 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 20:01:13,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314435077] [2019-12-27 20:01:13,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:13,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:01:13,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779397643] [2019-12-27 20:01:13,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:13,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:14,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 485 transitions. [2019-12-27 20:01:14,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:14,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:01:14,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:01:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:01:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:01:14,427 INFO L87 Difference]: Start difference. First operand 18556 states and 58034 transitions. Second operand 12 states. [2019-12-27 20:01:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:17,654 INFO L93 Difference]: Finished difference Result 96621 states and 295035 transitions. [2019-12-27 20:01:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 20:01:17,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 20:01:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:17,827 INFO L225 Difference]: With dead ends: 96621 [2019-12-27 20:01:17,828 INFO L226 Difference]: Without dead ends: 77114 [2019-12-27 20:01:17,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=2447, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:01:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77114 states. [2019-12-27 20:01:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77114 to 22048. [2019-12-27 20:01:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2019-12-27 20:01:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 69633 transitions. [2019-12-27 20:01:18,917 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 69633 transitions. Word has length 64 [2019-12-27 20:01:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 22048 states and 69633 transitions. [2019-12-27 20:01:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:01:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 69633 transitions. [2019-12-27 20:01:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:01:18,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:18,941 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] [2019-12-27 20:01:18,943 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 20:01:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash 780788010, now seen corresponding path program 4 times [2019-12-27 20:01:18,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:18,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183132401] [2019-12-27 20:01:18,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:19,071 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 20:01:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183132401] [2019-12-27 20:01:19,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:19,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:19,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019247099] [2019-12-27 20:01:19,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:19,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:19,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 20:01:19,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:19,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:01:19,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:01:19,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:01:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:01:19,401 INFO L87 Difference]: Start difference. First operand 22048 states and 69633 transitions. Second operand 4 states. [2019-12-27 20:01:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:19,756 INFO L93 Difference]: Finished difference Result 27217 states and 83137 transitions. [2019-12-27 20:01:19,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:19,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 20:01:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:19,806 INFO L225 Difference]: With dead ends: 27217 [2019-12-27 20:01:19,806 INFO L226 Difference]: Without dead ends: 27217 [2019-12-27 20:01:19,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27217 states. [2019-12-27 20:01:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27217 to 17747. [2019-12-27 20:01:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17747 states. [2019-12-27 20:01:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17747 states to 17747 states and 54684 transitions. [2019-12-27 20:01:20,142 INFO L78 Accepts]: Start accepts. Automaton has 17747 states and 54684 transitions. Word has length 64 [2019-12-27 20:01:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:20,143 INFO L462 AbstractCegarLoop]: Abstraction has 17747 states and 54684 transitions. [2019-12-27 20:01:20,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:01:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17747 states and 54684 transitions. [2019-12-27 20:01:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:01:20,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:20,160 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 20:01:20,160 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 20:01:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 435603939, now seen corresponding path program 1 times [2019-12-27 20:01:20,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:20,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865819571] [2019-12-27 20:01:20,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:20,273 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 20:01:20,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865819571] [2019-12-27 20:01:20,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:20,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:01:20,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657305667] [2019-12-27 20:01:20,274 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:20,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:20,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 432 transitions. [2019-12-27 20:01:20,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:20,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:01:20,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:01:20,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:01:20,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:01:20,990 INFO L87 Difference]: Start difference. First operand 17747 states and 54684 transitions. Second operand 10 states. [2019-12-27 20:01:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:22,755 INFO L93 Difference]: Finished difference Result 32107 states and 96172 transitions. [2019-12-27 20:01:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:01:22,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 20:01:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:22,811 INFO L225 Difference]: With dead ends: 32107 [2019-12-27 20:01:22,812 INFO L226 Difference]: Without dead ends: 31939 [2019-12-27 20:01:22,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:01:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31939 states. [2019-12-27 20:01:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31939 to 25811. [2019-12-27 20:01:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25811 states. [2019-12-27 20:01:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25811 states to 25811 states and 78299 transitions. [2019-12-27 20:01:23,254 INFO L78 Accepts]: Start accepts. Automaton has 25811 states and 78299 transitions. Word has length 65 [2019-12-27 20:01:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:23,254 INFO L462 AbstractCegarLoop]: Abstraction has 25811 states and 78299 transitions. [2019-12-27 20:01:23,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:01:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 25811 states and 78299 transitions. [2019-12-27 20:01:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:01:23,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:23,287 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 20:01:23,287 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 20:01:23,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1016984719, now seen corresponding path program 2 times [2019-12-27 20:01:23,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:23,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402447528] [2019-12-27 20:01:23,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:23,448 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 20:01:23,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402447528] [2019-12-27 20:01:23,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:23,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:01:23,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811480664] [2019-12-27 20:01:23,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:23,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:23,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 594 transitions. [2019-12-27 20:01:23,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:24,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:01:24,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:01:24,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:01:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:01:24,078 INFO L87 Difference]: Start difference. First operand 25811 states and 78299 transitions. Second operand 18 states. [2019-12-27 20:01:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:36,080 INFO L93 Difference]: Finished difference Result 98808 states and 293346 transitions. [2019-12-27 20:01:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-27 20:01:36,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 20:01:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:36,234 INFO L225 Difference]: With dead ends: 98808 [2019-12-27 20:01:36,235 INFO L226 Difference]: Without dead ends: 98592 [2019-12-27 20:01:36,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2747 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1361, Invalid=7011, Unknown=0, NotChecked=0, Total=8372 [2019-12-27 20:01:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98592 states. [2019-12-27 20:01:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98592 to 35402. [2019-12-27 20:01:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35402 states. [2019-12-27 20:01:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35402 states to 35402 states and 108495 transitions. [2019-12-27 20:01:37,608 INFO L78 Accepts]: Start accepts. Automaton has 35402 states and 108495 transitions. Word has length 65 [2019-12-27 20:01:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:37,609 INFO L462 AbstractCegarLoop]: Abstraction has 35402 states and 108495 transitions. [2019-12-27 20:01:37,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:01:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35402 states and 108495 transitions. [2019-12-27 20:01:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:01:37,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:37,650 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 20:01:37,650 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 20:01:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 634095249, now seen corresponding path program 3 times [2019-12-27 20:01:37,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:37,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900138677] [2019-12-27 20:01:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:37,874 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 20:01:37,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900138677] [2019-12-27 20:01:37,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:37,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:01:37,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47897157] [2019-12-27 20:01:37,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:37,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:38,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 339 states and 710 transitions. [2019-12-27 20:01:38,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:39,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:01:39,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:39,526 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-12-27 20:01:39,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:39,800 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-27 20:01:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:40,050 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-27 20:01:40,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:01:40,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:40,316 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 20:01:40,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 62 times. [2019-12-27 20:01:40,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 20:01:40,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 20:01:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:01:40,318 INFO L87 Difference]: Start difference. First operand 35402 states and 108495 transitions. Second operand 29 states. [2019-12-27 20:01:42,962 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 20:01:43,911 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 20:01:51,318 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 20:01:52,122 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-27 20:01:52,502 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 20:01:53,544 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 20:01:54,059 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 20:01:55,128 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 20:01:58,457 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-12-27 20:02:01,078 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-27 20:02:02,083 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 20:02:03,837 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 20:02:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:05,247 INFO L93 Difference]: Finished difference Result 122083 states and 362127 transitions. [2019-12-27 20:02:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-12-27 20:02:05,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2019-12-27 20:02:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:05,428 INFO L225 Difference]: With dead ends: 122083 [2019-12-27 20:02:05,428 INFO L226 Difference]: Without dead ends: 122083 [2019-12-27 20:02:05,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 21 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8774 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3495, Invalid=20375, Unknown=0, NotChecked=0, Total=23870 [2019-12-27 20:02:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122083 states. [2019-12-27 20:02:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122083 to 33217. [2019-12-27 20:02:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33217 states. [2019-12-27 20:02:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33217 states to 33217 states and 102043 transitions. [2019-12-27 20:02:06,696 INFO L78 Accepts]: Start accepts. Automaton has 33217 states and 102043 transitions. Word has length 65 [2019-12-27 20:02:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:06,696 INFO L462 AbstractCegarLoop]: Abstraction has 33217 states and 102043 transitions. [2019-12-27 20:02:06,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 20:02:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33217 states and 102043 transitions. [2019-12-27 20:02:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:06,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:06,738 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 20:02:06,738 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 20:02:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 105946211, now seen corresponding path program 4 times [2019-12-27 20:02:06,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:06,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12278097] [2019-12-27 20:02:06,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:06,927 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 20:02:06,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12278097] [2019-12-27 20:02:06,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:06,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:06,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634808405] [2019-12-27 20:02:06,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:06,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:07,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 307 transitions. [2019-12-27 20:02:07,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:07,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:02:07,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:02:07,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:02:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:02:07,499 INFO L87 Difference]: Start difference. First operand 33217 states and 102043 transitions. Second operand 13 states. [2019-12-27 20:02:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:09,824 INFO L93 Difference]: Finished difference Result 61174 states and 187362 transitions. [2019-12-27 20:02:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:02:09,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:02:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:09,888 INFO L225 Difference]: With dead ends: 61174 [2019-12-27 20:02:09,889 INFO L226 Difference]: Without dead ends: 46241 [2019-12-27 20:02:09,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:02:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46241 states. [2019-12-27 20:02:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46241 to 34338. [2019-12-27 20:02:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34338 states. [2019-12-27 20:02:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34338 states to 34338 states and 105086 transitions. [2019-12-27 20:02:10,508 INFO L78 Accepts]: Start accepts. Automaton has 34338 states and 105086 transitions. Word has length 65 [2019-12-27 20:02:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:10,509 INFO L462 AbstractCegarLoop]: Abstraction has 34338 states and 105086 transitions. [2019-12-27 20:02:10,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:02:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34338 states and 105086 transitions. [2019-12-27 20:02:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:10,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:10,553 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 20:02:10,554 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 20:02:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash 5375677, now seen corresponding path program 5 times [2019-12-27 20:02:10,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:10,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116849311] [2019-12-27 20:02:10,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:10,618 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 20:02:10,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116849311] [2019-12-27 20:02:10,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:10,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:10,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026512673] [2019-12-27 20:02:10,619 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:10,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:10,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 554 transitions. [2019-12-27 20:02:10,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:10,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:02:10,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:10,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:10,971 INFO L87 Difference]: Start difference. First operand 34338 states and 105086 transitions. Second operand 5 states. [2019-12-27 20:02:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:11,349 INFO L93 Difference]: Finished difference Result 36439 states and 110920 transitions. [2019-12-27 20:02:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:11,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 20:02:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:11,406 INFO L225 Difference]: With dead ends: 36439 [2019-12-27 20:02:11,406 INFO L226 Difference]: Without dead ends: 36439 [2019-12-27 20:02:11,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36439 states. [2019-12-27 20:02:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36439 to 34727. [2019-12-27 20:02:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34727 states. [2019-12-27 20:02:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34727 states to 34727 states and 106241 transitions. [2019-12-27 20:02:12,190 INFO L78 Accepts]: Start accepts. Automaton has 34727 states and 106241 transitions. Word has length 65 [2019-12-27 20:02:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:12,190 INFO L462 AbstractCegarLoop]: Abstraction has 34727 states and 106241 transitions. [2019-12-27 20:02:12,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34727 states and 106241 transitions. [2019-12-27 20:02:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:12,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:12,230 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 20:02:12,230 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 20:02:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash 748878059, now seen corresponding path program 6 times [2019-12-27 20:02:12,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:12,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210970591] [2019-12-27 20:02:12,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:12,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210970591] [2019-12-27 20:02:12,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:12,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:12,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134278943] [2019-12-27 20:02:12,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:12,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:12,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 387 transitions. [2019-12-27 20:02:12,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:12,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:02:12,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:02:12,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:02:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:02:12,848 INFO L87 Difference]: Start difference. First operand 34727 states and 106241 transitions. Second operand 14 states. [2019-12-27 20:02:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:15,096 INFO L93 Difference]: Finished difference Result 52249 states and 158469 transitions. [2019-12-27 20:02:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:02:15,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 20:02:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:15,164 INFO L225 Difference]: With dead ends: 52249 [2019-12-27 20:02:15,164 INFO L226 Difference]: Without dead ends: 46952 [2019-12-27 20:02:15,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:02:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46952 states. [2019-12-27 20:02:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46952 to 34621. [2019-12-27 20:02:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34621 states. [2019-12-27 20:02:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34621 states to 34621 states and 105917 transitions. [2019-12-27 20:02:15,787 INFO L78 Accepts]: Start accepts. Automaton has 34621 states and 105917 transitions. Word has length 65 [2019-12-27 20:02:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:15,787 INFO L462 AbstractCegarLoop]: Abstraction has 34621 states and 105917 transitions. [2019-12-27 20:02:15,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:02:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 34621 states and 105917 transitions. [2019-12-27 20:02:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:15,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:15,825 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 20:02:15,825 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 20:02:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1442745497, now seen corresponding path program 7 times [2019-12-27 20:02:15,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:15,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088133927] [2019-12-27 20:02:15,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:16,003 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 20:02:16,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088133927] [2019-12-27 20:02:16,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:16,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:16,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889576905] [2019-12-27 20:02:16,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:16,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:16,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 357 transitions. [2019-12-27 20:02:16,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:16,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:02:16,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:02:16,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:02:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:02:16,780 INFO L87 Difference]: Start difference. First operand 34621 states and 105917 transitions. Second operand 16 states. [2019-12-27 20:02:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:21,462 INFO L93 Difference]: Finished difference Result 90556 states and 278505 transitions. [2019-12-27 20:02:21,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 20:02:21,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 20:02:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:21,566 INFO L225 Difference]: With dead ends: 90556 [2019-12-27 20:02:21,566 INFO L226 Difference]: Without dead ends: 62026 [2019-12-27 20:02:21,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=613, Invalid=2579, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:02:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62026 states. [2019-12-27 20:02:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62026 to 39986. [2019-12-27 20:02:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39986 states. [2019-12-27 20:02:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39986 states to 39986 states and 123083 transitions. [2019-12-27 20:02:22,405 INFO L78 Accepts]: Start accepts. Automaton has 39986 states and 123083 transitions. Word has length 65 [2019-12-27 20:02:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:22,406 INFO L462 AbstractCegarLoop]: Abstraction has 39986 states and 123083 transitions. [2019-12-27 20:02:22,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:02:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39986 states and 123083 transitions. [2019-12-27 20:02:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:22,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:22,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:22,454 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 20:02:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1603050669, now seen corresponding path program 8 times [2019-12-27 20:02:22,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:22,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406231044] [2019-12-27 20:02:22,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:22,641 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 20:02:22,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406231044] [2019-12-27 20:02:22,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:22,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:22,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897019283] [2019-12-27 20:02:22,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:22,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:22,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 369 transitions. [2019-12-27 20:02:22,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:02:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:23,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:02:23,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:02:23,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:02:23,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:02:23,257 INFO L87 Difference]: Start difference. First operand 39986 states and 123083 transitions. Second operand 18 states. [2019-12-27 20:02:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:29,404 INFO L93 Difference]: Finished difference Result 67048 states and 204007 transitions. [2019-12-27 20:02:29,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:02:29,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-27 20:02:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:29,499 INFO L225 Difference]: With dead ends: 67048 [2019-12-27 20:02:29,499 INFO L226 Difference]: Without dead ends: 58647 [2019-12-27 20:02:29,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:02:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58647 states. [2019-12-27 20:02:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58647 to 39074. [2019-12-27 20:02:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39074 states. [2019-12-27 20:02:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39074 states to 39074 states and 120389 transitions. [2019-12-27 20:02:30,322 INFO L78 Accepts]: Start accepts. Automaton has 39074 states and 120389 transitions. Word has length 65 [2019-12-27 20:02:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:30,322 INFO L462 AbstractCegarLoop]: Abstraction has 39074 states and 120389 transitions. [2019-12-27 20:02:30,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:02:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39074 states and 120389 transitions. [2019-12-27 20:02:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:30,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:30,368 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 20:02:30,368 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 20:02:30,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash -698261085, now seen corresponding path program 9 times [2019-12-27 20:02:30,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:30,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266149881] [2019-12-27 20:02:30,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:30,542 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 20:02:30,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266149881] [2019-12-27 20:02:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:02:30,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137681934] [2019-12-27 20:02:30,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:30,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:30,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 331 transitions. [2019-12-27 20:02:30,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:30,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:31,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:02:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:02:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:02:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:02:31,141 INFO L87 Difference]: Start difference. First operand 39074 states and 120389 transitions. Second operand 17 states. [2019-12-27 20:02:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:34,221 INFO L93 Difference]: Finished difference Result 64752 states and 196577 transitions. [2019-12-27 20:02:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:02:34,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-12-27 20:02:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:34,321 INFO L225 Difference]: With dead ends: 64752 [2019-12-27 20:02:34,321 INFO L226 Difference]: Without dead ends: 64752 [2019-12-27 20:02:34,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:02:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64752 states. [2019-12-27 20:02:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64752 to 41500. [2019-12-27 20:02:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41500 states. [2019-12-27 20:02:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41500 states to 41500 states and 127685 transitions. [2019-12-27 20:02:35,162 INFO L78 Accepts]: Start accepts. Automaton has 41500 states and 127685 transitions. Word has length 65 [2019-12-27 20:02:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:35,162 INFO L462 AbstractCegarLoop]: Abstraction has 41500 states and 127685 transitions. [2019-12-27 20:02:35,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:02:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 41500 states and 127685 transitions. [2019-12-27 20:02:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:35,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:35,214 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 20:02:35,214 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 20:02:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2046779559, now seen corresponding path program 10 times [2019-12-27 20:02:35,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:35,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895229770] [2019-12-27 20:02:35,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:35,335 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 20:02:35,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895229770] [2019-12-27 20:02:35,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:35,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:02:35,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616019919] [2019-12-27 20:02:35,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:35,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:35,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 386 transitions. [2019-12-27 20:02:35,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:35,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:02:35,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:02:35,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:02:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:02:35,836 INFO L87 Difference]: Start difference. First operand 41500 states and 127685 transitions. Second operand 11 states. [2019-12-27 20:02:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:37,463 INFO L93 Difference]: Finished difference Result 50871 states and 154014 transitions. [2019-12-27 20:02:37,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:02:37,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:02:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:37,537 INFO L225 Difference]: With dead ends: 50871 [2019-12-27 20:02:37,537 INFO L226 Difference]: Without dead ends: 50871 [2019-12-27 20:02:37,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:02:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50871 states. [2019-12-27 20:02:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50871 to 42992. [2019-12-27 20:02:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42992 states. [2019-12-27 20:02:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42992 states to 42992 states and 131792 transitions. [2019-12-27 20:02:38,545 INFO L78 Accepts]: Start accepts. Automaton has 42992 states and 131792 transitions. Word has length 65 [2019-12-27 20:02:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:38,545 INFO L462 AbstractCegarLoop]: Abstraction has 42992 states and 131792 transitions. [2019-12-27 20:02:38,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:02:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 42992 states and 131792 transitions. [2019-12-27 20:02:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:38,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:38,598 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 20:02:38,598 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 20:02:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1137125635, now seen corresponding path program 11 times [2019-12-27 20:02:38,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:38,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766940503] [2019-12-27 20:02:38,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:39,066 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 20:02:39,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766940503] [2019-12-27 20:02:39,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:02:39,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200981415] [2019-12-27 20:02:39,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:39,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:39,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 20:02:39,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:02:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:40,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:02:40,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 20:02:40,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 20:02:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:02:40,034 INFO L87 Difference]: Start difference. First operand 42992 states and 131792 transitions. Second operand 29 states. [2019-12-27 20:02:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:51,882 INFO L93 Difference]: Finished difference Result 59278 states and 179601 transitions. [2019-12-27 20:02:51,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 20:02:51,882 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2019-12-27 20:02:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:51,965 INFO L225 Difference]: With dead ends: 59278 [2019-12-27 20:02:51,965 INFO L226 Difference]: Without dead ends: 55571 [2019-12-27 20:02:51,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=653, Invalid=4459, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 20:02:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55571 states. [2019-12-27 20:02:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55571 to 43311. [2019-12-27 20:02:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43311 states. [2019-12-27 20:02:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43311 states to 43311 states and 132745 transitions. [2019-12-27 20:02:52,713 INFO L78 Accepts]: Start accepts. Automaton has 43311 states and 132745 transitions. Word has length 65 [2019-12-27 20:02:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:52,714 INFO L462 AbstractCegarLoop]: Abstraction has 43311 states and 132745 transitions. [2019-12-27 20:02:52,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 20:02:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43311 states and 132745 transitions. [2019-12-27 20:02:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:52,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:52,761 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 20:02:52,762 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 20:02:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1313765883, now seen corresponding path program 12 times [2019-12-27 20:02:52,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:52,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921720790] [2019-12-27 20:02:52,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:52,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 20:02:52,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921720790] [2019-12-27 20:02:52,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:52,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:52,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150064559] [2019-12-27 20:02:52,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:52,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:53,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 372 transitions. [2019-12-27 20:02:53,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:53,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:02:53,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:02:53,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:53,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:02:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:02:53,105 INFO L87 Difference]: Start difference. First operand 43311 states and 132745 transitions. Second operand 11 states. [2019-12-27 20:02:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:54,331 INFO L93 Difference]: Finished difference Result 57635 states and 175158 transitions. [2019-12-27 20:02:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:02:54,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:02:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:54,422 INFO L225 Difference]: With dead ends: 57635 [2019-12-27 20:02:54,423 INFO L226 Difference]: Without dead ends: 57635 [2019-12-27 20:02:54,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:02:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57635 states. [2019-12-27 20:02:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57635 to 43403. [2019-12-27 20:02:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43403 states. [2019-12-27 20:02:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43403 states to 43403 states and 133005 transitions. [2019-12-27 20:02:55,548 INFO L78 Accepts]: Start accepts. Automaton has 43403 states and 133005 transitions. Word has length 65 [2019-12-27 20:02:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:55,549 INFO L462 AbstractCegarLoop]: Abstraction has 43403 states and 133005 transitions. [2019-12-27 20:02:55,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:02:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43403 states and 133005 transitions. [2019-12-27 20:02:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:55,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:55,603 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 20:02:55,604 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 20:02:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1996321855, now seen corresponding path program 13 times [2019-12-27 20:02:55,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:55,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659434024] [2019-12-27 20:02:55,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:55,999 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 20:02:56,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659434024] [2019-12-27 20:02:56,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:56,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:02:56,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009867318] [2019-12-27 20:02:56,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:56,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:56,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 403 transitions. [2019-12-27 20:02:56,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:56,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:56,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:56,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:02:56,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 20:02:56,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 20:02:56,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:02:56,746 INFO L87 Difference]: Start difference. First operand 43403 states and 133005 transitions. Second operand 19 states. [2019-12-27 20:03:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:03,346 INFO L93 Difference]: Finished difference Result 90780 states and 270268 transitions. [2019-12-27 20:03:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 20:03:03,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-27 20:03:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:03,475 INFO L225 Difference]: With dead ends: 90780 [2019-12-27 20:03:03,475 INFO L226 Difference]: Without dead ends: 88655 [2019-12-27 20:03:03,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 13 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=589, Invalid=2951, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:03:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88655 states. [2019-12-27 20:03:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88655 to 44187. [2019-12-27 20:03:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44187 states. [2019-12-27 20:03:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44187 states to 44187 states and 135539 transitions. [2019-12-27 20:03:04,844 INFO L78 Accepts]: Start accepts. Automaton has 44187 states and 135539 transitions. Word has length 65 [2019-12-27 20:03:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:04,844 INFO L462 AbstractCegarLoop]: Abstraction has 44187 states and 135539 transitions. [2019-12-27 20:03:04,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 20:03:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44187 states and 135539 transitions. [2019-12-27 20:03:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:03:04,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,892 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 20:03:04,892 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 20:03:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1033858647, now seen corresponding path program 14 times [2019-12-27 20:03:04,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647539514] [2019-12-27 20:03:04,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:04,968 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 20:03:04,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647539514] [2019-12-27 20:03:04,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:04,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:04,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [926466860] [2019-12-27 20:03:04,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:04,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:05,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 358 transitions. [2019-12-27 20:03:05,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:05,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:05,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:05,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:05,220 INFO L87 Difference]: Start difference. First operand 44187 states and 135539 transitions. Second operand 3 states. [2019-12-27 20:03:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,490 INFO L93 Difference]: Finished difference Result 44186 states and 135537 transitions. [2019-12-27 20:03:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:05,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:03:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,608 INFO L225 Difference]: With dead ends: 44186 [2019-12-27 20:03:05,609 INFO L226 Difference]: Without dead ends: 44186 [2019-12-27 20:03:05,611 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 20:03:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44186 states. [2019-12-27 20:03:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44186 to 34398. [2019-12-27 20:03:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34398 states. [2019-12-27 20:03:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34398 states to 34398 states and 107351 transitions. [2019-12-27 20:03:06,731 INFO L78 Accepts]: Start accepts. Automaton has 34398 states and 107351 transitions. Word has length 65 [2019-12-27 20:03:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:06,732 INFO L462 AbstractCegarLoop]: Abstraction has 34398 states and 107351 transitions. [2019-12-27 20:03:06,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34398 states and 107351 transitions. [2019-12-27 20:03:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:03:06,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:06,791 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 20:03:06,791 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 20:03:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:06,792 INFO L82 PathProgramCache]: Analyzing trace with hash -824454758, now seen corresponding path program 1 times [2019-12-27 20:03:06,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:06,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524965591] [2019-12-27 20:03:06,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,230 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 20:03:07,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524965591] [2019-12-27 20:03:07,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:03:07,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1662319837] [2019-12-27 20:03:07,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:07,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:07,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 564 transitions. [2019-12-27 20:03:07,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:03:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:07,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:08,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 20:03:08,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 20:03:08,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 20:03:08,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:03:08,583 INFO L87 Difference]: Start difference. First operand 34398 states and 107351 transitions. Second operand 33 states. [2019-12-27 20:03:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:29,545 INFO L93 Difference]: Finished difference Result 78165 states and 237980 transitions. [2019-12-27 20:03:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 20:03:29,546 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-12-27 20:03:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:29,659 INFO L225 Difference]: With dead ends: 78165 [2019-12-27 20:03:29,659 INFO L226 Difference]: Without dead ends: 69430 [2019-12-27 20:03:29,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4263 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1754, Invalid=12526, Unknown=0, NotChecked=0, Total=14280 [2019-12-27 20:03:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69430 states. [2019-12-27 20:03:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69430 to 34302. [2019-12-27 20:03:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34302 states. [2019-12-27 20:03:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34302 states to 34302 states and 107071 transitions. [2019-12-27 20:03:30,502 INFO L78 Accepts]: Start accepts. Automaton has 34302 states and 107071 transitions. Word has length 66 [2019-12-27 20:03:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:30,502 INFO L462 AbstractCegarLoop]: Abstraction has 34302 states and 107071 transitions. [2019-12-27 20:03:30,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 20:03:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 34302 states and 107071 transitions. [2019-12-27 20:03:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:03:30,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:30,547 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 20:03:30,547 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1161552116, now seen corresponding path program 2 times [2019-12-27 20:03:30,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:30,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506357812] [2019-12-27 20:03:30,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:30,704 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 20:03:30,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506357812] [2019-12-27 20:03:30,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:30,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:03:30,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542200828] [2019-12-27 20:03:30,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:30,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:31,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 545 transitions. [2019-12-27 20:03:31,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:31,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:03:31,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:03:31,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:03:31,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:03:31,434 INFO L87 Difference]: Start difference. First operand 34302 states and 107071 transitions. Second operand 17 states. Received shutdown request... [2019-12-27 20:03:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 20:03:32,517 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 20:03:32,523 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 20:03:32,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:32 BasicIcfg [2019-12-27 20:03:32,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:32,525 INFO L168 Benchmark]: Toolchain (without parser) took 225913.44 ms. Allocated memory was 142.1 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.9 MB in the beginning and 1.1 GB in the end (delta: -982.4 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,525 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.25 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 152.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.31 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,526 INFO L168 Benchmark]: Boogie Preprocessor took 42.07 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,527 INFO L168 Benchmark]: RCFGBuilder took 871.52 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 96.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,527 INFO L168 Benchmark]: TraceAbstraction took 224152.83 ms. Allocated memory was 199.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 96.0 MB in the beginning and 1.1 GB in the end (delta: -985.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:32,529 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.25 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 152.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.31 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.07 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.52 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 96.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224152.83 ms. Allocated memory was 199.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 96.0 MB in the beginning and 1.1 GB in the end (delta: -985.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7327 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 94688 CheckedPairsTotal, 112 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 (34302states) and FLOYD_HOARE automaton (currently 16 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1706 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (34302states) and FLOYD_HOARE automaton (currently 16 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1706 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: TIMEOUT, OverallTime: 223.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 125.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9570 SDtfs, 19871 SDslu, 50291 SDs, 0 SdLazy, 73239 SolverSat, 1690 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1415 GetRequests, 378 SyntacticMatches, 155 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20881 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167419occurred 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: 43.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 536131 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1630 NumberOfCodeBlocks, 1630 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 433652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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