./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c --full-output -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f838d06e3abc608d43ea4f047c9d1e0ab0cacfc -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 22:34:16,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 22:34:16,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 22:34:16,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 22:34:16,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 22:34:16,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 22:34:16,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 22:34:16,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 22:34:16,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 22:34:16,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 22:34:16,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 22:34:16,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 22:34:16,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 22:34:16,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 22:34:16,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 22:34:16,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 22:34:16,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 22:34:16,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 22:34:16,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 22:34:16,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 22:34:16,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 22:34:16,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 22:34:16,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 22:34:16,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 22:34:16,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 22:34:16,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 22:34:16,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 22:34:16,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 22:34:16,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 22:34:16,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 22:34:16,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 22:34:16,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 22:34:16,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 22:34:16,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 22:34:16,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 22:34:16,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 22:34:16,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 22:34:16,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 22:34:16,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 22:34:16,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 22:34:16,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 22:34:16,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 22:34:16,553 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 22:34:16,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 22:34:16,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 22:34:16,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 22:34:16,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 22:34:16,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 22:34:16,557 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 22:34:16,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 22:34:16,558 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 22:34:16,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 22:34:16,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 22:34:16,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 22:34:16,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 22:34:16,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 22:34:16,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 22:34:16,560 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 22:34:16,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 22:34:16,560 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 22:34:16,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 22:34:16,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 22:34:16,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 22:34:16,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 22:34:16,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:34:16,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 22:34:16,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 22:34:16,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 22:34:16,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 22:34:16,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 22:34:16,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 22:34:16,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 22:34:16,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f838d06e3abc608d43ea4f047c9d1e0ab0cacfc [2021-10-05 22:34:16,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 22:34:16,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 22:34:16,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 22:34:16,970 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 22:34:16,971 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 22:34:16,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c [2021-10-05 22:34:17,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/33643f801/0dd5ba69a7334c0aa6fa36b15b9275bb/FLAGe0a91c8ce [2021-10-05 22:34:17,776 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 22:34:17,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c [2021-10-05 22:34:17,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/33643f801/0dd5ba69a7334c0aa6fa36b15b9275bb/FLAGe0a91c8ce [2021-10-05 22:34:18,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/33643f801/0dd5ba69a7334c0aa6fa36b15b9275bb [2021-10-05 22:34:18,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 22:34:18,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 22:34:18,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 22:34:18,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 22:34:18,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 22:34:18,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb0af07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18, skipping insertion in model container [2021-10-05 22:34:18,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 22:34:18,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 22:34:18,389 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c[2628,2641] [2021-10-05 22:34:18,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:34:18,417 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 22:34:18,452 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c[2628,2641] [2021-10-05 22:34:18,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:34:18,474 INFO L208 MainTranslator]: Completed translation [2021-10-05 22:34:18,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18 WrapperNode [2021-10-05 22:34:18,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 22:34:18,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 22:34:18,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 22:34:18,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 22:34:18,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 22:34:18,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 22:34:18,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 22:34:18,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 22:34:18,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 22:34:18,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 22:34:18,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 22:34:18,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 22:34:18,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (1/1) ... [2021-10-05 22:34:18,573 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:34:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 22:34:18,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 22:34:18,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 22:34:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 22:34:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 22:34:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 22:34:18,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 22:34:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 22:34:18,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 22:34:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 22:34:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 22:34:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 22:34:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-05 22:34:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 22:34:18,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 22:34:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 22:34:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 22:34:18,674 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 22:34:19,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 22:34:19,244 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-10-05 22:34:19,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:34:19 BoogieIcfgContainer [2021-10-05 22:34:19,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 22:34:19,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 22:34:19,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 22:34:19,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 22:34:19,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:34:18" (1/3) ... [2021-10-05 22:34:19,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cb85b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:34:19, skipping insertion in model container [2021-10-05 22:34:19,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:34:18" (2/3) ... [2021-10-05 22:34:19,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cb85b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:34:19, skipping insertion in model container [2021-10-05 22:34:19,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:34:19" (3/3) ... [2021-10-05 22:34:19,256 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-1.wvr.c [2021-10-05 22:34:19,263 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 22:34:19,264 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 22:34:19,264 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 22:34:19,264 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 22:34:19,304 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,304 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,305 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,305 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,305 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,306 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,306 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,306 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,307 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,307 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,307 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,307 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,308 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,308 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,308 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,309 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,309 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,309 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,310 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,311 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,312 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,313 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,313 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,313 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,314 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,314 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,316 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,316 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,317 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,317 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,317 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,318 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,318 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,318 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,319 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,319 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,319 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,321 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,321 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,321 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,321 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,323 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,323 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,323 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,323 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,324 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,324 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,325 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,329 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,330 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,343 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,343 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,367 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:34:19,399 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 22:34:19,477 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 22:34:19,490 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 22:34:19,490 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 22:34:19,539 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 22:34:19,558 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 174 transitions, 372 flow [2021-10-05 22:34:19,563 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 174 transitions, 372 flow [2021-10-05 22:34:19,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 174 transitions, 372 flow [2021-10-05 22:34:19,705 INFO L129 PetriNetUnfolder]: 13/171 cut-off events. [2021-10-05 22:34:19,705 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 22:34:19,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 171 events. 13/171 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2021-10-05 22:34:19,724 INFO L116 LiptonReduction]: Number of co-enabled transitions 2174 [2021-10-05 22:34:28,156 INFO L131 LiptonReduction]: Checked pairs total: 5570 [2021-10-05 22:34:28,156 INFO L133 LiptonReduction]: Total number of compositions: 161 [2021-10-05 22:34:28,167 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 38 transitions, 100 flow [2021-10-05 22:34:28,210 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:28,235 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:28,236 INFO L512 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] [2021-10-05 22:34:28,236 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 47776134, now seen corresponding path program 1 times [2021-10-05 22:34:28,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:28,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599874189] [2021-10-05 22:34:28,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:28,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:28,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:28,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599874189] [2021-10-05 22:34:28,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599874189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:28,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:28,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:28,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679878905] [2021-10-05 22:34:29,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:29,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:29,029 INFO L87 Difference]: Start difference. First operand has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:30,248 INFO L93 Difference]: Finished difference Result 2270 states and 6886 transitions. [2021-10-05 22:34:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:34:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:30,311 INFO L225 Difference]: With dead ends: 2270 [2021-10-05 22:34:30,312 INFO L226 Difference]: Without dead ends: 1670 [2021-10-05 22:34:30,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 501.2ms TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 22:34:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-10-05 22:34:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 635. [2021-10-05 22:34:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 3.1009463722397475) internal successors, (1966), 634 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1966 transitions. [2021-10-05 22:34:30,449 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1966 transitions. Word has length 23 [2021-10-05 22:34:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:30,450 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 1966 transitions. [2021-10-05 22:34:30,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1966 transitions. [2021-10-05 22:34:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:30,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:30,466 INFO L512 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] [2021-10-05 22:34:30,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 22:34:30,467 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1590489032, now seen corresponding path program 2 times [2021-10-05 22:34:30,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:30,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776987083] [2021-10-05 22:34:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:30,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:30,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:30,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776987083] [2021-10-05 22:34:30,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776987083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:30,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:30,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 22:34:30,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569766585] [2021-10-05 22:34:30,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:30,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:30,735 INFO L87 Difference]: Start difference. First operand 635 states and 1966 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:30,956 INFO L93 Difference]: Finished difference Result 886 states and 2682 transitions. [2021-10-05 22:34:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:30,963 INFO L225 Difference]: With dead ends: 886 [2021-10-05 22:34:30,964 INFO L226 Difference]: Without dead ends: 747 [2021-10-05 22:34:30,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 93.1ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:34:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-10-05 22:34:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2021-10-05 22:34:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.046916890080429) internal successors, (2273), 746 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2273 transitions. [2021-10-05 22:34:31,002 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2273 transitions. Word has length 23 [2021-10-05 22:34:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:31,003 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 2273 transitions. [2021-10-05 22:34:31,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2273 transitions. [2021-10-05 22:34:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:31,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:31,007 INFO L512 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] [2021-10-05 22:34:31,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 22:34:31,008 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1743554128, now seen corresponding path program 3 times [2021-10-05 22:34:31,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:31,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302720449] [2021-10-05 22:34:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:31,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:31,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:31,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302720449] [2021-10-05 22:34:31,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302720449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:31,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:31,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:31,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045003195] [2021-10-05 22:34:31,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:31,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:31,259 INFO L87 Difference]: Start difference. First operand 747 states and 2273 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:32,018 INFO L93 Difference]: Finished difference Result 1942 states and 5934 transitions. [2021-10-05 22:34:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 22:34:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:32,034 INFO L225 Difference]: With dead ends: 1942 [2021-10-05 22:34:32,034 INFO L226 Difference]: Without dead ends: 1714 [2021-10-05 22:34:32,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 411.3ms TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2021-10-05 22:34:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-10-05 22:34:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 770. [2021-10-05 22:34:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 3.037711313394018) internal successors, (2336), 769 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2336 transitions. [2021-10-05 22:34:32,084 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2336 transitions. Word has length 23 [2021-10-05 22:34:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:32,084 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 2336 transitions. [2021-10-05 22:34:32,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2336 transitions. [2021-10-05 22:34:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:32,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:32,089 INFO L512 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] [2021-10-05 22:34:32,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 22:34:32,089 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -599620558, now seen corresponding path program 4 times [2021-10-05 22:34:32,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:32,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195193884] [2021-10-05 22:34:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:32,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:32,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:32,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195193884] [2021-10-05 22:34:32,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195193884] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:32,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:32,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:32,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612186343] [2021-10-05 22:34:32,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:32,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:32,277 INFO L87 Difference]: Start difference. First operand 770 states and 2336 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:33,267 INFO L93 Difference]: Finished difference Result 2490 states and 7572 transitions. [2021-10-05 22:34:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-05 22:34:33,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:33,287 INFO L225 Difference]: With dead ends: 2490 [2021-10-05 22:34:33,287 INFO L226 Difference]: Without dead ends: 2118 [2021-10-05 22:34:33,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 490.7ms TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2021-10-05 22:34:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2021-10-05 22:34:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 784. [2021-10-05 22:34:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 3.0319284802043422) internal successors, (2374), 783 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2374 transitions. [2021-10-05 22:34:33,358 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 2374 transitions. Word has length 23 [2021-10-05 22:34:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:33,359 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 2374 transitions. [2021-10-05 22:34:33,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 2374 transitions. [2021-10-05 22:34:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:33,363 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:33,364 INFO L512 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] [2021-10-05 22:34:33,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 22:34:33,364 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1988332682, now seen corresponding path program 5 times [2021-10-05 22:34:33,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:33,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848982051] [2021-10-05 22:34:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:33,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:33,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:33,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848982051] [2021-10-05 22:34:33,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848982051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:33,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:33,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:33,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086325678] [2021-10-05 22:34:33,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:33,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:33,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:33,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:33,583 INFO L87 Difference]: Start difference. First operand 784 states and 2374 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:34,583 INFO L93 Difference]: Finished difference Result 2612 states and 7972 transitions. [2021-10-05 22:34:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-05 22:34:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:34,604 INFO L225 Difference]: With dead ends: 2612 [2021-10-05 22:34:34,605 INFO L226 Difference]: Without dead ends: 2240 [2021-10-05 22:34:34,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 534.8ms TimeCoverageRelationStatistics Valid=531, Invalid=2019, Unknown=0, NotChecked=0, Total=2550 [2021-10-05 22:34:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2021-10-05 22:34:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 804. [2021-10-05 22:34:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 3.0423412204234124) internal successors, (2443), 803 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2443 transitions. [2021-10-05 22:34:34,660 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2443 transitions. Word has length 23 [2021-10-05 22:34:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:34,660 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 2443 transitions. [2021-10-05 22:34:34,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2443 transitions. [2021-10-05 22:34:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:34,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:34,666 INFO L512 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] [2021-10-05 22:34:34,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 22:34:34,666 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -973371580, now seen corresponding path program 6 times [2021-10-05 22:34:34,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:34,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391419386] [2021-10-05 22:34:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:34,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:34,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:34,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391419386] [2021-10-05 22:34:34,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391419386] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:34,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:34,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 22:34:34,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002435037] [2021-10-05 22:34:34,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 22:34:34,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:34,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 22:34:34,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-05 22:34:34,801 INFO L87 Difference]: Start difference. First operand 804 states and 2443 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:35,035 INFO L93 Difference]: Finished difference Result 996 states and 3001 transitions. [2021-10-05 22:34:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:35,044 INFO L225 Difference]: With dead ends: 996 [2021-10-05 22:34:35,045 INFO L226 Difference]: Without dead ends: 869 [2021-10-05 22:34:35,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 112.0ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:34:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2021-10-05 22:34:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2021-10-05 22:34:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 3.0299539170506913) internal successors, (2630), 868 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2630 transitions. [2021-10-05 22:34:35,077 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2630 transitions. Word has length 23 [2021-10-05 22:34:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:35,078 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2630 transitions. [2021-10-05 22:34:35,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2630 transitions. [2021-10-05 22:34:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:35,082 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:35,082 INFO L512 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] [2021-10-05 22:34:35,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 22:34:35,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1683954164, now seen corresponding path program 7 times [2021-10-05 22:34:35,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:35,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630669819] [2021-10-05 22:34:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:35,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:35,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:35,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630669819] [2021-10-05 22:34:35,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630669819] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:35,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:35,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:35,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443457165] [2021-10-05 22:34:35,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:35,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:35,262 INFO L87 Difference]: Start difference. First operand 869 states and 2630 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:36,121 INFO L93 Difference]: Finished difference Result 2558 states and 7752 transitions. [2021-10-05 22:34:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 22:34:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:36,142 INFO L225 Difference]: With dead ends: 2558 [2021-10-05 22:34:36,142 INFO L226 Difference]: Without dead ends: 2393 [2021-10-05 22:34:36,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 428.2ms TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 22:34:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2021-10-05 22:34:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 875. [2021-10-05 22:34:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 3.0274599542334095) internal successors, (2646), 874 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2646 transitions. [2021-10-05 22:34:36,192 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 2646 transitions. Word has length 23 [2021-10-05 22:34:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:36,193 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 2646 transitions. [2021-10-05 22:34:36,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 2646 transitions. [2021-10-05 22:34:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:36,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:36,198 INFO L512 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] [2021-10-05 22:34:36,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 22:34:36,198 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash -76451148, now seen corresponding path program 8 times [2021-10-05 22:34:36,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:36,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422427551] [2021-10-05 22:34:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:36,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:36,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:36,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422427551] [2021-10-05 22:34:36,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422427551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:36,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:36,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:36,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92318979] [2021-10-05 22:34:36,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:36,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:36,429 INFO L87 Difference]: Start difference. First operand 875 states and 2646 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:37,202 INFO L93 Difference]: Finished difference Result 2432 states and 7399 transitions. [2021-10-05 22:34:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 22:34:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:37,222 INFO L225 Difference]: With dead ends: 2432 [2021-10-05 22:34:37,222 INFO L226 Difference]: Without dead ends: 2267 [2021-10-05 22:34:37,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 424.4ms TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2021-10-05 22:34:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2021-10-05 22:34:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 869. [2021-10-05 22:34:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 3.0299539170506913) internal successors, (2630), 868 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2630 transitions. [2021-10-05 22:34:37,272 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2630 transitions. Word has length 23 [2021-10-05 22:34:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:37,272 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2630 transitions. [2021-10-05 22:34:37,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2630 transitions. [2021-10-05 22:34:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:37,276 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:37,276 INFO L512 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] [2021-10-05 22:34:37,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 22:34:37,276 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:37,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1374913638, now seen corresponding path program 9 times [2021-10-05 22:34:37,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:37,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115367009] [2021-10-05 22:34:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:37,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:37,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:37,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115367009] [2021-10-05 22:34:37,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115367009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:37,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:37,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:37,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653652318] [2021-10-05 22:34:37,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:37,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:37,443 INFO L87 Difference]: Start difference. First operand 869 states and 2630 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:37,740 INFO L93 Difference]: Finished difference Result 1016 states and 3047 transitions. [2021-10-05 22:34:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:34:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:37,747 INFO L225 Difference]: With dead ends: 1016 [2021-10-05 22:34:37,748 INFO L226 Difference]: Without dead ends: 889 [2021-10-05 22:34:37,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 164.1ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:34:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-10-05 22:34:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 829. [2021-10-05 22:34:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.0277777777777777) internal successors, (2507), 828 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2507 transitions. [2021-10-05 22:34:37,777 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2507 transitions. Word has length 23 [2021-10-05 22:34:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:37,778 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 2507 transitions. [2021-10-05 22:34:37,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2507 transitions. [2021-10-05 22:34:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:37,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:37,781 INFO L512 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] [2021-10-05 22:34:37,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 22:34:37,782 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash 410192184, now seen corresponding path program 10 times [2021-10-05 22:34:37,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:37,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430687053] [2021-10-05 22:34:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:37,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:37,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:37,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430687053] [2021-10-05 22:34:37,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430687053] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:37,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:37,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:37,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599313349] [2021-10-05 22:34:37,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:37,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:37,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:37,943 INFO L87 Difference]: Start difference. First operand 829 states and 2507 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:38,302 INFO L93 Difference]: Finished difference Result 1656 states and 5041 transitions. [2021-10-05 22:34:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:34:38,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:38,312 INFO L225 Difference]: With dead ends: 1656 [2021-10-05 22:34:38,313 INFO L226 Difference]: Without dead ends: 1517 [2021-10-05 22:34:38,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 195.8ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-10-05 22:34:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 816. [2021-10-05 22:34:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 3.0343558282208587) internal successors, (2473), 815 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2473 transitions. [2021-10-05 22:34:38,350 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2473 transitions. Word has length 23 [2021-10-05 22:34:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:38,351 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 2473 transitions. [2021-10-05 22:34:38,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2473 transitions. [2021-10-05 22:34:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:38,354 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:38,355 INFO L512 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] [2021-10-05 22:34:38,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 22:34:38,355 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:38,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash -956215452, now seen corresponding path program 11 times [2021-10-05 22:34:38,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:38,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865116066] [2021-10-05 22:34:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:38,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:38,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:38,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865116066] [2021-10-05 22:34:38,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865116066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:38,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:38,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:38,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355425041] [2021-10-05 22:34:38,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:38,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:38,459 INFO L87 Difference]: Start difference. First operand 816 states and 2473 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:38,883 INFO L93 Difference]: Finished difference Result 1603 states and 4824 transitions. [2021-10-05 22:34:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:34:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:38,892 INFO L225 Difference]: With dead ends: 1603 [2021-10-05 22:34:38,892 INFO L226 Difference]: Without dead ends: 1411 [2021-10-05 22:34:38,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 163.3ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:34:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-10-05 22:34:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 826. [2021-10-05 22:34:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.0303030303030303) internal successors, (2500), 825 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2500 transitions. [2021-10-05 22:34:38,928 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2500 transitions. Word has length 23 [2021-10-05 22:34:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:38,929 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 2500 transitions. [2021-10-05 22:34:38,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2500 transitions. [2021-10-05 22:34:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:38,932 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:38,932 INFO L512 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] [2021-10-05 22:34:38,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 22:34:38,932 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1631737788, now seen corresponding path program 12 times [2021-10-05 22:34:38,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:38,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698201925] [2021-10-05 22:34:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:38,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:39,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:39,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698201925] [2021-10-05 22:34:39,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698201925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:39,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:39,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:39,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785278053] [2021-10-05 22:34:39,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:39,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:39,045 INFO L87 Difference]: Start difference. First operand 826 states and 2500 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:39,418 INFO L93 Difference]: Finished difference Result 1425 states and 4301 transitions. [2021-10-05 22:34:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:34:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:39,426 INFO L225 Difference]: With dead ends: 1425 [2021-10-05 22:34:39,426 INFO L226 Difference]: Without dead ends: 1233 [2021-10-05 22:34:39,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 136.9ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:34:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-10-05 22:34:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 818. [2021-10-05 22:34:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.033047735618115) internal successors, (2478), 817 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2478 transitions. [2021-10-05 22:34:39,467 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2478 transitions. Word has length 23 [2021-10-05 22:34:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:39,468 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2478 transitions. [2021-10-05 22:34:39,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2478 transitions. [2021-10-05 22:34:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:39,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:39,473 INFO L512 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] [2021-10-05 22:34:39,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 22:34:39,474 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2117753478, now seen corresponding path program 13 times [2021-10-05 22:34:39,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:39,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62608906] [2021-10-05 22:34:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:39,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:39,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:39,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62608906] [2021-10-05 22:34:39,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62608906] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:39,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:39,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:39,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032379835] [2021-10-05 22:34:39,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:39,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:39,574 INFO L87 Difference]: Start difference. First operand 818 states and 2478 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:40,109 INFO L93 Difference]: Finished difference Result 1827 states and 5588 transitions. [2021-10-05 22:34:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 22:34:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:40,118 INFO L225 Difference]: With dead ends: 1827 [2021-10-05 22:34:40,118 INFO L226 Difference]: Without dead ends: 1518 [2021-10-05 22:34:40,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 176.4ms TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:34:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2021-10-05 22:34:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 833. [2021-10-05 22:34:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 3.030048076923077) internal successors, (2521), 832 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2521 transitions. [2021-10-05 22:34:40,153 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2521 transitions. Word has length 23 [2021-10-05 22:34:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:40,153 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 2521 transitions. [2021-10-05 22:34:40,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2521 transitions. [2021-10-05 22:34:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:40,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:40,157 INFO L512 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] [2021-10-05 22:34:40,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 22:34:40,157 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:40,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash 160130856, now seen corresponding path program 14 times [2021-10-05 22:34:40,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:40,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212720105] [2021-10-05 22:34:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:40,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:40,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:40,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212720105] [2021-10-05 22:34:40,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212720105] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:40,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:40,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:40,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944963848] [2021-10-05 22:34:40,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:40,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:40,263 INFO L87 Difference]: Start difference. First operand 833 states and 2521 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:40,816 INFO L93 Difference]: Finished difference Result 1469 states and 4481 transitions. [2021-10-05 22:34:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:34:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:40,824 INFO L225 Difference]: With dead ends: 1469 [2021-10-05 22:34:40,824 INFO L226 Difference]: Without dead ends: 1253 [2021-10-05 22:34:40,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 291.2ms TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:34:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2021-10-05 22:34:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 818. [2021-10-05 22:34:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.033047735618115) internal successors, (2478), 817 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2478 transitions. [2021-10-05 22:34:40,855 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2478 transitions. Word has length 23 [2021-10-05 22:34:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:40,855 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2478 transitions. [2021-10-05 22:34:40,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2478 transitions. [2021-10-05 22:34:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:40,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:40,859 INFO L512 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] [2021-10-05 22:34:40,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 22:34:40,860 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash 876590054, now seen corresponding path program 15 times [2021-10-05 22:34:40,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:40,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013034010] [2021-10-05 22:34:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:40,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:40,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:40,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013034010] [2021-10-05 22:34:40,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013034010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:40,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:40,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:40,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13496971] [2021-10-05 22:34:40,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:40,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:40,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:40,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:40,968 INFO L87 Difference]: Start difference. First operand 818 states and 2478 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:41,392 INFO L93 Difference]: Finished difference Result 1440 states and 4346 transitions. [2021-10-05 22:34:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:34:41,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:41,397 INFO L225 Difference]: With dead ends: 1440 [2021-10-05 22:34:41,397 INFO L226 Difference]: Without dead ends: 1275 [2021-10-05 22:34:41,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 210.3ms TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:34:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2021-10-05 22:34:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 821. [2021-10-05 22:34:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.0317073170731708) internal successors, (2486), 820 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2486 transitions. [2021-10-05 22:34:41,441 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2486 transitions. Word has length 23 [2021-10-05 22:34:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:41,441 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 2486 transitions. [2021-10-05 22:34:41,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2486 transitions. [2021-10-05 22:34:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:41,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:41,445 INFO L512 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] [2021-10-05 22:34:41,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 22:34:41,445 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2108198132, now seen corresponding path program 16 times [2021-10-05 22:34:41,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:41,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765928214] [2021-10-05 22:34:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:41,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:41,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:41,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765928214] [2021-10-05 22:34:41,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765928214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:41,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:41,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:41,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145484616] [2021-10-05 22:34:41,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:34:41,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:34:41,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:34:41,619 INFO L87 Difference]: Start difference. First operand 821 states and 2486 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:42,012 INFO L93 Difference]: Finished difference Result 1554 states and 4711 transitions. [2021-10-05 22:34:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:42,018 INFO L225 Difference]: With dead ends: 1554 [2021-10-05 22:34:42,019 INFO L226 Difference]: Without dead ends: 1415 [2021-10-05 22:34:42,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 198.4ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2021-10-05 22:34:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 807. [2021-10-05 22:34:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 3.0186104218362284) internal successors, (2433), 806 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2433 transitions. [2021-10-05 22:34:42,050 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2433 transitions. Word has length 23 [2021-10-05 22:34:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:42,051 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2433 transitions. [2021-10-05 22:34:42,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2433 transitions. [2021-10-05 22:34:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 22:34:42,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:42,054 INFO L512 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] [2021-10-05 22:34:42,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 22:34:42,055 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1810874226, now seen corresponding path program 17 times [2021-10-05 22:34:42,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:42,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852938226] [2021-10-05 22:34:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:42,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:42,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:42,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852938226] [2021-10-05 22:34:42,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852938226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:42,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:42,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:42,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682876257] [2021-10-05 22:34:42,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:42,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:42,180 INFO L87 Difference]: Start difference. First operand 807 states and 2433 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:42,638 INFO L93 Difference]: Finished difference Result 1282 states and 3869 transitions. [2021-10-05 22:34:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:34:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-05 22:34:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:42,642 INFO L225 Difference]: With dead ends: 1282 [2021-10-05 22:34:42,642 INFO L226 Difference]: Without dead ends: 1117 [2021-10-05 22:34:42,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 231.4ms TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2021-10-05 22:34:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-10-05 22:34:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 795. [2021-10-05 22:34:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 3.0239294710327456) internal successors, (2401), 794 states have internal predecessors, (2401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2401 transitions. [2021-10-05 22:34:42,669 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2401 transitions. Word has length 23 [2021-10-05 22:34:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:42,670 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 2401 transitions. [2021-10-05 22:34:42,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2401 transitions. [2021-10-05 22:34:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:42,673 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:42,673 INFO L512 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] [2021-10-05 22:34:42,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 22:34:42,673 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash -77296354, now seen corresponding path program 1 times [2021-10-05 22:34:42,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:42,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567089273] [2021-10-05 22:34:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:42,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:42,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:42,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567089273] [2021-10-05 22:34:42,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567089273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:42,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:42,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:42,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649759426] [2021-10-05 22:34:42,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:42,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:42,808 INFO L87 Difference]: Start difference. First operand 795 states and 2401 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:43,521 INFO L93 Difference]: Finished difference Result 2327 states and 7029 transitions. [2021-10-05 22:34:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 22:34:43,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:43,539 INFO L225 Difference]: With dead ends: 2327 [2021-10-05 22:34:43,539 INFO L226 Difference]: Without dead ends: 2008 [2021-10-05 22:34:43,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 333.7ms TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 22:34:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2021-10-05 22:34:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 824. [2021-10-05 22:34:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 3.0303766707168895) internal successors, (2494), 823 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2494 transitions. [2021-10-05 22:34:43,609 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2494 transitions. Word has length 24 [2021-10-05 22:34:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:43,610 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 2494 transitions. [2021-10-05 22:34:43,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2494 transitions. [2021-10-05 22:34:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:43,614 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:43,615 INFO L512 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] [2021-10-05 22:34:43,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 22:34:43,615 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1868626616, now seen corresponding path program 2 times [2021-10-05 22:34:43,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:43,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641662633] [2021-10-05 22:34:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:43,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:43,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:43,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641662633] [2021-10-05 22:34:43,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641662633] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:43,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:43,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:43,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617227803] [2021-10-05 22:34:43,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:34:43,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:34:43,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:34:43,769 INFO L87 Difference]: Start difference. First operand 824 states and 2494 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:44,356 INFO L93 Difference]: Finished difference Result 1719 states and 5217 transitions. [2021-10-05 22:34:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 22:34:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:44,364 INFO L225 Difference]: With dead ends: 1719 [2021-10-05 22:34:44,365 INFO L226 Difference]: Without dead ends: 1491 [2021-10-05 22:34:44,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 321.4ms TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2021-10-05 22:34:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2021-10-05 22:34:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 783. [2021-10-05 22:34:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 3.0485933503836318) internal successors, (2384), 782 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 2384 transitions. [2021-10-05 22:34:44,403 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 2384 transitions. Word has length 24 [2021-10-05 22:34:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:44,403 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 2384 transitions. [2021-10-05 22:34:44,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 2384 transitions. [2021-10-05 22:34:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:44,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:44,407 INFO L512 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] [2021-10-05 22:34:44,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 22:34:44,408 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash -724693046, now seen corresponding path program 3 times [2021-10-05 22:34:44,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:44,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682206083] [2021-10-05 22:34:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:44,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:44,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:44,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682206083] [2021-10-05 22:34:44,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682206083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:44,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:44,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:44,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434554291] [2021-10-05 22:34:44,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:44,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:44,539 INFO L87 Difference]: Start difference. First operand 783 states and 2384 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:45,061 INFO L93 Difference]: Finished difference Result 1621 states and 4882 transitions. [2021-10-05 22:34:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 22:34:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:45,070 INFO L225 Difference]: With dead ends: 1621 [2021-10-05 22:34:45,070 INFO L226 Difference]: Without dead ends: 1455 [2021-10-05 22:34:45,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 226.5ms TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2021-10-05 22:34:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-10-05 22:34:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 780. [2021-10-05 22:34:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 3.0462130937098846) internal successors, (2373), 779 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2373 transitions. [2021-10-05 22:34:45,104 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2373 transitions. Word has length 24 [2021-10-05 22:34:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:45,104 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 2373 transitions. [2021-10-05 22:34:45,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2373 transitions. [2021-10-05 22:34:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:45,107 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:45,107 INFO L512 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] [2021-10-05 22:34:45,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 22:34:45,108 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1863260194, now seen corresponding path program 4 times [2021-10-05 22:34:45,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:45,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272269601] [2021-10-05 22:34:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:45,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:45,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:45,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272269601] [2021-10-05 22:34:45,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272269601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:45,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:45,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:45,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632623068] [2021-10-05 22:34:45,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:45,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:45,238 INFO L87 Difference]: Start difference. First operand 780 states and 2373 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:45,722 INFO L93 Difference]: Finished difference Result 1452 states and 4401 transitions. [2021-10-05 22:34:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 22:34:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:45,729 INFO L225 Difference]: With dead ends: 1452 [2021-10-05 22:34:45,729 INFO L226 Difference]: Without dead ends: 1286 [2021-10-05 22:34:45,730 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 237.2ms TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2021-10-05 22:34:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-10-05 22:34:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 770. [2021-10-05 22:34:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 3.046814044213264) internal successors, (2343), 769 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2343 transitions. [2021-10-05 22:34:45,758 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2343 transitions. Word has length 24 [2021-10-05 22:34:45,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:45,759 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 2343 transitions. [2021-10-05 22:34:45,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2343 transitions. [2021-10-05 22:34:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:45,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:45,762 INFO L512 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] [2021-10-05 22:34:45,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 22:34:45,763 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1809026652, now seen corresponding path program 5 times [2021-10-05 22:34:45,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:45,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507219065] [2021-10-05 22:34:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:45,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:45,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:45,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507219065] [2021-10-05 22:34:45,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507219065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:45,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:45,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:45,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441294036] [2021-10-05 22:34:45,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:45,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:45,904 INFO L87 Difference]: Start difference. First operand 770 states and 2343 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:46,430 INFO L93 Difference]: Finished difference Result 1396 states and 4220 transitions. [2021-10-05 22:34:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 22:34:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:46,435 INFO L225 Difference]: With dead ends: 1396 [2021-10-05 22:34:46,435 INFO L226 Difference]: Without dead ends: 1231 [2021-10-05 22:34:46,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 273.3ms TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2021-10-05 22:34:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-10-05 22:34:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 747. [2021-10-05 22:34:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.0536193029490617) internal successors, (2278), 746 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2278 transitions. [2021-10-05 22:34:46,462 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2278 transitions. Word has length 24 [2021-10-05 22:34:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:46,462 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 2278 transitions. [2021-10-05 22:34:46,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2278 transitions. [2021-10-05 22:34:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:46,465 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:46,465 INFO L512 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] [2021-10-05 22:34:46,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 22:34:46,465 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash -201523636, now seen corresponding path program 6 times [2021-10-05 22:34:46,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:46,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310642698] [2021-10-05 22:34:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:46,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:46,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:46,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310642698] [2021-10-05 22:34:46,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310642698] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:46,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:46,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 22:34:46,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358032755] [2021-10-05 22:34:46,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 22:34:46,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 22:34:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 22:34:46,602 INFO L87 Difference]: Start difference. First operand 747 states and 2278 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:47,101 INFO L93 Difference]: Finished difference Result 1196 states and 3639 transitions. [2021-10-05 22:34:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:34:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:47,107 INFO L225 Difference]: With dead ends: 1196 [2021-10-05 22:34:47,107 INFO L226 Difference]: Without dead ends: 1031 [2021-10-05 22:34:47,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 252.5ms TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2021-10-05 22:34:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-10-05 22:34:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 714. [2021-10-05 22:34:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 3.065918653576438) internal successors, (2186), 713 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2186 transitions. [2021-10-05 22:34:47,140 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2186 transitions. Word has length 24 [2021-10-05 22:34:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:47,140 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 2186 transitions. [2021-10-05 22:34:47,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2186 transitions. [2021-10-05 22:34:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:47,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:47,143 INFO L512 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] [2021-10-05 22:34:47,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 22:34:47,143 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 285119696, now seen corresponding path program 7 times [2021-10-05 22:34:47,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:47,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616368255] [2021-10-05 22:34:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:47,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:47,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:47,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616368255] [2021-10-05 22:34:47,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616368255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:47,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:47,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 22:34:47,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385909705] [2021-10-05 22:34:47,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:47,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:47,264 INFO L87 Difference]: Start difference. First operand 714 states and 2186 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:47,486 INFO L93 Difference]: Finished difference Result 945 states and 2833 transitions. [2021-10-05 22:34:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:47,490 INFO L225 Difference]: With dead ends: 945 [2021-10-05 22:34:47,490 INFO L226 Difference]: Without dead ends: 806 [2021-10-05 22:34:47,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 117.0ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-10-05 22:34:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 693. [2021-10-05 22:34:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 3.0736994219653178) internal successors, (2127), 692 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 2127 transitions. [2021-10-05 22:34:47,511 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 2127 transitions. Word has length 24 [2021-10-05 22:34:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:47,512 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 2127 transitions. [2021-10-05 22:34:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 2127 transitions. [2021-10-05 22:34:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 22:34:47,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:47,514 INFO L512 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] [2021-10-05 22:34:47,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 22:34:47,515 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1983125644, now seen corresponding path program 8 times [2021-10-05 22:34:47,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:47,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694941079] [2021-10-05 22:34:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:47,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 22:34:47,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:47,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694941079] [2021-10-05 22:34:47,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694941079] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:47,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:47,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:47,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968125230] [2021-10-05 22:34:47,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 22:34:47,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 22:34:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 22:34:47,665 INFO L87 Difference]: Start difference. First operand 693 states and 2127 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:47,974 INFO L93 Difference]: Finished difference Result 826 states and 2479 transitions. [2021-10-05 22:34:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 22:34:47,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-05 22:34:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:47,978 INFO L225 Difference]: With dead ends: 826 [2021-10-05 22:34:47,978 INFO L226 Difference]: Without dead ends: 687 [2021-10-05 22:34:47,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 151.0ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-10-05 22:34:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 629. [2021-10-05 22:34:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 3.071656050955414) internal successors, (1929), 628 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1929 transitions. [2021-10-05 22:34:48,015 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1929 transitions. Word has length 24 [2021-10-05 22:34:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:48,015 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 1929 transitions. [2021-10-05 22:34:48,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1929 transitions. [2021-10-05 22:34:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-05 22:34:48,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:48,018 INFO L512 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] [2021-10-05 22:34:48,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 22:34:48,018 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1647607852, now seen corresponding path program 1 times [2021-10-05 22:34:48,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:48,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96371009] [2021-10-05 22:34:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:48,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:48,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:48,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96371009] [2021-10-05 22:34:48,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96371009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:48,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:48,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-05 22:34:48,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306810630] [2021-10-05 22:34:48,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 22:34:48,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 22:34:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 22:34:48,043 INFO L87 Difference]: Start difference. First operand 629 states and 1929 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:48,051 INFO L93 Difference]: Finished difference Result 337 states and 926 transitions. [2021-10-05 22:34:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 22:34:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-05 22:34:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:48,053 INFO L225 Difference]: With dead ends: 337 [2021-10-05 22:34:48,053 INFO L226 Difference]: Without dead ends: 321 [2021-10-05 22:34:48,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 22:34:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-05 22:34:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2021-10-05 22:34:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.76875) internal successors, (886), 320 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 886 transitions. [2021-10-05 22:34:48,062 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 886 transitions. Word has length 25 [2021-10-05 22:34:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:48,062 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 886 transitions. [2021-10-05 22:34:48,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 886 transitions. [2021-10-05 22:34:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-05 22:34:48,064 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:48,064 INFO L512 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] [2021-10-05 22:34:48,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 22:34:48,064 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1143689406, now seen corresponding path program 1 times [2021-10-05 22:34:48,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:48,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362051039] [2021-10-05 22:34:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:48,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:48,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:48,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362051039] [2021-10-05 22:34:48,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362051039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:48,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:48,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-05 22:34:48,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190517862] [2021-10-05 22:34:48,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 22:34:48,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 22:34:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 22:34:48,091 INFO L87 Difference]: Start difference. First operand 321 states and 886 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:48,098 INFO L93 Difference]: Finished difference Result 101 states and 220 transitions. [2021-10-05 22:34:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 22:34:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-05 22:34:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:48,099 INFO L225 Difference]: With dead ends: 101 [2021-10-05 22:34:48,099 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 22:34:48,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 22:34:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 22:34:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 22:34:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 22:34:48,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-10-05 22:34:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:48,101 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 22:34:48,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 22:34:48,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 22:34:48,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 22:34:48,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 22:34:48,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 22:34:48,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 22:34:48,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 22:34:48,112 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 22:34:48,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 22:34:48,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:34:48 BasicIcfg [2021-10-05 22:34:48,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 22:34:48,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 22:34:48,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 22:34:48,118 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 22:34:48,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:34:19" (3/4) ... [2021-10-05 22:34:48,122 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 22:34:48,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 22:34:48,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 22:34:48,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 22:34:48,140 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-10-05 22:34:48,140 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 22:34:48,140 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 22:34:48,141 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 22:34:48,206 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 22:34:48,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 22:34:48,209 INFO L168 Benchmark]: Toolchain (without parser) took 30059.13 ms. Allocated memory was 48.2 MB in the beginning and 161.5 MB in the end (delta: 113.2 MB). Free memory was 24.2 MB in the beginning and 108.6 MB in the end (delta: -84.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,209 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 23.3 MB in the end (delta: 42.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:34:48,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.96 ms. Allocated memory is still 62.9 MB. Free memory was 47.6 MB in the beginning and 36.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 62.9 MB. Free memory was 36.5 MB in the beginning and 34.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,211 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 62.9 MB. Free memory was 34.8 MB in the beginning and 33.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:34:48,211 INFO L168 Benchmark]: RCFGBuilder took 684.31 ms. Allocated memory is still 62.9 MB. Free memory was 33.1 MB in the beginning and 35.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,212 INFO L168 Benchmark]: TraceAbstraction took 28867.90 ms. Allocated memory was 62.9 MB in the beginning and 161.5 MB in the end (delta: 98.6 MB). Free memory was 34.7 MB in the beginning and 111.7 MB in the end (delta: -77.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,212 INFO L168 Benchmark]: Witness Printer took 88.88 ms. Allocated memory is still 161.5 MB. Free memory was 111.7 MB in the beginning and 108.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:48,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 23.3 MB in the end (delta: 42.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 313.96 ms. Allocated memory is still 62.9 MB. Free memory was 47.6 MB in the beginning and 36.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 62.9 MB. Free memory was 36.5 MB in the beginning and 34.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 62.9 MB. Free memory was 34.8 MB in the beginning and 33.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 684.31 ms. Allocated memory is still 62.9 MB. Free memory was 33.1 MB in the beginning and 35.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28867.90 ms. Allocated memory was 62.9 MB in the beginning and 161.5 MB in the end (delta: 98.6 MB). Free memory was 34.7 MB in the beginning and 111.7 MB in the end (delta: -77.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * Witness Printer took 88.88 ms. Allocated memory is still 161.5 MB. Free memory was 111.7 MB in the beginning and 108.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8593.7ms, 171 PlacesBefore, 43 PlacesAfterwards, 174 TransitionsBefore, 38 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 8 FixpointIterations, 100 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 9 ConcurrentYvCompositions, 8 ChoiceCompositions, 161 TotalNumberOfCompositions, 5570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3604, positive: 3397, positive conditional: 0, positive unconditional: 3397, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1571, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1571, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3604, positive: 1879, positive conditional: 0, positive unconditional: 1879, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 1571, unknown conditional: 0, unknown unconditional: 1571] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 205 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 28636.9ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 115.2ms, AutomataDifference: 14130.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8720.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1536 SDtfs, 6009 SDslu, 6039 SDs, 0 SdLazy, 8740 SolverSat, 606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5940.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3963 ImplicationChecksByTransitivity, 6679.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=7, InterpolantAutomatonStates: 544, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1048.7ms AutomataMinimizationTime, 27 MinimizatonAttempts, 15985 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 77.3ms SsaConstructionTime, 898.3ms SatisfiabilityAnalysisTime, 3181.3ms InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 5783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 22:34:48,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...