./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c --full-output --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/ticket-4.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 b35f2aa4b110c089eeeca9681cb8383cf6eb05d5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-03 12:07:58,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-03 12:07:58,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-03 12:07:58,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-03 12:07:58,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-03 12:07:58,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-03 12:07:58,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-03 12:07:58,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-03 12:07:58,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-03 12:07:58,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-03 12:07:58,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-03 12:07:58,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-03 12:07:58,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-03 12:07:58,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-03 12:07:58,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-03 12:07:58,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-03 12:07:58,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-03 12:07:58,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-03 12:07:58,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-03 12:07:58,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-03 12:07:58,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-03 12:07:58,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-03 12:07:58,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-03 12:07:58,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-03 12:07:58,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-03 12:07:58,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-03 12:07:58,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-03 12:07:58,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-03 12:07:58,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-03 12:07:58,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-03 12:07:58,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-03 12:07:58,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-03 12:07:58,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-03 12:07:58,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-03 12:07:58,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-03 12:07:58,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-03 12:07:58,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-03 12:07:58,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-03 12:07:58,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-03 12:07:58,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-03 12:07:58,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-03 12:07:58,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-03 12:07:58,679 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-03 12:07:58,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-03 12:07:58,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-03 12:07:58,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-03 12:07:58,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-03 12:07:58,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-03 12:07:58,683 INFO L138 SettingsManager]: * Use SBE=true [2021-10-03 12:07:58,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-03 12:07:58,683 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-03 12:07:58,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-03 12:07:58,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-03 12:07:58,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-03 12:07:58,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-03 12:07:58,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-03 12:07:58,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-03 12:07:58,686 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-03 12:07:58,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-03 12:07:58,686 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-03 12:07:58,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-03 12:07:58,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-03 12:07:58,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-03 12:07:58,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-03 12:07:58,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:07:58,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-03 12:07:58,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-03 12:07:58,689 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 -> b35f2aa4b110c089eeeca9681cb8383cf6eb05d5 [2021-10-03 12:07:59,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-03 12:07:59,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-03 12:07:59,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-03 12:07:59,156 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-03 12:07:59,157 INFO L275 PluginConnector]: CDTParser initialized [2021-10-03 12:07:59,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-03 12:07:59,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76fff5084/084ff05866fa4e7c8ccc290d50bcc34d/FLAGc07818a17 [2021-10-03 12:07:59,932 INFO L306 CDTParser]: Found 1 translation units. [2021-10-03 12:07:59,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-03 12:07:59,933 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:07:59,934 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:07:59,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76fff5084/084ff05866fa4e7c8ccc290d50bcc34d/FLAGc07818a17 [2021-10-03 12:08:00,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76fff5084/084ff05866fa4e7c8ccc290d50bcc34d [2021-10-03 12:08:00,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-03 12:08:00,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-03 12:08:00,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-03 12:08:00,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-03 12:08:00,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-03 12:08:00,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be590ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00, skipping insertion in model container [2021-10-03 12:08:00,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-03 12:08:00,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-03 12:08:00,445 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:08:00,498 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/ticket-4.wvr.c[1788,1801] [2021-10-03 12:08:00,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:08:00,512 INFO L203 MainTranslator]: Completed pre-run [2021-10-03 12:08:00,525 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:08:00,544 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/ticket-4.wvr.c[1788,1801] [2021-10-03 12:08:00,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:08:00,564 INFO L208 MainTranslator]: Completed translation [2021-10-03 12:08:00,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00 WrapperNode [2021-10-03 12:08:00,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-03 12:08:00,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-03 12:08:00,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-03 12:08:00,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-03 12:08:00,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-03 12:08:00,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-03 12:08:00,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-03 12:08:00,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-03 12:08:00,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-03 12:08:00,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-03 12:08:00,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-03 12:08:00,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-03 12:08:00,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (1/1) ... [2021-10-03 12:08:00,683 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:08:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 12:08:00,728 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-03 12:08:00,743 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-03 12:08:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-03 12:08:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-03 12:08:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-03 12:08:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-03 12:08:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-03 12:08:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-03 12:08:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-10-03 12:08:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-10-03 12:08:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-03 12:08:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-03 12:08:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-03 12:08:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-03 12:08:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-03 12:08:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-03 12:08:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-03 12:08:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-03 12:08:00,799 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-03 12:08:01,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-03 12:08:01,262 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-03 12:08:01,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:08:01 BoogieIcfgContainer [2021-10-03 12:08:01,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-03 12:08:01,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-03 12:08:01,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-03 12:08:01,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-03 12:08:01,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 12:08:00" (1/3) ... [2021-10-03 12:08:01,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403706fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:08:01, skipping insertion in model container [2021-10-03 12:08:01,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:08:00" (2/3) ... [2021-10-03 12:08:01,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403706fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:08:01, skipping insertion in model container [2021-10-03 12:08:01,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:08:01" (3/3) ... [2021-10-03 12:08:01,274 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.c [2021-10-03 12:08:01,280 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-03 12:08:01,280 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-03 12:08:01,280 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-03 12:08:01,280 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-03 12:08:01,387 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,388 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,388 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,388 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,389 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,389 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,389 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,390 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,390 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,390 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,391 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,392 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,392 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,393 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,394 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,394 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,396 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,397 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,399 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,399 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,399 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,400 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,401 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,402 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,402 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,404 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,404 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,405 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,405 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,407 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,407 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,408 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,408 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,408 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,412 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,413 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,414 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,415 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,415 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,415 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,416 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,416 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,416 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,416 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,417 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,417 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,417 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,417 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,417 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,418 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,423 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,425 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,425 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,426 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,426 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,426 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,426 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,427 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,427 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,427 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,427 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,427 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,428 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,428 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,429 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,429 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,429 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,429 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,430 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,430 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,430 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,430 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,430 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,431 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,431 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,431 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,431 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,432 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,432 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,432 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,432 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,433 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,433 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,433 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,433 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,434 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,434 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,441 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,442 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,442 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,443 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,445 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,446 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,446 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,447 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,449 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,449 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,449 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,449 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,450 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,450 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:08:01,463 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-10-03 12:08:01,531 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-03 12:08:01,544 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-03 12:08:01,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-03 12:08:01,579 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-03 12:08:01,601 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 155 transitions, 342 flow [2021-10-03 12:08:01,605 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 155 transitions, 342 flow [2021-10-03 12:08:01,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 155 transitions, 342 flow [2021-10-03 12:08:01,717 INFO L129 PetriNetUnfolder]: 6/151 cut-off events. [2021-10-03 12:08:01,717 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-10-03 12:08:01,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 151 events. 6/151 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2021-10-03 12:08:01,737 INFO L116 LiptonReduction]: Number of co-enabled transitions 3864 [2021-10-03 12:08:06,681 INFO L131 LiptonReduction]: Checked pairs total: 11537 [2021-10-03 12:08:06,681 INFO L133 LiptonReduction]: Total number of compositions: 135 [2021-10-03 12:08:06,690 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 46 transitions, 124 flow [2021-10-03 12:08:06,943 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 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-03 12:08:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 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-03 12:08:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-03 12:08:07,038 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:07,039 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-03 12:08:07,040 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -148863997, now seen corresponding path program 1 times [2021-10-03 12:08:07,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:07,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679441512] [2021-10-03 12:08:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:07,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:07,269 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-03 12:08:07,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:07,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679441512] [2021-10-03 12:08:07,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679441512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:07,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:07,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-03 12:08:07,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546467982] [2021-10-03 12:08:07,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-03 12:08:07,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-03 12:08:07,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:08:07,347 INFO L87 Difference]: Start difference. First operand has 4146 states, 4145 states have (on average 4.187696019300362) internal successors, (17358), 4145 states have internal predecessors, (17358), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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-03 12:08:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:07,506 INFO L93 Difference]: Finished difference Result 4146 states and 15422 transitions. [2021-10-03 12:08:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-03 12:08:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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-03 12:08:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:07,596 INFO L225 Difference]: With dead ends: 4146 [2021-10-03 12:08:07,597 INFO L226 Difference]: Without dead ends: 4146 [2021-10-03 12:08:07,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:08:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2021-10-03 12:08:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4146. [2021-10-03 12:08:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4146 states, 4145 states have (on average 3.720627261761158) internal successors, (15422), 4145 states have internal predecessors, (15422), 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-03 12:08:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 15422 transitions. [2021-10-03 12:08:08,038 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 15422 transitions. Word has length 26 [2021-10-03 12:08:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:08,039 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 15422 transitions. [2021-10-03 12:08:08,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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-03 12:08:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 15422 transitions. [2021-10-03 12:08:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:08,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:08,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:08,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-03 12:08:08,097 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1094942690, now seen corresponding path program 1 times [2021-10-03 12:08:08,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:08,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718083017] [2021-10-03 12:08:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:08,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:08,467 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-03 12:08:08,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:08,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718083017] [2021-10-03 12:08:08,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718083017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:08,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:08,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-03 12:08:08,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761347322] [2021-10-03 12:08:08,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 12:08:08,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 12:08:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-03 12:08:08,472 INFO L87 Difference]: Start difference. First operand 4146 states and 15422 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-03 12:08:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:08,980 INFO L93 Difference]: Finished difference Result 6050 states and 22506 transitions. [2021-10-03 12:08:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:09,100 INFO L225 Difference]: With dead ends: 6050 [2021-10-03 12:08:09,101 INFO L226 Difference]: Without dead ends: 5102 [2021-10-03 12:08:09,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2021-10-03 12:08:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4502. [2021-10-03 12:08:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 4501 states have (on average 3.6967340590979783) internal successors, (16639), 4501 states have internal predecessors, (16639), 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-03 12:08:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 16639 transitions. [2021-10-03 12:08:09,527 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 16639 transitions. Word has length 38 [2021-10-03 12:08:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:09,529 INFO L470 AbstractCegarLoop]: Abstraction has 4502 states and 16639 transitions. [2021-10-03 12:08:09,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-03 12:08:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 16639 transitions. [2021-10-03 12:08:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:09,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:09,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:09,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-03 12:08:09,560 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 212164702, now seen corresponding path program 2 times [2021-10-03 12:08:09,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:09,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151653992] [2021-10-03 12:08:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:09,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:09,776 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-03 12:08:09,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:09,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151653992] [2021-10-03 12:08:09,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151653992] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:09,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:09,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-03 12:08:09,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832019891] [2021-10-03 12:08:09,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 12:08:09,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 12:08:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-03 12:08:09,784 INFO L87 Difference]: Start difference. First operand 4502 states and 16639 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-03 12:08:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:10,061 INFO L93 Difference]: Finished difference Result 5512 states and 20296 transitions. [2021-10-03 12:08:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:08:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:10,179 INFO L225 Difference]: With dead ends: 5512 [2021-10-03 12:08:10,179 INFO L226 Difference]: Without dead ends: 5512 [2021-10-03 12:08:10,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2021-10-03 12:08:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4832. [2021-10-03 12:08:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4832 states, 4831 states have (on average 3.671289588077003) internal successors, (17736), 4831 states have internal predecessors, (17736), 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-03 12:08:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 17736 transitions. [2021-10-03 12:08:10,548 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 17736 transitions. Word has length 38 [2021-10-03 12:08:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:10,549 INFO L470 AbstractCegarLoop]: Abstraction has 4832 states and 17736 transitions. [2021-10-03 12:08:10,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-03 12:08:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 17736 transitions. [2021-10-03 12:08:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:10,579 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:10,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:10,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-03 12:08:10,580 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 570754852, now seen corresponding path program 3 times [2021-10-03 12:08:10,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:10,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479219938] [2021-10-03 12:08:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:10,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:10,780 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-03 12:08:10,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:10,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479219938] [2021-10-03 12:08:10,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479219938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:10,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:10,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:10,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846490255] [2021-10-03 12:08:10,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:10,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:10,784 INFO L87 Difference]: Start difference. First operand 4832 states and 17736 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:11,129 INFO L93 Difference]: Finished difference Result 4788 states and 16138 transitions. [2021-10-03 12:08:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:11,156 INFO L225 Difference]: With dead ends: 4788 [2021-10-03 12:08:11,156 INFO L226 Difference]: Without dead ends: 4780 [2021-10-03 12:08:11,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.8ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4780 states. [2021-10-03 12:08:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4780 to 4364. [2021-10-03 12:08:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 4363 states have (on average 3.4256245702498282) internal successors, (14946), 4363 states have internal predecessors, (14946), 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-03 12:08:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 14946 transitions. [2021-10-03 12:08:11,422 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 14946 transitions. Word has length 38 [2021-10-03 12:08:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:11,422 INFO L470 AbstractCegarLoop]: Abstraction has 4364 states and 14946 transitions. [2021-10-03 12:08:11,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 14946 transitions. [2021-10-03 12:08:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:11,440 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:11,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:11,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-03 12:08:11,440 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -998061218, now seen corresponding path program 4 times [2021-10-03 12:08:11,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:11,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110303763] [2021-10-03 12:08:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:11,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:11,540 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-03 12:08:11,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:11,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110303763] [2021-10-03 12:08:11,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110303763] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:11,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:11,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:11,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260102771] [2021-10-03 12:08:11,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:11,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:11,543 INFO L87 Difference]: Start difference. First operand 4364 states and 14946 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:11,929 INFO L93 Difference]: Finished difference Result 5194 states and 17396 transitions. [2021-10-03 12:08:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:11,953 INFO L225 Difference]: With dead ends: 5194 [2021-10-03 12:08:11,954 INFO L226 Difference]: Without dead ends: 4864 [2021-10-03 12:08:11,954 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 90.6ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2021-10-03 12:08:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4404. [2021-10-03 12:08:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4403 states have (on average 3.405859641153759) internal successors, (14996), 4403 states have internal predecessors, (14996), 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-03 12:08:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 14996 transitions. [2021-10-03 12:08:12,269 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 14996 transitions. Word has length 38 [2021-10-03 12:08:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:12,269 INFO L470 AbstractCegarLoop]: Abstraction has 4404 states and 14996 transitions. [2021-10-03 12:08:12,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 14996 transitions. [2021-10-03 12:08:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:12,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:12,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:12,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-03 12:08:12,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 336153206, now seen corresponding path program 5 times [2021-10-03 12:08:12,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:12,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598187629] [2021-10-03 12:08:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:12,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:12,405 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-03 12:08:12,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:12,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598187629] [2021-10-03 12:08:12,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598187629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:12,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:12,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:12,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090655327] [2021-10-03 12:08:12,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:12,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:12,409 INFO L87 Difference]: Start difference. First operand 4404 states and 14996 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:13,028 INFO L93 Difference]: Finished difference Result 5942 states and 19479 transitions. [2021-10-03 12:08:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:08:13,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:13,055 INFO L225 Difference]: With dead ends: 5942 [2021-10-03 12:08:13,055 INFO L226 Difference]: Without dead ends: 5244 [2021-10-03 12:08:13,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 162.4ms TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:08:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-10-03 12:08:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 4630. [2021-10-03 12:08:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4629 states have (on average 3.3501836249729964) internal successors, (15508), 4629 states have internal predecessors, (15508), 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-03 12:08:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 15508 transitions. [2021-10-03 12:08:13,327 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 15508 transitions. Word has length 38 [2021-10-03 12:08:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:13,328 INFO L470 AbstractCegarLoop]: Abstraction has 4630 states and 15508 transitions. [2021-10-03 12:08:13,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 15508 transitions. [2021-10-03 12:08:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:13,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:13,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:13,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-03 12:08:13,344 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1033584326, now seen corresponding path program 6 times [2021-10-03 12:08:13,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:13,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107244588] [2021-10-03 12:08:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:13,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:13,450 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-03 12:08:13,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:13,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107244588] [2021-10-03 12:08:13,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107244588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:13,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:13,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:13,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279515303] [2021-10-03 12:08:13,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:13,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:13,454 INFO L87 Difference]: Start difference. First operand 4630 states and 15508 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:13,842 INFO L93 Difference]: Finished difference Result 5780 states and 18758 transitions. [2021-10-03 12:08:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:08:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:13,868 INFO L225 Difference]: With dead ends: 5780 [2021-10-03 12:08:13,868 INFO L226 Difference]: Without dead ends: 5762 [2021-10-03 12:08:13,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 102.4ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:08:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2021-10-03 12:08:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5046. [2021-10-03 12:08:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5046 states, 5045 states have (on average 3.299108027750248) internal successors, (16644), 5045 states have internal predecessors, (16644), 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-03 12:08:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 16644 transitions. [2021-10-03 12:08:14,156 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 16644 transitions. Word has length 38 [2021-10-03 12:08:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:14,157 INFO L470 AbstractCegarLoop]: Abstraction has 5046 states and 16644 transitions. [2021-10-03 12:08:14,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 16644 transitions. [2021-10-03 12:08:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:14,178 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:14,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:14,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-03 12:08:14,179 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1486048182, now seen corresponding path program 7 times [2021-10-03 12:08:14,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:14,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794968333] [2021-10-03 12:08:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:14,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:14,400 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-03 12:08:14,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:14,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794968333] [2021-10-03 12:08:14,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794968333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:14,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:14,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:14,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290781945] [2021-10-03 12:08:14,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:14,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:14,403 INFO L87 Difference]: Start difference. First operand 5046 states and 16644 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:15,530 INFO L93 Difference]: Finished difference Result 5872 states and 17772 transitions. [2021-10-03 12:08:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-03 12:08:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:15,556 INFO L225 Difference]: With dead ends: 5872 [2021-10-03 12:08:15,557 INFO L226 Difference]: Without dead ends: 5070 [2021-10-03 12:08:15,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 411.3ms TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2021-10-03 12:08:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2021-10-03 12:08:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 4326. [2021-10-03 12:08:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4326 states, 4325 states have (on average 3.1035838150289017) internal successors, (13423), 4325 states have internal predecessors, (13423), 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-03 12:08:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 13423 transitions. [2021-10-03 12:08:15,809 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 13423 transitions. Word has length 38 [2021-10-03 12:08:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:15,810 INFO L470 AbstractCegarLoop]: Abstraction has 4326 states and 13423 transitions. [2021-10-03 12:08:15,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 13423 transitions. [2021-10-03 12:08:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:15,825 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:15,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:15,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-03 12:08:15,826 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -458266770, now seen corresponding path program 8 times [2021-10-03 12:08:15,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:15,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303833604] [2021-10-03 12:08:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:15,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:16,018 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-03 12:08:16,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:16,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303833604] [2021-10-03 12:08:16,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303833604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:16,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:16,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 12:08:16,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807592609] [2021-10-03 12:08:16,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-03 12:08:16,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-03 12:08:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-03 12:08:16,026 INFO L87 Difference]: Start difference. First operand 4326 states and 13423 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-03 12:08:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:16,120 INFO L93 Difference]: Finished difference Result 6625 states and 20441 transitions. [2021-10-03 12:08:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 12:08:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:16,142 INFO L225 Difference]: With dead ends: 6625 [2021-10-03 12:08:16,142 INFO L226 Difference]: Without dead ends: 3898 [2021-10-03 12:08:16,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-03 12:08:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2021-10-03 12:08:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3804. [2021-10-03 12:08:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3803 states have (on average 3.0060478569550355) internal successors, (11432), 3803 states have internal predecessors, (11432), 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-03 12:08:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 11432 transitions. [2021-10-03 12:08:16,258 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 11432 transitions. Word has length 38 [2021-10-03 12:08:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:16,259 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 11432 transitions. [2021-10-03 12:08:16,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-03 12:08:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 11432 transitions. [2021-10-03 12:08:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:16,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:16,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:16,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-03 12:08:16,271 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1995252922, now seen corresponding path program 9 times [2021-10-03 12:08:16,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:16,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095357230] [2021-10-03 12:08:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:16,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:16,411 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-03 12:08:16,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:16,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095357230] [2021-10-03 12:08:16,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095357230] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:16,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:16,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:16,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256048267] [2021-10-03 12:08:16,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:16,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:16,417 INFO L87 Difference]: Start difference. First operand 3804 states and 11432 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:16,680 INFO L93 Difference]: Finished difference Result 5154 states and 15312 transitions. [2021-10-03 12:08:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:16,696 INFO L225 Difference]: With dead ends: 5154 [2021-10-03 12:08:16,697 INFO L226 Difference]: Without dead ends: 5108 [2021-10-03 12:08:16,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2021-10-03 12:08:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4056. [2021-10-03 12:08:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 2.9948212083847103) internal successors, (12144), 4055 states have internal predecessors, (12144), 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-03 12:08:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 12144 transitions. [2021-10-03 12:08:16,854 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 12144 transitions. Word has length 38 [2021-10-03 12:08:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:16,854 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 12144 transitions. [2021-10-03 12:08:16,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 12144 transitions. [2021-10-03 12:08:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:16,868 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:16,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:16,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-03 12:08:16,869 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 892392716, now seen corresponding path program 10 times [2021-10-03 12:08:16,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:16,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150611994] [2021-10-03 12:08:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:16,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:16,987 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-03 12:08:16,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:16,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150611994] [2021-10-03 12:08:16,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150611994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:16,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:16,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:16,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612741125] [2021-10-03 12:08:16,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:16,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:16,990 INFO L87 Difference]: Start difference. First operand 4056 states and 12144 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:17,357 INFO L93 Difference]: Finished difference Result 5384 states and 15906 transitions. [2021-10-03 12:08:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:17,374 INFO L225 Difference]: With dead ends: 5384 [2021-10-03 12:08:17,374 INFO L226 Difference]: Without dead ends: 5280 [2021-10-03 12:08:17,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2021-10-03 12:08:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4096. [2021-10-03 12:08:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4096 states, 4095 states have (on average 2.9973137973137973) internal successors, (12274), 4095 states have internal predecessors, (12274), 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-03 12:08:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 12274 transitions. [2021-10-03 12:08:17,543 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 12274 transitions. Word has length 38 [2021-10-03 12:08:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:17,543 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 12274 transitions. [2021-10-03 12:08:17,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 12274 transitions. [2021-10-03 12:08:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:17,557 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:17,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:17,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-03 12:08:17,558 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1521739592, now seen corresponding path program 11 times [2021-10-03 12:08:17,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:17,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170405737] [2021-10-03 12:08:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:17,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:17,667 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-03 12:08:17,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:17,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170405737] [2021-10-03 12:08:17,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170405737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:17,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:17,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:17,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334615534] [2021-10-03 12:08:17,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:17,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:17,669 INFO L87 Difference]: Start difference. First operand 4096 states and 12274 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:17,997 INFO L93 Difference]: Finished difference Result 5248 states and 15429 transitions. [2021-10-03 12:08:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:18,013 INFO L225 Difference]: With dead ends: 5248 [2021-10-03 12:08:18,013 INFO L226 Difference]: Without dead ends: 5026 [2021-10-03 12:08:18,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2021-10-03 12:08:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4124. [2021-10-03 12:08:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 4123 states have (on average 2.9970894979383944) internal successors, (12357), 4123 states have internal predecessors, (12357), 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-03 12:08:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 12357 transitions. [2021-10-03 12:08:18,159 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 12357 transitions. Word has length 38 [2021-10-03 12:08:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:18,160 INFO L470 AbstractCegarLoop]: Abstraction has 4124 states and 12357 transitions. [2021-10-03 12:08:18,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 12357 transitions. [2021-10-03 12:08:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:18,173 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:18,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:18,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-03 12:08:18,173 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2122509814, now seen corresponding path program 12 times [2021-10-03 12:08:18,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:18,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623082304] [2021-10-03 12:08:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:18,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:18,272 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-03 12:08:18,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:18,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623082304] [2021-10-03 12:08:18,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623082304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:18,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:18,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:18,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735609912] [2021-10-03 12:08:18,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:18,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:18,274 INFO L87 Difference]: Start difference. First operand 4124 states and 12357 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:18,485 INFO L93 Difference]: Finished difference Result 3478 states and 10304 transitions. [2021-10-03 12:08:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:08:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:18,496 INFO L225 Difference]: With dead ends: 3478 [2021-10-03 12:08:18,496 INFO L226 Difference]: Without dead ends: 3264 [2021-10-03 12:08:18,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2021-10-03 12:08:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3238. [2021-10-03 12:08:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3237 states have (on average 2.9966017917825147) internal successors, (9700), 3237 states have internal predecessors, (9700), 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-03 12:08:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 9700 transitions. [2021-10-03 12:08:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 9700 transitions. Word has length 38 [2021-10-03 12:08:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:18,603 INFO L470 AbstractCegarLoop]: Abstraction has 3238 states and 9700 transitions. [2021-10-03 12:08:18,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 9700 transitions. [2021-10-03 12:08:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:18,614 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:18,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:18,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-03 12:08:18,615 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1382464902, now seen corresponding path program 13 times [2021-10-03 12:08:18,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:18,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871462540] [2021-10-03 12:08:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:18,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:18,719 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-03 12:08:18,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:18,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871462540] [2021-10-03 12:08:18,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871462540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:18,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:18,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:18,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758225616] [2021-10-03 12:08:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:18,722 INFO L87 Difference]: Start difference. First operand 3238 states and 9700 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:18,938 INFO L93 Difference]: Finished difference Result 3306 states and 9846 transitions. [2021-10-03 12:08:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:18,950 INFO L225 Difference]: With dead ends: 3306 [2021-10-03 12:08:18,950 INFO L226 Difference]: Without dead ends: 3288 [2021-10-03 12:08:18,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 69.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2021-10-03 12:08:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3240. [2021-10-03 12:08:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3239 states have (on average 2.9953689410311823) internal successors, (9702), 3239 states have internal predecessors, (9702), 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-03 12:08:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 9702 transitions. [2021-10-03 12:08:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 9702 transitions. Word has length 38 [2021-10-03 12:08:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:19,116 INFO L470 AbstractCegarLoop]: Abstraction has 3240 states and 9702 transitions. [2021-10-03 12:08:19,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 9702 transitions. [2021-10-03 12:08:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:19,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:19,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:19,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-03 12:08:19,126 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -121459530, now seen corresponding path program 14 times [2021-10-03 12:08:19,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:19,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178534435] [2021-10-03 12:08:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:19,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:19,227 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-03 12:08:19,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:19,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178534435] [2021-10-03 12:08:19,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178534435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:19,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:19,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:19,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142147991] [2021-10-03 12:08:19,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:19,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:19,229 INFO L87 Difference]: Start difference. First operand 3240 states and 9702 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:19,553 INFO L93 Difference]: Finished difference Result 3776 states and 11168 transitions. [2021-10-03 12:08:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:08:19,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:19,565 INFO L225 Difference]: With dead ends: 3776 [2021-10-03 12:08:19,565 INFO L226 Difference]: Without dead ends: 3700 [2021-10-03 12:08:19,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 112.4ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:08:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2021-10-03 12:08:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3240. [2021-10-03 12:08:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3239 states have (on average 2.9953689410311823) internal successors, (9702), 3239 states have internal predecessors, (9702), 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-03 12:08:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 9702 transitions. [2021-10-03 12:08:19,657 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 9702 transitions. Word has length 38 [2021-10-03 12:08:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:19,658 INFO L470 AbstractCegarLoop]: Abstraction has 3240 states and 9702 transitions. [2021-10-03 12:08:19,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 9702 transitions. [2021-10-03 12:08:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:19,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:19,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-03 12:08:19,666 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -302769656, now seen corresponding path program 15 times [2021-10-03 12:08:19,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:19,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756711858] [2021-10-03 12:08:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:19,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:19,760 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-03 12:08:19,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:19,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756711858] [2021-10-03 12:08:19,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756711858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:19,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:19,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:19,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916886794] [2021-10-03 12:08:19,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:19,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:19,762 INFO L87 Difference]: Start difference. First operand 3240 states and 9702 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:20,004 INFO L93 Difference]: Finished difference Result 3442 states and 10177 transitions. [2021-10-03 12:08:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:20,014 INFO L225 Difference]: With dead ends: 3442 [2021-10-03 12:08:20,014 INFO L226 Difference]: Without dead ends: 3326 [2021-10-03 12:08:20,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2021-10-03 12:08:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3234. [2021-10-03 12:08:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3233 states have (on average 2.9959789669038046) internal successors, (9686), 3233 states have internal predecessors, (9686), 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-03 12:08:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9686 transitions. [2021-10-03 12:08:20,100 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9686 transitions. Word has length 38 [2021-10-03 12:08:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:20,101 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 9686 transitions. [2021-10-03 12:08:20,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9686 transitions. [2021-10-03 12:08:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:20,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:20,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:20,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-03 12:08:20,112 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:20,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -167685584, now seen corresponding path program 16 times [2021-10-03 12:08:20,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:20,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427129830] [2021-10-03 12:08:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:20,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:20,223 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-03 12:08:20,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:20,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427129830] [2021-10-03 12:08:20,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427129830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:20,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:20,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:20,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016906000] [2021-10-03 12:08:20,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:20,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:20,225 INFO L87 Difference]: Start difference. First operand 3234 states and 9686 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:20,412 INFO L93 Difference]: Finished difference Result 3316 states and 9861 transitions. [2021-10-03 12:08:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:08:20,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:20,422 INFO L225 Difference]: With dead ends: 3316 [2021-10-03 12:08:20,422 INFO L226 Difference]: Without dead ends: 3264 [2021-10-03 12:08:20,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2021-10-03 12:08:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3210. [2021-10-03 12:08:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3209 states have (on average 2.9965721408538486) internal successors, (9616), 3209 states have internal predecessors, (9616), 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-03 12:08:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 9616 transitions. [2021-10-03 12:08:20,509 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 9616 transitions. Word has length 38 [2021-10-03 12:08:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:20,510 INFO L470 AbstractCegarLoop]: Abstraction has 3210 states and 9616 transitions. [2021-10-03 12:08:20,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 9616 transitions. [2021-10-03 12:08:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:20,518 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:20,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:20,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-03 12:08:20,519 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 169066414, now seen corresponding path program 17 times [2021-10-03 12:08:20,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:20,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195676116] [2021-10-03 12:08:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:20,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:20,599 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-03 12:08:20,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:20,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195676116] [2021-10-03 12:08:20,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195676116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:20,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:20,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:20,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241251674] [2021-10-03 12:08:20,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:20,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:20,605 INFO L87 Difference]: Start difference. First operand 3210 states and 9616 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:20,824 INFO L93 Difference]: Finished difference Result 3818 states and 11374 transitions. [2021-10-03 12:08:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:20,836 INFO L225 Difference]: With dead ends: 3818 [2021-10-03 12:08:20,836 INFO L226 Difference]: Without dead ends: 3818 [2021-10-03 12:08:20,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.0ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2021-10-03 12:08:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3228. [2021-10-03 12:08:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3227 states have (on average 2.994731949178804) internal successors, (9664), 3227 states have internal predecessors, (9664), 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-03 12:08:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 9664 transitions. [2021-10-03 12:08:20,926 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 9664 transitions. Word has length 38 [2021-10-03 12:08:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:20,926 INFO L470 AbstractCegarLoop]: Abstraction has 3228 states and 9664 transitions. [2021-10-03 12:08:20,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 9664 transitions. [2021-10-03 12:08:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:20,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:20,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:20,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-03 12:08:20,936 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1238255244, now seen corresponding path program 18 times [2021-10-03 12:08:20,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:20,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040594861] [2021-10-03 12:08:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:20,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:21,060 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-03 12:08:21,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:21,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040594861] [2021-10-03 12:08:21,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040594861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:21,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:21,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:21,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971493475] [2021-10-03 12:08:21,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:21,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:21,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:21,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:21,062 INFO L87 Difference]: Start difference. First operand 3228 states and 9664 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:21,374 INFO L93 Difference]: Finished difference Result 4072 states and 12120 transitions. [2021-10-03 12:08:21,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:21,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:21,382 INFO L225 Difference]: With dead ends: 4072 [2021-10-03 12:08:21,383 INFO L226 Difference]: Without dead ends: 3994 [2021-10-03 12:08:21,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 104.3ms TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:08:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2021-10-03 12:08:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3230. [2021-10-03 12:08:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 3229 states have (on average 2.9956642923505727) internal successors, (9673), 3229 states have internal predecessors, (9673), 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-03 12:08:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 9673 transitions. [2021-10-03 12:08:21,474 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 9673 transitions. Word has length 38 [2021-10-03 12:08:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:21,474 INFO L470 AbstractCegarLoop]: Abstraction has 3230 states and 9673 transitions. [2021-10-03 12:08:21,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 9673 transitions. [2021-10-03 12:08:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:21,482 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:21,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:21,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-03 12:08:21,483 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:21,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash 642579744, now seen corresponding path program 19 times [2021-10-03 12:08:21,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:21,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112949365] [2021-10-03 12:08:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:21,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:21,580 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-03 12:08:21,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:21,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112949365] [2021-10-03 12:08:21,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112949365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:21,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:21,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:21,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684148890] [2021-10-03 12:08:21,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:21,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:21,585 INFO L87 Difference]: Start difference. First operand 3230 states and 9673 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:21,874 INFO L93 Difference]: Finished difference Result 3846 states and 11397 transitions. [2021-10-03 12:08:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:08:21,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:21,885 INFO L225 Difference]: With dead ends: 3846 [2021-10-03 12:08:21,885 INFO L226 Difference]: Without dead ends: 3728 [2021-10-03 12:08:21,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 90.9ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:08:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2021-10-03 12:08:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3210. [2021-10-03 12:08:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3209 states have (on average 2.9953256466188845) internal successors, (9612), 3209 states have internal predecessors, (9612), 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-03 12:08:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 9612 transitions. [2021-10-03 12:08:21,979 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 9612 transitions. Word has length 38 [2021-10-03 12:08:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:21,979 INFO L470 AbstractCegarLoop]: Abstraction has 3210 states and 9612 transitions. [2021-10-03 12:08:21,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 9612 transitions. [2021-10-03 12:08:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:21,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:21,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:21,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-03 12:08:21,991 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash -748183058, now seen corresponding path program 20 times [2021-10-03 12:08:21,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:21,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425954449] [2021-10-03 12:08:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:21,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:22,136 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-03 12:08:22,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:22,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425954449] [2021-10-03 12:08:22,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425954449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:22,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:22,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:22,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456487346] [2021-10-03 12:08:22,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:22,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:22,139 INFO L87 Difference]: Start difference. First operand 3210 states and 9612 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:22,376 INFO L93 Difference]: Finished difference Result 3720 states and 11042 transitions. [2021-10-03 12:08:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:22,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:22,388 INFO L225 Difference]: With dead ends: 3720 [2021-10-03 12:08:22,388 INFO L226 Difference]: Without dead ends: 3708 [2021-10-03 12:08:22,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 97.0ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:08:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2021-10-03 12:08:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3204. [2021-10-03 12:08:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 2.9950046831095847) internal successors, (9593), 3203 states have internal predecessors, (9593), 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-03 12:08:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 9593 transitions. [2021-10-03 12:08:22,485 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 9593 transitions. Word has length 38 [2021-10-03 12:08:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:22,485 INFO L470 AbstractCegarLoop]: Abstraction has 3204 states and 9593 transitions. [2021-10-03 12:08:22,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 9593 transitions. [2021-10-03 12:08:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:22,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:22,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:22,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-03 12:08:22,494 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2042859806, now seen corresponding path program 21 times [2021-10-03 12:08:22,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:22,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514917893] [2021-10-03 12:08:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:22,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:22,599 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-03 12:08:22,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:22,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514917893] [2021-10-03 12:08:22,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514917893] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:22,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:22,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:22,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079032753] [2021-10-03 12:08:22,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:22,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:22,602 INFO L87 Difference]: Start difference. First operand 3204 states and 9593 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:22,904 INFO L93 Difference]: Finished difference Result 3732 states and 11075 transitions. [2021-10-03 12:08:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:22,918 INFO L225 Difference]: With dead ends: 3732 [2021-10-03 12:08:22,918 INFO L226 Difference]: Without dead ends: 3656 [2021-10-03 12:08:22,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 89.9ms TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:08:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2021-10-03 12:08:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3200. [2021-10-03 12:08:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 3199 states have (on average 2.9956236323851204) internal successors, (9583), 3199 states have internal predecessors, (9583), 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-03 12:08:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9583 transitions. [2021-10-03 12:08:23,034 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9583 transitions. Word has length 38 [2021-10-03 12:08:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:23,035 INFO L470 AbstractCegarLoop]: Abstraction has 3200 states and 9583 transitions. [2021-10-03 12:08:23,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9583 transitions. [2021-10-03 12:08:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:23,045 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:23,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:23,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-03 12:08:23,045 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1861549680, now seen corresponding path program 22 times [2021-10-03 12:08:23,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:23,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292875485] [2021-10-03 12:08:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:23,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:23,150 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-03 12:08:23,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:23,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292875485] [2021-10-03 12:08:23,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292875485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:23,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:23,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:23,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745898973] [2021-10-03 12:08:23,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:23,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:23,153 INFO L87 Difference]: Start difference. First operand 3200 states and 9583 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:23,443 INFO L93 Difference]: Finished difference Result 3640 states and 10725 transitions. [2021-10-03 12:08:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:23,454 INFO L225 Difference]: With dead ends: 3640 [2021-10-03 12:08:23,454 INFO L226 Difference]: Without dead ends: 3524 [2021-10-03 12:08:23,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:08:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2021-10-03 12:08:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3190. [2021-10-03 12:08:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3189 states have (on average 2.9968642207588587) internal successors, (9557), 3189 states have internal predecessors, (9557), 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-03 12:08:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 9557 transitions. [2021-10-03 12:08:23,544 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 9557 transitions. Word has length 38 [2021-10-03 12:08:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:23,545 INFO L470 AbstractCegarLoop]: Abstraction has 3190 states and 9557 transitions. [2021-10-03 12:08:23,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 9557 transitions. [2021-10-03 12:08:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:23,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:23,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:23,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-03 12:08:23,553 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1636609228, now seen corresponding path program 23 times [2021-10-03 12:08:23,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:23,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388599461] [2021-10-03 12:08:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:23,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:23,621 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-03 12:08:23,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:23,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388599461] [2021-10-03 12:08:23,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388599461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:23,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:23,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:23,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535733215] [2021-10-03 12:08:23,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:23,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:23,624 INFO L87 Difference]: Start difference. First operand 3190 states and 9557 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:23,816 INFO L93 Difference]: Finished difference Result 3472 states and 10294 transitions. [2021-10-03 12:08:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:23,825 INFO L225 Difference]: With dead ends: 3472 [2021-10-03 12:08:23,825 INFO L226 Difference]: Without dead ends: 3472 [2021-10-03 12:08:23,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2021-10-03 12:08:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3108. [2021-10-03 12:08:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 2.9932410685548763) internal successors, (9300), 3107 states have internal predecessors, (9300), 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-03 12:08:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 9300 transitions. [2021-10-03 12:08:23,911 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 9300 transitions. Word has length 38 [2021-10-03 12:08:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:23,912 INFO L470 AbstractCegarLoop]: Abstraction has 3108 states and 9300 transitions. [2021-10-03 12:08:23,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-03 12:08:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 9300 transitions. [2021-10-03 12:08:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:23,920 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:23,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:23,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-03 12:08:23,921 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 229287570, now seen corresponding path program 24 times [2021-10-03 12:08:23,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:23,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327020722] [2021-10-03 12:08:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:23,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:24,012 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-03 12:08:24,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:24,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327020722] [2021-10-03 12:08:24,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327020722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:24,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:24,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:24,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748789435] [2021-10-03 12:08:24,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:24,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:24,014 INFO L87 Difference]: Start difference. First operand 3108 states and 9300 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:24,328 INFO L93 Difference]: Finished difference Result 3660 states and 10767 transitions. [2021-10-03 12:08:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:08:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:24,339 INFO L225 Difference]: With dead ends: 3660 [2021-10-03 12:08:24,339 INFO L226 Difference]: Without dead ends: 3582 [2021-10-03 12:08:24,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:08:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-10-03 12:08:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3066. [2021-10-03 12:08:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 2.9895595432300164) internal successors, (9163), 3065 states have internal predecessors, (9163), 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-03 12:08:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 9163 transitions. [2021-10-03 12:08:24,423 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 9163 transitions. Word has length 38 [2021-10-03 12:08:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:24,424 INFO L470 AbstractCegarLoop]: Abstraction has 3066 states and 9163 transitions. [2021-10-03 12:08:24,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 9163 transitions. [2021-10-03 12:08:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:24,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:24,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:24,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-03 12:08:24,431 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2110122558, now seen corresponding path program 25 times [2021-10-03 12:08:24,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:24,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49861915] [2021-10-03 12:08:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:24,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:24,515 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-03 12:08:24,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:24,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49861915] [2021-10-03 12:08:24,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49861915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:24,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:24,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:24,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916137255] [2021-10-03 12:08:24,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:24,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:24,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:24,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:24,517 INFO L87 Difference]: Start difference. First operand 3066 states and 9163 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:24,753 INFO L93 Difference]: Finished difference Result 3296 states and 9659 transitions. [2021-10-03 12:08:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:24,763 INFO L225 Difference]: With dead ends: 3296 [2021-10-03 12:08:24,763 INFO L226 Difference]: Without dead ends: 3178 [2021-10-03 12:08:24,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2021-10-03 12:08:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2878. [2021-10-03 12:08:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 2.9760166840458813) internal successors, (8562), 2877 states have internal predecessors, (8562), 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-03 12:08:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 8562 transitions. [2021-10-03 12:08:24,842 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 8562 transitions. Word has length 38 [2021-10-03 12:08:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:24,843 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 8562 transitions. [2021-10-03 12:08:24,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 8562 transitions. [2021-10-03 12:08:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:24,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:24,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:24,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-03 12:08:24,850 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1674672750, now seen corresponding path program 26 times [2021-10-03 12:08:24,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:24,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693270498] [2021-10-03 12:08:24,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:24,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:24,953 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-03 12:08:24,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:24,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693270498] [2021-10-03 12:08:24,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693270498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:24,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:24,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:24,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829529808] [2021-10-03 12:08:24,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:24,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:24,959 INFO L87 Difference]: Start difference. First operand 2878 states and 8562 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:25,206 INFO L93 Difference]: Finished difference Result 2222 states and 6127 transitions. [2021-10-03 12:08:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:25,211 INFO L225 Difference]: With dead ends: 2222 [2021-10-03 12:08:25,212 INFO L226 Difference]: Without dead ends: 1948 [2021-10-03 12:08:25,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 63.1ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2021-10-03 12:08:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1764. [2021-10-03 12:08:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.770845150311968) internal successors, (4885), 1763 states have internal predecessors, (4885), 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-03 12:08:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4885 transitions. [2021-10-03 12:08:25,258 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 4885 transitions. Word has length 38 [2021-10-03 12:08:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:25,259 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 4885 transitions. [2021-10-03 12:08:25,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:08:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 4885 transitions. [2021-10-03 12:08:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:25,263 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:25,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:25,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-03 12:08:25,264 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 829731678, now seen corresponding path program 27 times [2021-10-03 12:08:25,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:25,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435284660] [2021-10-03 12:08:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:25,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:25,398 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-03 12:08:25,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:25,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435284660] [2021-10-03 12:08:25,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435284660] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:25,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:25,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:25,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000691645] [2021-10-03 12:08:25,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:25,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:25,400 INFO L87 Difference]: Start difference. First operand 1764 states and 4885 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:25,918 INFO L93 Difference]: Finished difference Result 2218 states and 6017 transitions. [2021-10-03 12:08:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:08:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:25,922 INFO L225 Difference]: With dead ends: 2218 [2021-10-03 12:08:25,923 INFO L226 Difference]: Without dead ends: 2122 [2021-10-03 12:08:25,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:08:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2021-10-03 12:08:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1838. [2021-10-03 12:08:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 2.7468698965704954) internal successors, (5046), 1837 states have internal predecessors, (5046), 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-03 12:08:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 5046 transitions. [2021-10-03 12:08:25,955 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 5046 transitions. Word has length 38 [2021-10-03 12:08:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:25,955 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 5046 transitions. [2021-10-03 12:08:25,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 5046 transitions. [2021-10-03 12:08:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:25,959 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:25,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:25,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-03 12:08:25,960 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1701777522, now seen corresponding path program 28 times [2021-10-03 12:08:25,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:25,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499219410] [2021-10-03 12:08:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:25,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:26,062 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-03 12:08:26,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:26,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499219410] [2021-10-03 12:08:26,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499219410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:26,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:26,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:26,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166941652] [2021-10-03 12:08:26,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:26,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:26,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:26,064 INFO L87 Difference]: Start difference. First operand 1838 states and 5046 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:26,636 INFO L93 Difference]: Finished difference Result 3080 states and 8415 transitions. [2021-10-03 12:08:26,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-03 12:08:26,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:26,644 INFO L225 Difference]: With dead ends: 3080 [2021-10-03 12:08:26,645 INFO L226 Difference]: Without dead ends: 2972 [2021-10-03 12:08:26,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:08:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2021-10-03 12:08:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1898. [2021-10-03 12:08:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 2.7601476014760147) internal successors, (5236), 1897 states have internal predecessors, (5236), 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-03 12:08:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5236 transitions. [2021-10-03 12:08:26,698 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5236 transitions. Word has length 38 [2021-10-03 12:08:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:26,699 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 5236 transitions. [2021-10-03 12:08:26,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5236 transitions. [2021-10-03 12:08:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:26,705 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:26,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:26,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-03 12:08:26,706 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1747792828, now seen corresponding path program 29 times [2021-10-03 12:08:26,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:26,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328801255] [2021-10-03 12:08:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:26,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:26,845 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-03 12:08:26,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:26,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328801255] [2021-10-03 12:08:26,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328801255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:26,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:26,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:26,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905019101] [2021-10-03 12:08:26,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:26,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:26,849 INFO L87 Difference]: Start difference. First operand 1898 states and 5236 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:27,589 INFO L93 Difference]: Finished difference Result 3204 states and 8729 transitions. [2021-10-03 12:08:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-03 12:08:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:27,595 INFO L225 Difference]: With dead ends: 3204 [2021-10-03 12:08:27,595 INFO L226 Difference]: Without dead ends: 3056 [2021-10-03 12:08:27,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 262.2ms TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2021-10-03 12:08:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2021-10-03 12:08:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 1890. [2021-10-03 12:08:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 2.7623080995235574) internal successors, (5218), 1889 states have internal predecessors, (5218), 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-03 12:08:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 5218 transitions. [2021-10-03 12:08:27,649 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 5218 transitions. Word has length 38 [2021-10-03 12:08:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:27,649 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 5218 transitions. [2021-10-03 12:08:27,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 5218 transitions. [2021-10-03 12:08:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:27,654 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:27,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:27,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-03 12:08:27,654 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2103062348, now seen corresponding path program 30 times [2021-10-03 12:08:27,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:27,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287709503] [2021-10-03 12:08:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:27,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:27,787 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-03 12:08:27,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:27,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287709503] [2021-10-03 12:08:27,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287709503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:27,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:27,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:27,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706073897] [2021-10-03 12:08:27,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:27,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:27,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:27,790 INFO L87 Difference]: Start difference. First operand 1890 states and 5218 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:28,237 INFO L93 Difference]: Finished difference Result 2350 states and 6348 transitions. [2021-10-03 12:08:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:28,242 INFO L225 Difference]: With dead ends: 2350 [2021-10-03 12:08:28,242 INFO L226 Difference]: Without dead ends: 2274 [2021-10-03 12:08:28,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 151.2ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:08:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2021-10-03 12:08:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1964. [2021-10-03 12:08:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1963 states have (on average 2.7361181864493123) internal successors, (5371), 1963 states have internal predecessors, (5371), 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-03 12:08:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 5371 transitions. [2021-10-03 12:08:28,284 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 5371 transitions. Word has length 38 [2021-10-03 12:08:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:28,284 INFO L470 AbstractCegarLoop]: Abstraction has 1964 states and 5371 transitions. [2021-10-03 12:08:28,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 5371 transitions. [2021-10-03 12:08:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:28,289 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:28,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:28,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-03 12:08:28,290 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash 622773290, now seen corresponding path program 31 times [2021-10-03 12:08:28,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:28,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273142297] [2021-10-03 12:08:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:28,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:28,401 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-03 12:08:28,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:28,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273142297] [2021-10-03 12:08:28,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273142297] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:28,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:28,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:28,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200953589] [2021-10-03 12:08:28,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:28,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:28,404 INFO L87 Difference]: Start difference. First operand 1964 states and 5371 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:29,109 INFO L93 Difference]: Finished difference Result 2852 states and 7572 transitions. [2021-10-03 12:08:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-03 12:08:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:29,115 INFO L225 Difference]: With dead ends: 2852 [2021-10-03 12:08:29,116 INFO L226 Difference]: Without dead ends: 2708 [2021-10-03 12:08:29,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 268.3ms TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2021-10-03 12:08:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-10-03 12:08:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 1992. [2021-10-03 12:08:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 2.74585635359116) internal successors, (5467), 1991 states have internal predecessors, (5467), 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-03 12:08:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 5467 transitions. [2021-10-03 12:08:29,160 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 5467 transitions. Word has length 38 [2021-10-03 12:08:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:29,160 INFO L470 AbstractCegarLoop]: Abstraction has 1992 states and 5467 transitions. [2021-10-03 12:08:29,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 5467 transitions. [2021-10-03 12:08:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:29,164 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:29,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:29,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-03 12:08:29,165 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1462750110, now seen corresponding path program 32 times [2021-10-03 12:08:29,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:29,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620782629] [2021-10-03 12:08:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:29,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:29,269 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-03 12:08:29,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:29,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620782629] [2021-10-03 12:08:29,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620782629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:29,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:29,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:29,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651340914] [2021-10-03 12:08:29,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:29,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:29,272 INFO L87 Difference]: Start difference. First operand 1992 states and 5467 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:29,823 INFO L93 Difference]: Finished difference Result 2896 states and 7633 transitions. [2021-10-03 12:08:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:29,830 INFO L225 Difference]: With dead ends: 2896 [2021-10-03 12:08:29,831 INFO L226 Difference]: Without dead ends: 2788 [2021-10-03 12:08:29,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 170.5ms TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:08:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2021-10-03 12:08:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1960. [2021-10-03 12:08:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 2.731495661051557) internal successors, (5351), 1959 states have internal predecessors, (5351), 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-03 12:08:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 5351 transitions. [2021-10-03 12:08:29,883 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 5351 transitions. Word has length 38 [2021-10-03 12:08:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:29,884 INFO L470 AbstractCegarLoop]: Abstraction has 1960 states and 5351 transitions. [2021-10-03 12:08:29,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 5351 transitions. [2021-10-03 12:08:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:29,889 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:29,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:29,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-03 12:08:29,890 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1508765416, now seen corresponding path program 33 times [2021-10-03 12:08:29,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:29,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661548376] [2021-10-03 12:08:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:29,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:30,004 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-03 12:08:30,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:30,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661548376] [2021-10-03 12:08:30,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661548376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:30,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:30,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:30,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174725232] [2021-10-03 12:08:30,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:30,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:30,006 INFO L87 Difference]: Start difference. First operand 1960 states and 5351 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:30,629 INFO L93 Difference]: Finished difference Result 2880 states and 7553 transitions. [2021-10-03 12:08:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-03 12:08:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:30,635 INFO L225 Difference]: With dead ends: 2880 [2021-10-03 12:08:30,635 INFO L226 Difference]: Without dead ends: 2774 [2021-10-03 12:08:30,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 206.1ms TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2021-10-03 12:08:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1956. [2021-10-03 12:08:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 2.730946291560102) internal successors, (5339), 1955 states have internal predecessors, (5339), 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-03 12:08:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 5339 transitions. [2021-10-03 12:08:30,689 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 5339 transitions. Word has length 38 [2021-10-03 12:08:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:30,689 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 5339 transitions. [2021-10-03 12:08:30,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 5339 transitions. [2021-10-03 12:08:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:30,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:30,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:30,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-03 12:08:30,694 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1681381784, now seen corresponding path program 34 times [2021-10-03 12:08:30,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:30,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438587833] [2021-10-03 12:08:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:30,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:30,797 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-03 12:08:30,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:30,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438587833] [2021-10-03 12:08:30,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438587833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:30,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:30,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:30,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728990765] [2021-10-03 12:08:30,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:30,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:30,800 INFO L87 Difference]: Start difference. First operand 1956 states and 5339 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:31,257 INFO L93 Difference]: Finished difference Result 2972 states and 8017 transitions. [2021-10-03 12:08:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:08:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:31,264 INFO L225 Difference]: With dead ends: 2972 [2021-10-03 12:08:31,264 INFO L226 Difference]: Without dead ends: 2888 [2021-10-03 12:08:31,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 151.3ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:08:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-10-03 12:08:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1956. [2021-10-03 12:08:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1955 states have (on average 2.729923273657289) internal successors, (5337), 1955 states have internal predecessors, (5337), 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-03 12:08:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 5337 transitions. [2021-10-03 12:08:31,312 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 5337 transitions. Word has length 38 [2021-10-03 12:08:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:31,312 INFO L470 AbstractCegarLoop]: Abstraction has 1956 states and 5337 transitions. [2021-10-03 12:08:31,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 5337 transitions. [2021-10-03 12:08:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:31,318 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:31,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:31,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-03 12:08:31,319 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash -982102132, now seen corresponding path program 35 times [2021-10-03 12:08:31,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:31,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803111544] [2021-10-03 12:08:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:31,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:31,437 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-03 12:08:31,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:31,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803111544] [2021-10-03 12:08:31,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803111544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:31,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:31,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:31,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770176981] [2021-10-03 12:08:31,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:31,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:31,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:31,440 INFO L87 Difference]: Start difference. First operand 1956 states and 5337 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:32,060 INFO L93 Difference]: Finished difference Result 2598 states and 6755 transitions. [2021-10-03 12:08:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:32,066 INFO L225 Difference]: With dead ends: 2598 [2021-10-03 12:08:32,066 INFO L226 Difference]: Without dead ends: 2508 [2021-10-03 12:08:32,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 206.1ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:08:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2021-10-03 12:08:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1682. [2021-10-03 12:08:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 2.6698393813206427) internal successors, (4488), 1681 states have internal predecessors, (4488), 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-03 12:08:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4488 transitions. [2021-10-03 12:08:32,107 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4488 transitions. Word has length 38 [2021-10-03 12:08:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:32,107 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 4488 transitions. [2021-10-03 12:08:32,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4488 transitions. [2021-10-03 12:08:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:32,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:32,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:32,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-03 12:08:32,113 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:32,114 INFO L82 PathProgramCache]: Analyzing trace with hash 220660494, now seen corresponding path program 36 times [2021-10-03 12:08:32,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:32,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23057535] [2021-10-03 12:08:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:32,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:32,217 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-03 12:08:32,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:32,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23057535] [2021-10-03 12:08:32,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23057535] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:32,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:32,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:32,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075394810] [2021-10-03 12:08:32,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:32,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:32,221 INFO L87 Difference]: Start difference. First operand 1682 states and 4488 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:32,632 INFO L93 Difference]: Finished difference Result 1972 states and 5219 transitions. [2021-10-03 12:08:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:32,638 INFO L225 Difference]: With dead ends: 1972 [2021-10-03 12:08:32,638 INFO L226 Difference]: Without dead ends: 1958 [2021-10-03 12:08:32,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 164.0ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:08:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-10-03 12:08:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1682. [2021-10-03 12:08:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 2.6662700773349197) internal successors, (4482), 1681 states have internal predecessors, (4482), 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-03 12:08:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4482 transitions. [2021-10-03 12:08:32,682 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4482 transitions. Word has length 38 [2021-10-03 12:08:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:32,682 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 4482 transitions. [2021-10-03 12:08:32,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4482 transitions. [2021-10-03 12:08:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:32,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:32,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:32,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-03 12:08:32,686 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1820405946, now seen corresponding path program 37 times [2021-10-03 12:08:32,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:32,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962326446] [2021-10-03 12:08:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:32,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:32,784 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-03 12:08:32,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:32,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962326446] [2021-10-03 12:08:32,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962326446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:32,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:32,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:32,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420394892] [2021-10-03 12:08:32,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:32,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:32,787 INFO L87 Difference]: Start difference. First operand 1682 states and 4482 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:33,347 INFO L93 Difference]: Finished difference Result 3052 states and 8148 transitions. [2021-10-03 12:08:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:08:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:33,356 INFO L225 Difference]: With dead ends: 3052 [2021-10-03 12:08:33,357 INFO L226 Difference]: Without dead ends: 3010 [2021-10-03 12:08:33,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 193.6ms TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2021-10-03 12:08:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1794. [2021-10-03 12:08:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1793 states have (on average 2.6815393195761295) internal successors, (4808), 1793 states have internal predecessors, (4808), 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-03 12:08:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 4808 transitions. [2021-10-03 12:08:33,425 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 4808 transitions. Word has length 38 [2021-10-03 12:08:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:33,425 INFO L470 AbstractCegarLoop]: Abstraction has 1794 states and 4808 transitions. [2021-10-03 12:08:33,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 4808 transitions. [2021-10-03 12:08:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:33,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:33,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:33,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-03 12:08:33,431 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1977001668, now seen corresponding path program 38 times [2021-10-03 12:08:33,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:33,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101981578] [2021-10-03 12:08:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:33,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:33,547 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-03 12:08:33,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:33,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101981578] [2021-10-03 12:08:33,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101981578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:33,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:33,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:33,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757929662] [2021-10-03 12:08:33,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:33,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:33,550 INFO L87 Difference]: Start difference. First operand 1794 states and 4808 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:34,079 INFO L93 Difference]: Finished difference Result 2240 states and 5916 transitions. [2021-10-03 12:08:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:34,088 INFO L225 Difference]: With dead ends: 2240 [2021-10-03 12:08:34,088 INFO L226 Difference]: Without dead ends: 2154 [2021-10-03 12:08:34,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 172.4ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:08:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2021-10-03 12:08:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1884. [2021-10-03 12:08:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 2.651619755708975) internal successors, (4993), 1883 states have internal predecessors, (4993), 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-03 12:08:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4993 transitions. [2021-10-03 12:08:34,159 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 4993 transitions. Word has length 38 [2021-10-03 12:08:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:34,160 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 4993 transitions. [2021-10-03 12:08:34,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 4993 transitions. [2021-10-03 12:08:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:34,167 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:34,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:34,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-03 12:08:34,168 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1434981776, now seen corresponding path program 39 times [2021-10-03 12:08:34,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:34,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307621967] [2021-10-03 12:08:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:34,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:34,301 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-03 12:08:34,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:34,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307621967] [2021-10-03 12:08:34,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307621967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:34,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:34,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:34,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144821696] [2021-10-03 12:08:34,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:34,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:34,305 INFO L87 Difference]: Start difference. First operand 1884 states and 4993 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:35,001 INFO L93 Difference]: Finished difference Result 2894 states and 7482 transitions. [2021-10-03 12:08:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-03 12:08:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:35,009 INFO L225 Difference]: With dead ends: 2894 [2021-10-03 12:08:35,010 INFO L226 Difference]: Without dead ends: 2730 [2021-10-03 12:08:35,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 270.0ms TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2021-10-03 12:08:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2021-10-03 12:08:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1910. [2021-10-03 12:08:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 2.6636982713462545) internal successors, (5085), 1909 states have internal predecessors, (5085), 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-03 12:08:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 5085 transitions. [2021-10-03 12:08:35,062 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 5085 transitions. Word has length 38 [2021-10-03 12:08:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:35,062 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 5085 transitions. [2021-10-03 12:08:35,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 5085 transitions. [2021-10-03 12:08:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:35,066 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:35,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:35,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-03 12:08:35,067 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 666450324, now seen corresponding path program 40 times [2021-10-03 12:08:35,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:35,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408856969] [2021-10-03 12:08:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:35,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:35,173 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-03 12:08:35,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:35,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408856969] [2021-10-03 12:08:35,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408856969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:35,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:35,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:35,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100936624] [2021-10-03 12:08:35,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:35,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:35,176 INFO L87 Difference]: Start difference. First operand 1910 states and 5085 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:35,654 INFO L93 Difference]: Finished difference Result 2850 states and 7318 transitions. [2021-10-03 12:08:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:08:35,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:35,660 INFO L225 Difference]: With dead ends: 2850 [2021-10-03 12:08:35,660 INFO L226 Difference]: Without dead ends: 2826 [2021-10-03 12:08:35,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 155.8ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:08:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2021-10-03 12:08:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1820. [2021-10-03 12:08:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1819 states have (on average 2.645959318306762) internal successors, (4813), 1819 states have internal predecessors, (4813), 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-03 12:08:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4813 transitions. [2021-10-03 12:08:35,698 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4813 transitions. Word has length 38 [2021-10-03 12:08:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:35,699 INFO L470 AbstractCegarLoop]: Abstraction has 1820 states and 4813 transitions. [2021-10-03 12:08:35,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4813 transitions. [2021-10-03 12:08:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:35,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:35,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:35,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-03 12:08:35,704 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash 912486980, now seen corresponding path program 41 times [2021-10-03 12:08:35,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:35,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006809267] [2021-10-03 12:08:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:35,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:35,821 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-03 12:08:35,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:35,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006809267] [2021-10-03 12:08:35,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006809267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:35,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:35,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:35,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899545394] [2021-10-03 12:08:35,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:35,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:35,825 INFO L87 Difference]: Start difference. First operand 1820 states and 4813 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:36,380 INFO L93 Difference]: Finished difference Result 2530 states and 6367 transitions. [2021-10-03 12:08:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:36,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:36,385 INFO L225 Difference]: With dead ends: 2530 [2021-10-03 12:08:36,385 INFO L226 Difference]: Without dead ends: 2416 [2021-10-03 12:08:36,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 196.0ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:08:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2021-10-03 12:08:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1474. [2021-10-03 12:08:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1473 states have (on average 2.5736591989137816) internal successors, (3791), 1473 states have internal predecessors, (3791), 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-03 12:08:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 3791 transitions. [2021-10-03 12:08:36,417 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 3791 transitions. Word has length 38 [2021-10-03 12:08:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:36,417 INFO L470 AbstractCegarLoop]: Abstraction has 1474 states and 3791 transitions. [2021-10-03 12:08:36,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 3791 transitions. [2021-10-03 12:08:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:36,420 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:36,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:36,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-03 12:08:36,420 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1358672242, now seen corresponding path program 42 times [2021-10-03 12:08:36,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:36,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346462015] [2021-10-03 12:08:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:36,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:36,513 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-03 12:08:36,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:36,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346462015] [2021-10-03 12:08:36,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346462015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:36,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:36,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:36,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225649129] [2021-10-03 12:08:36,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:36,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:36,517 INFO L87 Difference]: Start difference. First operand 1474 states and 3791 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:36,927 INFO L93 Difference]: Finished difference Result 1850 states and 4761 transitions. [2021-10-03 12:08:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:36,935 INFO L225 Difference]: With dead ends: 1850 [2021-10-03 12:08:36,935 INFO L226 Difference]: Without dead ends: 1796 [2021-10-03 12:08:36,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 138.9ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:08:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2021-10-03 12:08:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1542. [2021-10-03 12:08:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 2.580791693705386) internal successors, (3977), 1541 states have internal predecessors, (3977), 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-03 12:08:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 3977 transitions. [2021-10-03 12:08:36,986 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 3977 transitions. Word has length 38 [2021-10-03 12:08:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:36,986 INFO L470 AbstractCegarLoop]: Abstraction has 1542 states and 3977 transitions. [2021-10-03 12:08:36,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 3977 transitions. [2021-10-03 12:08:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:36,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:36,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:36,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-03 12:08:36,992 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 513731170, now seen corresponding path program 43 times [2021-10-03 12:08:36,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:36,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422670934] [2021-10-03 12:08:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:36,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:37,123 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-03 12:08:37,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:37,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422670934] [2021-10-03 12:08:37,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422670934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:37,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:37,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:37,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35693022] [2021-10-03 12:08:37,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:37,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:37,127 INFO L87 Difference]: Start difference. First operand 1542 states and 3977 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:37,715 INFO L93 Difference]: Finished difference Result 1990 states and 5025 transitions. [2021-10-03 12:08:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:08:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:37,721 INFO L225 Difference]: With dead ends: 1990 [2021-10-03 12:08:37,721 INFO L226 Difference]: Without dead ends: 1940 [2021-10-03 12:08:37,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 253.2ms TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:08:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-10-03 12:08:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1602. [2021-10-03 12:08:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 2.570893191755153) internal successors, (4116), 1601 states have internal predecessors, (4116), 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-03 12:08:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 4116 transitions. [2021-10-03 12:08:37,763 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 4116 transitions. Word has length 38 [2021-10-03 12:08:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:37,763 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 4116 transitions. [2021-10-03 12:08:37,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 4116 transitions. [2021-10-03 12:08:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:37,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:37,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:37,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-03 12:08:37,768 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1385777014, now seen corresponding path program 44 times [2021-10-03 12:08:37,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:37,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807528820] [2021-10-03 12:08:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:37,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:37,882 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-03 12:08:37,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:37,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807528820] [2021-10-03 12:08:37,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807528820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:37,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:37,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:37,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067873984] [2021-10-03 12:08:37,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:37,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:37,885 INFO L87 Difference]: Start difference. First operand 1602 states and 4116 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:38,435 INFO L93 Difference]: Finished difference Result 2554 states and 6427 transitions. [2021-10-03 12:08:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-03 12:08:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:38,442 INFO L225 Difference]: With dead ends: 2554 [2021-10-03 12:08:38,442 INFO L226 Difference]: Without dead ends: 2514 [2021-10-03 12:08:38,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 225.0ms TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2021-10-03 12:08:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1692. [2021-10-03 12:08:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 2.584861028976937) internal successors, (4371), 1691 states have internal predecessors, (4371), 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-03 12:08:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 4371 transitions. [2021-10-03 12:08:38,486 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 4371 transitions. Word has length 38 [2021-10-03 12:08:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:38,487 INFO L470 AbstractCegarLoop]: Abstraction has 1692 states and 4371 transitions. [2021-10-03 12:08:38,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 4371 transitions. [2021-10-03 12:08:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:38,492 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:38,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:38,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-03 12:08:38,492 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1431792320, now seen corresponding path program 45 times [2021-10-03 12:08:38,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:38,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295720267] [2021-10-03 12:08:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:38,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:38,611 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-03 12:08:38,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:38,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295720267] [2021-10-03 12:08:38,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295720267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:38,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:38,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:38,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512591589] [2021-10-03 12:08:38,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:38,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:38,614 INFO L87 Difference]: Start difference. First operand 1692 states and 4371 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:39,336 INFO L93 Difference]: Finished difference Result 2676 states and 6655 transitions. [2021-10-03 12:08:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-03 12:08:39,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:39,344 INFO L225 Difference]: With dead ends: 2676 [2021-10-03 12:08:39,344 INFO L226 Difference]: Without dead ends: 2618 [2021-10-03 12:08:39,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 285.4ms TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2021-10-03 12:08:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-10-03 12:08:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1672. [2021-10-03 12:08:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 2.5846798324356675) internal successors, (4319), 1671 states have internal predecessors, (4319), 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-03 12:08:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4319 transitions. [2021-10-03 12:08:39,376 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4319 transitions. Word has length 38 [2021-10-03 12:08:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:39,376 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 4319 transitions. [2021-10-03 12:08:39,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4319 transitions. [2021-10-03 12:08:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:39,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:39,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:39,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-03 12:08:39,380 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1592411618, now seen corresponding path program 46 times [2021-10-03 12:08:39,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:39,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479699715] [2021-10-03 12:08:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:39,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:39,496 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-03 12:08:39,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:39,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479699715] [2021-10-03 12:08:39,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479699715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:39,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:39,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:39,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063246783] [2021-10-03 12:08:39,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:39,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:39,500 INFO L87 Difference]: Start difference. First operand 1672 states and 4319 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:39,899 INFO L93 Difference]: Finished difference Result 1950 states and 4991 transitions. [2021-10-03 12:08:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:39,904 INFO L225 Difference]: With dead ends: 1950 [2021-10-03 12:08:39,905 INFO L226 Difference]: Without dead ends: 1926 [2021-10-03 12:08:39,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 194.3ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-10-03 12:08:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1670. [2021-10-03 12:08:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 2.5847813061713603) internal successors, (4314), 1669 states have internal predecessors, (4314), 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-03 12:08:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4314 transitions. [2021-10-03 12:08:39,989 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4314 transitions. Word has length 38 [2021-10-03 12:08:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:39,990 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 4314 transitions. [2021-10-03 12:08:39,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4314 transitions. [2021-10-03 12:08:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:39,998 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:39,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:39,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-03 12:08:39,999 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash 365018610, now seen corresponding path program 47 times [2021-10-03 12:08:40,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:40,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327338108] [2021-10-03 12:08:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:40,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:40,132 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-03 12:08:40,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:40,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327338108] [2021-10-03 12:08:40,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327338108] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:40,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:40,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:40,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139407017] [2021-10-03 12:08:40,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:40,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:40,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:40,135 INFO L87 Difference]: Start difference. First operand 1670 states and 4314 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:40,595 INFO L93 Difference]: Finished difference Result 1978 states and 4961 transitions. [2021-10-03 12:08:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:40,599 INFO L225 Difference]: With dead ends: 1978 [2021-10-03 12:08:40,599 INFO L226 Difference]: Without dead ends: 1898 [2021-10-03 12:08:40,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 154.4ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:08:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-10-03 12:08:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1636. [2021-10-03 12:08:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 2.5718654434250765) internal successors, (4205), 1635 states have internal predecessors, (4205), 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-03 12:08:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4205 transitions. [2021-10-03 12:08:40,630 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4205 transitions. Word has length 38 [2021-10-03 12:08:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 4205 transitions. [2021-10-03 12:08:40,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4205 transitions. [2021-10-03 12:08:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:40,634 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:40,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:40,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-03 12:08:40,635 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1115270448, now seen corresponding path program 48 times [2021-10-03 12:08:40,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:40,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060582033] [2021-10-03 12:08:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:40,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:40,736 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-03 12:08:40,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:40,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060582033] [2021-10-03 12:08:40,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060582033] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:40,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:40,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:40,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870083820] [2021-10-03 12:08:40,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:40,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:40,739 INFO L87 Difference]: Start difference. First operand 1636 states and 4205 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:41,356 INFO L93 Difference]: Finished difference Result 2346 states and 5837 transitions. [2021-10-03 12:08:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:41,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:41,362 INFO L225 Difference]: With dead ends: 2346 [2021-10-03 12:08:41,362 INFO L226 Difference]: Without dead ends: 2316 [2021-10-03 12:08:41,363 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 217.3ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-10-03 12:08:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1660. [2021-10-03 12:08:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 2.5780590717299576) internal successors, (4277), 1659 states have internal predecessors, (4277), 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-03 12:08:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 4277 transitions. [2021-10-03 12:08:41,402 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 4277 transitions. Word has length 38 [2021-10-03 12:08:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:41,402 INFO L470 AbstractCegarLoop]: Abstraction has 1660 states and 4277 transitions. [2021-10-03 12:08:41,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 4277 transitions. [2021-10-03 12:08:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:41,405 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:41,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:41,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-03 12:08:41,406 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:41,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash -275293628, now seen corresponding path program 49 times [2021-10-03 12:08:41,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:41,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309324283] [2021-10-03 12:08:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:41,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:41,510 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-03 12:08:41,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:41,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309324283] [2021-10-03 12:08:41,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309324283] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:41,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:41,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:41,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901342924] [2021-10-03 12:08:41,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:41,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:41,513 INFO L87 Difference]: Start difference. First operand 1660 states and 4277 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:41,997 INFO L93 Difference]: Finished difference Result 2364 states and 5981 transitions. [2021-10-03 12:08:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:08:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:42,002 INFO L225 Difference]: With dead ends: 2364 [2021-10-03 12:08:42,002 INFO L226 Difference]: Without dead ends: 2346 [2021-10-03 12:08:42,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 183.3ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:08:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2021-10-03 12:08:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1678. [2021-10-03 12:08:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1677 states have (on average 2.577221228384019) internal successors, (4322), 1677 states have internal predecessors, (4322), 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-03 12:08:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4322 transitions. [2021-10-03 12:08:42,029 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4322 transitions. Word has length 38 [2021-10-03 12:08:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:42,030 INFO L470 AbstractCegarLoop]: Abstraction has 1678 states and 4322 transitions. [2021-10-03 12:08:42,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4322 transitions. [2021-10-03 12:08:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:42,034 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:42,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:42,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-03 12:08:42,035 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash -229278322, now seen corresponding path program 50 times [2021-10-03 12:08:42,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:42,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544490190] [2021-10-03 12:08:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:42,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:42,137 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-03 12:08:42,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:42,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544490190] [2021-10-03 12:08:42,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544490190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:42,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:42,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:42,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831649328] [2021-10-03 12:08:42,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:42,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:42,140 INFO L87 Difference]: Start difference. First operand 1678 states and 4322 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:42,646 INFO L93 Difference]: Finished difference Result 2368 states and 5983 transitions. [2021-10-03 12:08:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:42,653 INFO L225 Difference]: With dead ends: 2368 [2021-10-03 12:08:42,653 INFO L226 Difference]: Without dead ends: 2352 [2021-10-03 12:08:42,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 205.9ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2021-10-03 12:08:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1676. [2021-10-03 12:08:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 2.5773134328358207) internal successors, (4317), 1675 states have internal predecessors, (4317), 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-03 12:08:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 4317 transitions. [2021-10-03 12:08:42,697 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 4317 transitions. Word has length 38 [2021-10-03 12:08:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:42,698 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 4317 transitions. [2021-10-03 12:08:42,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 4317 transitions. [2021-10-03 12:08:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:42,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:42,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:42,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-03 12:08:42,704 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1218265080, now seen corresponding path program 51 times [2021-10-03 12:08:42,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:42,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225946084] [2021-10-03 12:08:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:42,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:42,832 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-03 12:08:42,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:42,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225946084] [2021-10-03 12:08:42,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225946084] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:42,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:42,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:42,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86140646] [2021-10-03 12:08:42,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:42,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:42,835 INFO L87 Difference]: Start difference. First operand 1676 states and 4317 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:43,300 INFO L93 Difference]: Finished difference Result 2408 states and 6061 transitions. [2021-10-03 12:08:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:08:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:43,305 INFO L225 Difference]: With dead ends: 2408 [2021-10-03 12:08:43,305 INFO L226 Difference]: Without dead ends: 2390 [2021-10-03 12:08:43,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 160.3ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:08:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2021-10-03 12:08:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1670. [2021-10-03 12:08:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 2.5727980826842423) internal successors, (4294), 1669 states have internal predecessors, (4294), 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-03 12:08:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4294 transitions. [2021-10-03 12:08:43,332 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4294 transitions. Word has length 38 [2021-10-03 12:08:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:43,333 INFO L470 AbstractCegarLoop]: Abstraction has 1670 states and 4294 transitions. [2021-10-03 12:08:43,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4294 transitions. [2021-10-03 12:08:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:43,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:43,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:43,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-03 12:08:43,337 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 875541774, now seen corresponding path program 52 times [2021-10-03 12:08:43,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:43,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873812089] [2021-10-03 12:08:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:43,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:43,450 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-03 12:08:43,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:43,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873812089] [2021-10-03 12:08:43,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873812089] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:43,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:43,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:43,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200391918] [2021-10-03 12:08:43,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:43,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:43,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:43,453 INFO L87 Difference]: Start difference. First operand 1670 states and 4294 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:43,933 INFO L93 Difference]: Finished difference Result 2416 states and 6065 transitions. [2021-10-03 12:08:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:08:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:43,938 INFO L225 Difference]: With dead ends: 2416 [2021-10-03 12:08:43,938 INFO L226 Difference]: Without dead ends: 2402 [2021-10-03 12:08:43,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:08:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2021-10-03 12:08:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1674. [2021-10-03 12:08:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 2.5762104004781827) internal successors, (4310), 1673 states have internal predecessors, (4310), 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-03 12:08:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 4310 transitions. [2021-10-03 12:08:43,984 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 4310 transitions. Word has length 38 [2021-10-03 12:08:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:43,985 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 4310 transitions. [2021-10-03 12:08:43,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 4310 transitions. [2021-10-03 12:08:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:43,989 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:43,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:43,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-03 12:08:43,990 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:43,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1574821426, now seen corresponding path program 53 times [2021-10-03 12:08:43,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:43,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953414624] [2021-10-03 12:08:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:43,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:44,096 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-03 12:08:44,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:44,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953414624] [2021-10-03 12:08:44,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953414624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:44,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:44,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:44,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480170015] [2021-10-03 12:08:44,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:44,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:44,098 INFO L87 Difference]: Start difference. First operand 1674 states and 4310 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:44,691 INFO L93 Difference]: Finished difference Result 2380 states and 5997 transitions. [2021-10-03 12:08:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:44,695 INFO L225 Difference]: With dead ends: 2380 [2021-10-03 12:08:44,695 INFO L226 Difference]: Without dead ends: 2356 [2021-10-03 12:08:44,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2021-10-03 12:08:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1658. [2021-10-03 12:08:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 2.5769462884731444) internal successors, (4270), 1657 states have internal predecessors, (4270), 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-03 12:08:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 4270 transitions. [2021-10-03 12:08:44,734 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 4270 transitions. Word has length 38 [2021-10-03 12:08:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:44,735 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 4270 transitions. [2021-10-03 12:08:44,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 4270 transitions. [2021-10-03 12:08:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:44,739 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:44,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:44,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-03 12:08:44,739 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:44,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2084132568, now seen corresponding path program 54 times [2021-10-03 12:08:44,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:44,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245880693] [2021-10-03 12:08:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:44,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:44,846 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-03 12:08:44,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:44,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245880693] [2021-10-03 12:08:44,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245880693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:44,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:44,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:44,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078851150] [2021-10-03 12:08:44,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:44,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:44,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:44,849 INFO L87 Difference]: Start difference. First operand 1658 states and 4270 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:45,284 INFO L93 Difference]: Finished difference Result 1942 states and 4937 transitions. [2021-10-03 12:08:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:45,289 INFO L225 Difference]: With dead ends: 1942 [2021-10-03 12:08:45,289 INFO L226 Difference]: Without dead ends: 1924 [2021-10-03 12:08:45,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 186.6ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2021-10-03 12:08:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1660. [2021-10-03 12:08:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 2.5756479807112718) internal successors, (4273), 1659 states have internal predecessors, (4273), 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-03 12:08:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 4273 transitions. [2021-10-03 12:08:45,323 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 4273 transitions. Word has length 38 [2021-10-03 12:08:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:45,324 INFO L470 AbstractCegarLoop]: Abstraction has 1660 states and 4273 transitions. [2021-10-03 12:08:45,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 4273 transitions. [2021-10-03 12:08:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:45,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:45,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:45,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-03 12:08:45,328 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:45,329 INFO L82 PathProgramCache]: Analyzing trace with hash 13381370, now seen corresponding path program 55 times [2021-10-03 12:08:45,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:45,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299229060] [2021-10-03 12:08:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:45,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:45,442 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-03 12:08:45,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:45,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299229060] [2021-10-03 12:08:45,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299229060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:45,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:45,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:45,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219532036] [2021-10-03 12:08:45,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:45,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:45,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:45,445 INFO L87 Difference]: Start difference. First operand 1660 states and 4273 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:45,910 INFO L93 Difference]: Finished difference Result 1942 states and 4929 transitions. [2021-10-03 12:08:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:45,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:45,914 INFO L225 Difference]: With dead ends: 1942 [2021-10-03 12:08:45,914 INFO L226 Difference]: Without dead ends: 1926 [2021-10-03 12:08:45,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 195.6ms TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:08:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-10-03 12:08:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1666. [2021-10-03 12:08:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 2.571771771771772) internal successors, (4282), 1665 states have internal predecessors, (4282), 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-03 12:08:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 4282 transitions. [2021-10-03 12:08:45,940 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 4282 transitions. Word has length 38 [2021-10-03 12:08:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:45,940 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 4282 transitions. [2021-10-03 12:08:45,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 4282 transitions. [2021-10-03 12:08:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:45,942 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:45,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:45,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-03 12:08:45,943 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2035914928, now seen corresponding path program 56 times [2021-10-03 12:08:45,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:45,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920644092] [2021-10-03 12:08:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:45,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:46,047 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-03 12:08:46,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:46,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920644092] [2021-10-03 12:08:46,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920644092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:46,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:46,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:46,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620336594] [2021-10-03 12:08:46,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:46,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:46,050 INFO L87 Difference]: Start difference. First operand 1666 states and 4282 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:46,756 INFO L93 Difference]: Finished difference Result 2504 states and 6220 transitions. [2021-10-03 12:08:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-03 12:08:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:46,764 INFO L225 Difference]: With dead ends: 2504 [2021-10-03 12:08:46,764 INFO L226 Difference]: Without dead ends: 2470 [2021-10-03 12:08:46,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 278.5ms TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2021-10-03 12:08:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2021-10-03 12:08:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1656. [2021-10-03 12:08:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.5758308157099696) internal successors, (4263), 1655 states have internal predecessors, (4263), 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-03 12:08:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4263 transitions. [2021-10-03 12:08:46,793 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4263 transitions. Word has length 38 [2021-10-03 12:08:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:46,793 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 4263 transitions. [2021-10-03 12:08:46,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4263 transitions. [2021-10-03 12:08:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:46,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:46,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:46,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-03 12:08:46,798 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -692902130, now seen corresponding path program 57 times [2021-10-03 12:08:46,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:46,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871275217] [2021-10-03 12:08:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:46,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:46,892 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-03 12:08:46,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:46,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871275217] [2021-10-03 12:08:46,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871275217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:46,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:46,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:46,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464745680] [2021-10-03 12:08:46,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:46,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:46,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:46,895 INFO L87 Difference]: Start difference. First operand 1656 states and 4263 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:47,413 INFO L93 Difference]: Finished difference Result 2068 states and 5195 transitions. [2021-10-03 12:08:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:08:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:47,425 INFO L225 Difference]: With dead ends: 2068 [2021-10-03 12:08:47,425 INFO L226 Difference]: Without dead ends: 2034 [2021-10-03 12:08:47,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 235.1ms TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2021-10-03 12:08:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1742. [2021-10-03 12:08:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 2.568638713383113) internal successors, (4472), 1741 states have internal predecessors, (4472), 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-03 12:08:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 4472 transitions. [2021-10-03 12:08:47,475 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 4472 transitions. Word has length 38 [2021-10-03 12:08:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:47,477 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 4472 transitions. [2021-10-03 12:08:47,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 4472 transitions. [2021-10-03 12:08:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:47,482 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:47,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:47,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-03 12:08:47,482 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 906843322, now seen corresponding path program 58 times [2021-10-03 12:08:47,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:47,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896186572] [2021-10-03 12:08:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:47,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:47,594 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-03 12:08:47,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:47,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896186572] [2021-10-03 12:08:47,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896186572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:47,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:47,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:47,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333603411] [2021-10-03 12:08:47,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:47,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:47,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:47,597 INFO L87 Difference]: Start difference. First operand 1742 states and 4472 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:48,351 INFO L93 Difference]: Finished difference Result 2968 states and 7346 transitions. [2021-10-03 12:08:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-03 12:08:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:48,360 INFO L225 Difference]: With dead ends: 2968 [2021-10-03 12:08:48,360 INFO L226 Difference]: Without dead ends: 2870 [2021-10-03 12:08:48,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 285.9ms TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2021-10-03 12:08:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2021-10-03 12:08:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 1888. [2021-10-03 12:08:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 2.5686274509803924) internal successors, (4847), 1887 states have internal predecessors, (4847), 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-03 12:08:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 4847 transitions. [2021-10-03 12:08:48,413 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 4847 transitions. Word has length 38 [2021-10-03 12:08:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:48,413 INFO L470 AbstractCegarLoop]: Abstraction has 1888 states and 4847 transitions. [2021-10-03 12:08:48,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 4847 transitions. [2021-10-03 12:08:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:48,418 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:48,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:48,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-03 12:08:48,420 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash -284904270, now seen corresponding path program 59 times [2021-10-03 12:08:48,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:48,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982023079] [2021-10-03 12:08:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:48,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:48,533 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-03 12:08:48,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:48,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982023079] [2021-10-03 12:08:48,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982023079] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:48,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:48,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:48,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618873914] [2021-10-03 12:08:48,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:48,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:48,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:48,536 INFO L87 Difference]: Start difference. First operand 1888 states and 4847 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:48,900 INFO L93 Difference]: Finished difference Result 2046 states and 5175 transitions. [2021-10-03 12:08:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:08:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:48,906 INFO L225 Difference]: With dead ends: 2046 [2021-10-03 12:08:48,906 INFO L226 Difference]: Without dead ends: 2026 [2021-10-03 12:08:48,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 189.1ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:08:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2021-10-03 12:08:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1884. [2021-10-03 12:08:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 2.569304301646309) internal successors, (4838), 1883 states have internal predecessors, (4838), 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-03 12:08:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 4838 transitions. [2021-10-03 12:08:48,940 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 4838 transitions. Word has length 38 [2021-10-03 12:08:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:48,940 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 4838 transitions. [2021-10-03 12:08:48,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 4838 transitions. [2021-10-03 12:08:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:48,943 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:48,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:48,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-03 12:08:48,943 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1294661346, now seen corresponding path program 60 times [2021-10-03 12:08:48,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:48,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999830701] [2021-10-03 12:08:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:48,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:49,054 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-03 12:08:49,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:49,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999830701] [2021-10-03 12:08:49,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999830701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:49,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:49,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:49,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391784584] [2021-10-03 12:08:49,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:49,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:49,058 INFO L87 Difference]: Start difference. First operand 1884 states and 4838 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:49,480 INFO L93 Difference]: Finished difference Result 2068 states and 5221 transitions. [2021-10-03 12:08:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:08:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:49,488 INFO L225 Difference]: With dead ends: 2068 [2021-10-03 12:08:49,489 INFO L226 Difference]: Without dead ends: 2052 [2021-10-03 12:08:49,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 155.1ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:08:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2021-10-03 12:08:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1890. [2021-10-03 12:08:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 2.5659078877713077) internal successors, (4847), 1889 states have internal predecessors, (4847), 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-03 12:08:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 4847 transitions. [2021-10-03 12:08:49,543 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 4847 transitions. Word has length 38 [2021-10-03 12:08:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:49,543 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 4847 transitions. [2021-10-03 12:08:49,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 4847 transitions. [2021-10-03 12:08:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:49,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:49,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:49,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-03 12:08:49,549 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2117322098, now seen corresponding path program 61 times [2021-10-03 12:08:49,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:49,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257768236] [2021-10-03 12:08:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:49,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:49,666 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-03 12:08:49,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:49,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257768236] [2021-10-03 12:08:49,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257768236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:49,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:49,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:49,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87928163] [2021-10-03 12:08:49,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:49,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:49,669 INFO L87 Difference]: Start difference. First operand 1890 states and 4847 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:50,311 INFO L93 Difference]: Finished difference Result 2666 states and 6654 transitions. [2021-10-03 12:08:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:50,316 INFO L225 Difference]: With dead ends: 2666 [2021-10-03 12:08:50,317 INFO L226 Difference]: Without dead ends: 2636 [2021-10-03 12:08:50,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 253.5ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-10-03 12:08:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1914. [2021-10-03 12:08:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 2.571353894406691) internal successors, (4919), 1913 states have internal predecessors, (4919), 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-03 12:08:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4919 transitions. [2021-10-03 12:08:50,350 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4919 transitions. Word has length 38 [2021-10-03 12:08:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:50,350 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 4919 transitions. [2021-10-03 12:08:50,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4919 transitions. [2021-10-03 12:08:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:50,353 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:50,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:50,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-03 12:08:50,354 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash -15889998, now seen corresponding path program 62 times [2021-10-03 12:08:50,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:50,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28075177] [2021-10-03 12:08:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:50,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:50,450 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-03 12:08:50,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:50,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28075177] [2021-10-03 12:08:50,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28075177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:50,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:50,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:50,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565432314] [2021-10-03 12:08:50,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:50,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:50,453 INFO L87 Difference]: Start difference. First operand 1914 states and 4919 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:50,997 INFO L93 Difference]: Finished difference Result 2620 states and 6576 transitions. [2021-10-03 12:08:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:08:50,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:51,005 INFO L225 Difference]: With dead ends: 2620 [2021-10-03 12:08:51,006 INFO L226 Difference]: Without dead ends: 2596 [2021-10-03 12:08:51,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 189.0ms TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:08:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-10-03 12:08:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1946. [2021-10-03 12:08:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 2.5691516709511566) internal successors, (4997), 1945 states have internal predecessors, (4997), 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-03 12:08:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4997 transitions. [2021-10-03 12:08:51,056 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4997 transitions. Word has length 38 [2021-10-03 12:08:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:51,057 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 4997 transitions. [2021-10-03 12:08:51,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4997 transitions. [2021-10-03 12:08:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:51,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:51,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:51,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-03 12:08:51,063 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 230146658, now seen corresponding path program 63 times [2021-10-03 12:08:51,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:51,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961733047] [2021-10-03 12:08:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:51,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:51,169 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-03 12:08:51,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:51,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961733047] [2021-10-03 12:08:51,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961733047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:51,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:51,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:51,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875303210] [2021-10-03 12:08:51,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:51,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:51,175 INFO L87 Difference]: Start difference. First operand 1946 states and 4997 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:51,784 INFO L93 Difference]: Finished difference Result 2612 states and 6547 transitions. [2021-10-03 12:08:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:08:51,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:51,793 INFO L225 Difference]: With dead ends: 2612 [2021-10-03 12:08:51,793 INFO L226 Difference]: Without dead ends: 2596 [2021-10-03 12:08:51,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 216.8ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-10-03 12:08:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1942. [2021-10-03 12:08:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1941 states have (on average 2.5687789799072642) internal successors, (4986), 1941 states have internal predecessors, (4986), 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-03 12:08:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 4986 transitions. [2021-10-03 12:08:51,849 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 4986 transitions. Word has length 38 [2021-10-03 12:08:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:51,849 INFO L470 AbstractCegarLoop]: Abstraction has 1942 states and 4986 transitions. [2021-10-03 12:08:51,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 4986 transitions. [2021-10-03 12:08:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:51,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:51,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:51,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-03 12:08:51,854 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -840795358, now seen corresponding path program 64 times [2021-10-03 12:08:51,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:51,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438076130] [2021-10-03 12:08:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:51,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:51,964 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-03 12:08:51,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:51,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438076130] [2021-10-03 12:08:51,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438076130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:51,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:51,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:51,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613056864] [2021-10-03 12:08:51,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:51,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:51,968 INFO L87 Difference]: Start difference. First operand 1942 states and 4986 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:52,423 INFO L93 Difference]: Finished difference Result 2698 states and 6718 transitions. [2021-10-03 12:08:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:08:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:52,430 INFO L225 Difference]: With dead ends: 2698 [2021-10-03 12:08:52,430 INFO L226 Difference]: Without dead ends: 2680 [2021-10-03 12:08:52,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 161.8ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:08:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2021-10-03 12:08:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 1946. [2021-10-03 12:08:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 2.5660668380462726) internal successors, (4991), 1945 states have internal predecessors, (4991), 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-03 12:08:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4991 transitions. [2021-10-03 12:08:52,497 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4991 transitions. Word has length 38 [2021-10-03 12:08:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:52,497 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 4991 transitions. [2021-10-03 12:08:52,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4991 transitions. [2021-10-03 12:08:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:52,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:52,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:52,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-03 12:08:52,501 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 968256626, now seen corresponding path program 65 times [2021-10-03 12:08:52,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:52,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271792274] [2021-10-03 12:08:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:52,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:52,604 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-03 12:08:52,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:52,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271792274] [2021-10-03 12:08:52,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271792274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:52,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:52,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:52,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509394807] [2021-10-03 12:08:52,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:52,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:52,608 INFO L87 Difference]: Start difference. First operand 1946 states and 4991 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:53,068 INFO L93 Difference]: Finished difference Result 2696 states and 6700 transitions. [2021-10-03 12:08:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:08:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:53,073 INFO L225 Difference]: With dead ends: 2696 [2021-10-03 12:08:53,074 INFO L226 Difference]: Without dead ends: 2664 [2021-10-03 12:08:53,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:08:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-10-03 12:08:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1910. [2021-10-03 12:08:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 2.5699319015191198) internal successors, (4906), 1909 states have internal predecessors, (4906), 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-03 12:08:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4906 transitions. [2021-10-03 12:08:53,108 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4906 transitions. Word has length 38 [2021-10-03 12:08:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:53,108 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 4906 transitions. [2021-10-03 12:08:53,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4906 transitions. [2021-10-03 12:08:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:53,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:53,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:53,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-03 12:08:53,111 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1216146078, now seen corresponding path program 66 times [2021-10-03 12:08:53,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:53,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025424241] [2021-10-03 12:08:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:53,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:53,231 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-03 12:08:53,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:53,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025424241] [2021-10-03 12:08:53,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025424241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:53,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:53,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:53,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007338357] [2021-10-03 12:08:53,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:53,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:53,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:53,234 INFO L87 Difference]: Start difference. First operand 1910 states and 4906 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:53,639 INFO L93 Difference]: Finished difference Result 2042 states and 5170 transitions. [2021-10-03 12:08:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:53,643 INFO L225 Difference]: With dead ends: 2042 [2021-10-03 12:08:53,643 INFO L226 Difference]: Without dead ends: 2024 [2021-10-03 12:08:53,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 185.4ms TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2021-10-03 12:08:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1912. [2021-10-03 12:08:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 2.568812140240712) internal successors, (4909), 1911 states have internal predecessors, (4909), 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-03 12:08:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 4909 transitions. [2021-10-03 12:08:53,674 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 4909 transitions. Word has length 38 [2021-10-03 12:08:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:53,674 INFO L470 AbstractCegarLoop]: Abstraction has 1912 states and 4909 transitions. [2021-10-03 12:08:53,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 4909 transitions. [2021-10-03 12:08:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:53,677 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:53,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:53,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-03 12:08:53,678 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1008070020, now seen corresponding path program 67 times [2021-10-03 12:08:53,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:53,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340297143] [2021-10-03 12:08:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:53,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:53,792 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-03 12:08:53,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:53,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340297143] [2021-10-03 12:08:53,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340297143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:53,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:53,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:53,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094578099] [2021-10-03 12:08:53,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:53,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:53,796 INFO L87 Difference]: Start difference. First operand 1912 states and 4909 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:54,276 INFO L93 Difference]: Finished difference Result 2100 states and 5298 transitions. [2021-10-03 12:08:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:54,282 INFO L225 Difference]: With dead ends: 2100 [2021-10-03 12:08:54,282 INFO L226 Difference]: Without dead ends: 2084 [2021-10-03 12:08:54,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 190.5ms TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:08:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2021-10-03 12:08:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1918. [2021-10-03 12:08:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1917 states have (on average 2.56546687532603) internal successors, (4918), 1917 states have internal predecessors, (4918), 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-03 12:08:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4918 transitions. [2021-10-03 12:08:54,325 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4918 transitions. Word has length 38 [2021-10-03 12:08:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:54,325 INFO L470 AbstractCegarLoop]: Abstraction has 1918 states and 4918 transitions. [2021-10-03 12:08:54,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4918 transitions. [2021-10-03 12:08:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:54,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:54,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:54,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-03 12:08:54,330 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1940676970, now seen corresponding path program 68 times [2021-10-03 12:08:54,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:54,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301554060] [2021-10-03 12:08:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:54,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:54,450 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-03 12:08:54,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:54,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301554060] [2021-10-03 12:08:54,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301554060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:54,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:54,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:54,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036565440] [2021-10-03 12:08:54,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:54,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:54,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:54,453 INFO L87 Difference]: Start difference. First operand 1918 states and 4918 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:55,195 INFO L93 Difference]: Finished difference Result 2776 states and 6866 transitions. [2021-10-03 12:08:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-03 12:08:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:55,201 INFO L225 Difference]: With dead ends: 2776 [2021-10-03 12:08:55,201 INFO L226 Difference]: Without dead ends: 2736 [2021-10-03 12:08:55,201 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 301.7ms TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2021-10-03 12:08:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2021-10-03 12:08:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1902. [2021-10-03 12:08:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 2.57127827459232) internal successors, (4888), 1901 states have internal predecessors, (4888), 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-03 12:08:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4888 transitions. [2021-10-03 12:08:55,232 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4888 transitions. Word has length 38 [2021-10-03 12:08:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:55,233 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 4888 transitions. [2021-10-03 12:08:55,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4888 transitions. [2021-10-03 12:08:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:55,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:55,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-03 12:08:55,236 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash -224928786, now seen corresponding path program 69 times [2021-10-03 12:08:55,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:55,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264649865] [2021-10-03 12:08:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:55,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:55,322 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-03 12:08:55,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:55,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264649865] [2021-10-03 12:08:55,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264649865] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:55,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:55,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:55,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125674901] [2021-10-03 12:08:55,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:55,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:55,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:55,325 INFO L87 Difference]: Start difference. First operand 1902 states and 4888 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:55,608 INFO L93 Difference]: Finished difference Result 1892 states and 4774 transitions. [2021-10-03 12:08:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:55,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:55,612 INFO L225 Difference]: With dead ends: 1892 [2021-10-03 12:08:55,612 INFO L226 Difference]: Without dead ends: 1838 [2021-10-03 12:08:55,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 93.2ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:08:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-10-03 12:08:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1812. [2021-10-03 12:08:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.5367200441744893) internal successors, (4594), 1811 states have internal predecessors, (4594), 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-03 12:08:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4594 transitions. [2021-10-03 12:08:55,638 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4594 transitions. Word has length 38 [2021-10-03 12:08:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:55,638 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 4594 transitions. [2021-10-03 12:08:55,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4594 transitions. [2021-10-03 12:08:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:55,642 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:55,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:55,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-03 12:08:55,643 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1069869858, now seen corresponding path program 70 times [2021-10-03 12:08:55,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:55,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712630923] [2021-10-03 12:08:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:55,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:55,769 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-03 12:08:55,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:55,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712630923] [2021-10-03 12:08:55,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712630923] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:55,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:55,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:55,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972270577] [2021-10-03 12:08:55,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:55,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:55,772 INFO L87 Difference]: Start difference. First operand 1812 states and 4594 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:56,328 INFO L93 Difference]: Finished difference Result 2022 states and 5020 transitions. [2021-10-03 12:08:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:08:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:56,332 INFO L225 Difference]: With dead ends: 2022 [2021-10-03 12:08:56,332 INFO L226 Difference]: Without dead ends: 2002 [2021-10-03 12:08:56,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 226.7ms TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:08:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2021-10-03 12:08:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1812. [2021-10-03 12:08:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.533406957482054) internal successors, (4588), 1811 states have internal predecessors, (4588), 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-03 12:08:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4588 transitions. [2021-10-03 12:08:56,358 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4588 transitions. Word has length 38 [2021-10-03 12:08:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:56,358 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 4588 transitions. [2021-10-03 12:08:56,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4588 transitions. [2021-10-03 12:08:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:56,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:56,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:56,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-03 12:08:56,361 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -197824014, now seen corresponding path program 71 times [2021-10-03 12:08:56,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:56,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626796094] [2021-10-03 12:08:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:56,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:56,456 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-03 12:08:56,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:56,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626796094] [2021-10-03 12:08:56,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626796094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:56,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:56,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:08:56,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65538035] [2021-10-03 12:08:56,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:08:56,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:08:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:56,459 INFO L87 Difference]: Start difference. First operand 1812 states and 4588 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:57,002 INFO L93 Difference]: Finished difference Result 2534 states and 6191 transitions. [2021-10-03 12:08:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:08:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:57,009 INFO L225 Difference]: With dead ends: 2534 [2021-10-03 12:08:57,009 INFO L226 Difference]: Without dead ends: 2516 [2021-10-03 12:08:57,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:08:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2021-10-03 12:08:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1814. [2021-10-03 12:08:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.532266960838389) internal successors, (4591), 1813 states have internal predecessors, (4591), 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-03 12:08:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 4591 transitions. [2021-10-03 12:08:57,063 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 4591 transitions. Word has length 38 [2021-10-03 12:08:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:57,064 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 4591 transitions. [2021-10-03 12:08:57,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:08:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 4591 transitions. [2021-10-03 12:08:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:57,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:57,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:57,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-03 12:08:57,069 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -151808708, now seen corresponding path program 72 times [2021-10-03 12:08:57,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:57,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652792714] [2021-10-03 12:08:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:57,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:57,187 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-03 12:08:57,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:57,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652792714] [2021-10-03 12:08:57,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652792714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:57,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:57,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:08:57,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60509090] [2021-10-03 12:08:57,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:08:57,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:08:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:57,190 INFO L87 Difference]: Start difference. First operand 1814 states and 4591 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:57,868 INFO L93 Difference]: Finished difference Result 2594 states and 6319 transitions. [2021-10-03 12:08:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-03 12:08:57,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:57,873 INFO L225 Difference]: With dead ends: 2594 [2021-10-03 12:08:57,873 INFO L226 Difference]: Without dead ends: 2572 [2021-10-03 12:08:57,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 255.1ms TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2021-10-03 12:08:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-10-03 12:08:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1806. [2021-10-03 12:08:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 2.535734072022161) internal successors, (4577), 1805 states have internal predecessors, (4577), 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-03 12:08:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 4577 transitions. [2021-10-03 12:08:57,909 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 4577 transitions. Word has length 38 [2021-10-03 12:08:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:57,910 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 4577 transitions. [2021-10-03 12:08:57,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:08:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 4577 transitions. [2021-10-03 12:08:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:57,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:57,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:57,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-03 12:08:57,914 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 8810590, now seen corresponding path program 73 times [2021-10-03 12:08:57,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:57,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872337472] [2021-10-03 12:08:57,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:57,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:58,023 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-03 12:08:58,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:58,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872337472] [2021-10-03 12:08:58,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872337472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:58,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:58,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:58,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761257710] [2021-10-03 12:08:58,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:58,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:58,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:58,026 INFO L87 Difference]: Start difference. First operand 1806 states and 4577 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:58,666 INFO L93 Difference]: Finished difference Result 2014 states and 4998 transitions. [2021-10-03 12:08:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:08:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:58,670 INFO L225 Difference]: With dead ends: 2014 [2021-10-03 12:08:58,670 INFO L226 Difference]: Without dead ends: 1990 [2021-10-03 12:08:58,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 283.2ms TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-10-03 12:08:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-10-03 12:08:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1804. [2021-10-03 12:08:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 2.535773710482529) internal successors, (4572), 1803 states have internal predecessors, (4572), 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-03 12:08:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4572 transitions. [2021-10-03 12:08:58,700 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4572 transitions. Word has length 38 [2021-10-03 12:08:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:58,700 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 4572 transitions. [2021-10-03 12:08:58,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4572 transitions. [2021-10-03 12:08:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:58,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:58,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:58,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-03 12:08:58,704 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash 805498388, now seen corresponding path program 74 times [2021-10-03 12:08:58,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:58,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504278789] [2021-10-03 12:08:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:58,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:58,822 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-03 12:08:58,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:58,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504278789] [2021-10-03 12:08:58,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504278789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:58,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:58,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:08:58,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172545439] [2021-10-03 12:08:58,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:08:58,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:08:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:58,825 INFO L87 Difference]: Start difference. First operand 1804 states and 4572 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:59,438 INFO L93 Difference]: Finished difference Result 1920 states and 4792 transitions. [2021-10-03 12:08:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:08:59,445 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:59,448 INFO L225 Difference]: With dead ends: 1920 [2021-10-03 12:08:59,448 INFO L226 Difference]: Without dead ends: 1886 [2021-10-03 12:08:59,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 261.8ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:08:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2021-10-03 12:08:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1798. [2021-10-03 12:08:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 2.5336672231496937) internal successors, (4553), 1797 states have internal predecessors, (4553), 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-03 12:08:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 4553 transitions. [2021-10-03 12:08:59,475 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 4553 transitions. Word has length 38 [2021-10-03 12:08:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:59,475 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 4553 transitions. [2021-10-03 12:08:59,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:08:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 4553 transitions. [2021-10-03 12:08:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:59,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:59,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:59,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-10-03 12:08:59,479 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash -210858896, now seen corresponding path program 75 times [2021-10-03 12:08:59,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:59,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995284914] [2021-10-03 12:08:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:59,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:59,574 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-03 12:08:59,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:59,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995284914] [2021-10-03 12:08:59,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995284914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:59,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:59,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:59,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214949217] [2021-10-03 12:08:59,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:59,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:59,577 INFO L87 Difference]: Start difference. First operand 1798 states and 4553 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:59,917 INFO L93 Difference]: Finished difference Result 1652 states and 4092 transitions. [2021-10-03 12:08:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:08:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:08:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:59,920 INFO L225 Difference]: With dead ends: 1652 [2021-10-03 12:08:59,920 INFO L226 Difference]: Without dead ends: 1588 [2021-10-03 12:08:59,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 134.6ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:08:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2021-10-03 12:08:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1516. [2021-10-03 12:08:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1515 states have (on average 2.5366336633663367) internal successors, (3843), 1515 states have internal predecessors, (3843), 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-03 12:08:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3843 transitions. [2021-10-03 12:08:59,941 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3843 transitions. Word has length 38 [2021-10-03 12:08:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:59,942 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 3843 transitions. [2021-10-03 12:08:59,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:08:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3843 transitions. [2021-10-03 12:08:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:08:59,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:59,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:08:59,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-10-03 12:08:59,946 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:08:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 782386808, now seen corresponding path program 76 times [2021-10-03 12:08:59,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:59,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605449763] [2021-10-03 12:08:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:59,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:00,058 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-03 12:09:00,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:00,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605449763] [2021-10-03 12:09:00,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605449763] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:00,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:00,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:00,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948936424] [2021-10-03 12:09:00,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:00,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:00,061 INFO L87 Difference]: Start difference. First operand 1516 states and 3843 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:00,646 INFO L93 Difference]: Finished difference Result 1636 states and 4076 transitions. [2021-10-03 12:09:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:00,650 INFO L225 Difference]: With dead ends: 1636 [2021-10-03 12:09:00,650 INFO L226 Difference]: Without dead ends: 1612 [2021-10-03 12:09:00,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 281.8ms TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2021-10-03 12:09:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1514. [2021-10-03 12:09:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 2.5366820885657635) internal successors, (3838), 1513 states have internal predecessors, (3838), 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-03 12:09:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 3838 transitions. [2021-10-03 12:09:00,672 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 3838 transitions. Word has length 38 [2021-10-03 12:09:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:00,672 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 3838 transitions. [2021-10-03 12:09:00,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 3838 transitions. [2021-10-03 12:09:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:00,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:00,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:00,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-10-03 12:09:00,675 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1085318438, now seen corresponding path program 77 times [2021-10-03 12:09:00,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:00,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807964614] [2021-10-03 12:09:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:00,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:00,777 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-03 12:09:00,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:00,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807964614] [2021-10-03 12:09:00,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807964614] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:00,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:00,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:00,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626311416] [2021-10-03 12:09:00,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:00,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:00,780 INFO L87 Difference]: Start difference. First operand 1514 states and 3838 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:01,222 INFO L93 Difference]: Finished difference Result 2118 states and 5268 transitions. [2021-10-03 12:09:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:01,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:01,226 INFO L225 Difference]: With dead ends: 2118 [2021-10-03 12:09:01,227 INFO L226 Difference]: Without dead ends: 2078 [2021-10-03 12:09:01,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 164.6ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2021-10-03 12:09:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1518. [2021-10-03 12:09:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 2.5379037574159526) internal successors, (3850), 1517 states have internal predecessors, (3850), 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-03 12:09:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 3850 transitions. [2021-10-03 12:09:01,250 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 3850 transitions. Word has length 38 [2021-10-03 12:09:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:01,250 INFO L470 AbstractCegarLoop]: Abstraction has 1518 states and 3850 transitions. [2021-10-03 12:09:01,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 3850 transitions. [2021-10-03 12:09:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:01,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:01,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:01,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-10-03 12:09:01,253 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1039303132, now seen corresponding path program 78 times [2021-10-03 12:09:01,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:01,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286817445] [2021-10-03 12:09:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:01,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:01,355 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-03 12:09:01,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:01,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286817445] [2021-10-03 12:09:01,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286817445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:01,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:01,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:01,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315280395] [2021-10-03 12:09:01,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:01,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:01,358 INFO L87 Difference]: Start difference. First operand 1518 states and 3850 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:01,869 INFO L93 Difference]: Finished difference Result 2090 states and 5165 transitions. [2021-10-03 12:09:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:01,874 INFO L225 Difference]: With dead ends: 2090 [2021-10-03 12:09:01,874 INFO L226 Difference]: Without dead ends: 2074 [2021-10-03 12:09:01,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 200.8ms TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2021-10-03 12:09:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1516. [2021-10-03 12:09:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1515 states have (on average 2.537953795379538) internal successors, (3845), 1515 states have internal predecessors, (3845), 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-03 12:09:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3845 transitions. [2021-10-03 12:09:01,898 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3845 transitions. Word has length 38 [2021-10-03 12:09:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:01,898 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 3845 transitions. [2021-10-03 12:09:01,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3845 transitions. [2021-10-03 12:09:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:01,903 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:01,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:01,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-10-03 12:09:01,904 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2028289890, now seen corresponding path program 79 times [2021-10-03 12:09:01,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:01,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603680268] [2021-10-03 12:09:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:01,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:02,012 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-03 12:09:02,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:02,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603680268] [2021-10-03 12:09:02,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603680268] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:02,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:02,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:02,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141808854] [2021-10-03 12:09:02,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:02,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:02,015 INFO L87 Difference]: Start difference. First operand 1516 states and 3845 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:02,475 INFO L93 Difference]: Finished difference Result 2088 states and 5151 transitions. [2021-10-03 12:09:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:02,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:02,480 INFO L225 Difference]: With dead ends: 2088 [2021-10-03 12:09:02,480 INFO L226 Difference]: Without dead ends: 2048 [2021-10-03 12:09:02,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 151.5ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2021-10-03 12:09:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1504. [2021-10-03 12:09:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 2.5302727877578177) internal successors, (3803), 1503 states have internal predecessors, (3803), 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-03 12:09:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3803 transitions. [2021-10-03 12:09:02,502 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3803 transitions. Word has length 38 [2021-10-03 12:09:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:02,502 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 3803 transitions. [2021-10-03 12:09:02,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3803 transitions. [2021-10-03 12:09:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:02,504 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:02,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:02,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-10-03 12:09:02,505 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 65516964, now seen corresponding path program 80 times [2021-10-03 12:09:02,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:02,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518257230] [2021-10-03 12:09:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:02,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:02,599 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-03 12:09:02,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:02,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518257230] [2021-10-03 12:09:02,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518257230] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:02,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:02,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:02,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473957754] [2021-10-03 12:09:02,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:02,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:02,602 INFO L87 Difference]: Start difference. First operand 1504 states and 3803 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:03,063 INFO L93 Difference]: Finished difference Result 2026 states and 5008 transitions. [2021-10-03 12:09:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:03,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:03,070 INFO L225 Difference]: With dead ends: 2026 [2021-10-03 12:09:03,070 INFO L226 Difference]: Without dead ends: 2012 [2021-10-03 12:09:03,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 161.3ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2021-10-03 12:09:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1502. [2021-10-03 12:09:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 2.530313124583611) internal successors, (3798), 1501 states have internal predecessors, (3798), 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-03 12:09:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 3798 transitions. [2021-10-03 12:09:03,112 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 3798 transitions. Word has length 38 [2021-10-03 12:09:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:03,112 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 3798 transitions. [2021-10-03 12:09:03,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 3798 transitions. [2021-10-03 12:09:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:03,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:03,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:03,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-10-03 12:09:03,119 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash 764796616, now seen corresponding path program 81 times [2021-10-03 12:09:03,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:03,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889385655] [2021-10-03 12:09:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:03,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:03,240 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-03 12:09:03,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:03,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889385655] [2021-10-03 12:09:03,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889385655] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:03,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:03,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:03,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314886418] [2021-10-03 12:09:03,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:03,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:03,243 INFO L87 Difference]: Start difference. First operand 1502 states and 3798 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:03,784 INFO L93 Difference]: Finished difference Result 2062 states and 5072 transitions. [2021-10-03 12:09:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:03,789 INFO L225 Difference]: With dead ends: 2062 [2021-10-03 12:09:03,789 INFO L226 Difference]: Without dead ends: 2030 [2021-10-03 12:09:03,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 223.2ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2021-10-03 12:09:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1480. [2021-10-03 12:09:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 2.5253549695740367) internal successors, (3735), 1479 states have internal predecessors, (3735), 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-03 12:09:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3735 transitions. [2021-10-03 12:09:03,814 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3735 transitions. Word has length 38 [2021-10-03 12:09:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:03,814 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 3735 transitions. [2021-10-03 12:09:03,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3735 transitions. [2021-10-03 12:09:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:03,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:03,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:03,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-10-03 12:09:03,817 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1274107758, now seen corresponding path program 82 times [2021-10-03 12:09:03,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:03,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424593519] [2021-10-03 12:09:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:03,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:03,924 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-03 12:09:03,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:03,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424593519] [2021-10-03 12:09:03,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424593519] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:03,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:03,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:03,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519969455] [2021-10-03 12:09:03,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:03,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:03,927 INFO L87 Difference]: Start difference. First operand 1480 states and 3735 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:04,402 INFO L93 Difference]: Finished difference Result 1606 states and 3965 transitions. [2021-10-03 12:09:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:04,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:04,405 INFO L225 Difference]: With dead ends: 1606 [2021-10-03 12:09:04,405 INFO L226 Difference]: Without dead ends: 1584 [2021-10-03 12:09:04,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 218.2ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-10-03 12:09:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1476. [2021-10-03 12:09:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 2.526779661016949) internal successors, (3727), 1475 states have internal predecessors, (3727), 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-03 12:09:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 3727 transitions. [2021-10-03 12:09:04,426 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 3727 transitions. Word has length 38 [2021-10-03 12:09:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:04,426 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 3727 transitions. [2021-10-03 12:09:04,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 3727 transitions. [2021-10-03 12:09:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:04,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:04,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:04,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-10-03 12:09:04,429 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1131021346, now seen corresponding path program 83 times [2021-10-03 12:09:04,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:04,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760374653] [2021-10-03 12:09:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:04,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:04,530 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-03 12:09:04,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:04,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760374653] [2021-10-03 12:09:04,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760374653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:04,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:04,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:04,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465841058] [2021-10-03 12:09:04,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:04,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:04,533 INFO L87 Difference]: Start difference. First operand 1476 states and 3727 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:05,030 INFO L93 Difference]: Finished difference Result 1604 states and 3955 transitions. [2021-10-03 12:09:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:05,034 INFO L225 Difference]: With dead ends: 1604 [2021-10-03 12:09:05,034 INFO L226 Difference]: Without dead ends: 1580 [2021-10-03 12:09:05,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 208.8ms TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-10-03 12:09:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1470. [2021-10-03 12:09:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 2.5268890401633763) internal successors, (3712), 1469 states have internal predecessors, (3712), 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-03 12:09:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 3712 transitions. [2021-10-03 12:09:05,077 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 3712 transitions. Word has length 38 [2021-10-03 12:09:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:05,077 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 3712 transitions. [2021-10-03 12:09:05,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 3712 transitions. [2021-10-03 12:09:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:05,079 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:05,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:05,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-10-03 12:09:05,080 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash 201625720, now seen corresponding path program 84 times [2021-10-03 12:09:05,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:05,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448630711] [2021-10-03 12:09:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:05,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:05,187 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-03 12:09:05,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:05,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448630711] [2021-10-03 12:09:05,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448630711] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:05,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:05,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:05,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964192412] [2021-10-03 12:09:05,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:05,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:05,190 INFO L87 Difference]: Start difference. First operand 1470 states and 3712 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:05,704 INFO L93 Difference]: Finished difference Result 1586 states and 3927 transitions. [2021-10-03 12:09:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:05,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:05,707 INFO L225 Difference]: With dead ends: 1586 [2021-10-03 12:09:05,707 INFO L226 Difference]: Without dead ends: 1560 [2021-10-03 12:09:05,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 220.9ms TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-10-03 12:09:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1462. [2021-10-03 12:09:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 2.5270362765229293) internal successors, (3692), 1461 states have internal predecessors, (3692), 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-03 12:09:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 3692 transitions. [2021-10-03 12:09:05,731 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 3692 transitions. Word has length 38 [2021-10-03 12:09:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:05,731 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 3692 transitions. [2021-10-03 12:09:05,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 3692 transitions. [2021-10-03 12:09:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:05,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:05,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:05,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-10-03 12:09:05,735 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash 376545520, now seen corresponding path program 85 times [2021-10-03 12:09:05,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:05,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502550260] [2021-10-03 12:09:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:05,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:05,837 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-03 12:09:05,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:05,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502550260] [2021-10-03 12:09:05,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502550260] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:05,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:05,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:05,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798497654] [2021-10-03 12:09:05,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:05,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:05,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:05,840 INFO L87 Difference]: Start difference. First operand 1462 states and 3692 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:06,393 INFO L93 Difference]: Finished difference Result 2134 states and 5265 transitions. [2021-10-03 12:09:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:09:06,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:06,399 INFO L225 Difference]: With dead ends: 2134 [2021-10-03 12:09:06,399 INFO L226 Difference]: Without dead ends: 2090 [2021-10-03 12:09:06,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 214.1ms TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2021-10-03 12:09:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-10-03 12:09:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1438. [2021-10-03 12:09:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 2.535838552540014) internal successors, (3644), 1437 states have internal predecessors, (3644), 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-03 12:09:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 3644 transitions. [2021-10-03 12:09:06,438 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 3644 transitions. Word has length 38 [2021-10-03 12:09:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:06,439 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 3644 transitions. [2021-10-03 12:09:06,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 3644 transitions. [2021-10-03 12:09:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:06,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:06,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:06,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-10-03 12:09:06,443 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash 889478410, now seen corresponding path program 86 times [2021-10-03 12:09:06,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:06,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016913695] [2021-10-03 12:09:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:06,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:06,546 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-03 12:09:06,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:06,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016913695] [2021-10-03 12:09:06,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016913695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:06,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:06,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:06,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717415885] [2021-10-03 12:09:06,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:06,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:06,550 INFO L87 Difference]: Start difference. First operand 1438 states and 3644 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:06,921 INFO L93 Difference]: Finished difference Result 1544 states and 3850 transitions. [2021-10-03 12:09:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:06,925 INFO L225 Difference]: With dead ends: 1544 [2021-10-03 12:09:06,925 INFO L226 Difference]: Without dead ends: 1530 [2021-10-03 12:09:06,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-10-03 12:09:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1438. [2021-10-03 12:09:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 2.531663187195546) internal successors, (3638), 1437 states have internal predecessors, (3638), 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-03 12:09:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 3638 transitions. [2021-10-03 12:09:06,949 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 3638 transitions. Word has length 38 [2021-10-03 12:09:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:06,949 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 3638 transitions. [2021-10-03 12:09:06,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 3638 transitions. [2021-10-03 12:09:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:06,951 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:06,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:06,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-10-03 12:09:06,952 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1805743434, now seen corresponding path program 87 times [2021-10-03 12:09:06,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:06,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823147985] [2021-10-03 12:09:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:06,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:07,047 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-03 12:09:07,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:07,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823147985] [2021-10-03 12:09:07,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823147985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:07,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:07,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:07,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025896214] [2021-10-03 12:09:07,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:07,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:07,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:07,050 INFO L87 Difference]: Start difference. First operand 1438 states and 3638 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:07,657 INFO L93 Difference]: Finished difference Result 2148 states and 5241 transitions. [2021-10-03 12:09:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:09:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:07,662 INFO L225 Difference]: With dead ends: 2148 [2021-10-03 12:09:07,663 INFO L226 Difference]: Without dead ends: 2106 [2021-10-03 12:09:07,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 210.0ms TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2021-10-03 12:09:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1422. [2021-10-03 12:09:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 2.539057002111189) internal successors, (3608), 1421 states have internal predecessors, (3608), 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-03 12:09:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3608 transitions. [2021-10-03 12:09:07,686 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3608 transitions. Word has length 38 [2021-10-03 12:09:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:07,687 INFO L470 AbstractCegarLoop]: Abstraction has 1422 states and 3608 transitions. [2021-10-03 12:09:07,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3608 transitions. [2021-10-03 12:09:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:07,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:07,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:07,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-10-03 12:09:07,689 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1297476270, now seen corresponding path program 88 times [2021-10-03 12:09:07,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:07,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515850577] [2021-10-03 12:09:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:07,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:07,788 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-03 12:09:07,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:07,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515850577] [2021-10-03 12:09:07,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515850577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:07,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:07,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:07,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336723542] [2021-10-03 12:09:07,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:07,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:07,791 INFO L87 Difference]: Start difference. First operand 1422 states and 3608 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:08,223 INFO L93 Difference]: Finished difference Result 1528 states and 3810 transitions. [2021-10-03 12:09:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:08,226 INFO L225 Difference]: With dead ends: 1528 [2021-10-03 12:09:08,226 INFO L226 Difference]: Without dead ends: 1508 [2021-10-03 12:09:08,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 193.6ms TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-10-03 12:09:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1422. [2021-10-03 12:09:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 2.5362420830401127) internal successors, (3604), 1421 states have internal predecessors, (3604), 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-03 12:09:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3604 transitions. [2021-10-03 12:09:08,245 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3604 transitions. Word has length 38 [2021-10-03 12:09:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:08,245 INFO L470 AbstractCegarLoop]: Abstraction has 1422 states and 3604 transitions. [2021-10-03 12:09:08,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3604 transitions. [2021-10-03 12:09:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:08,247 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:08,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:08,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-10-03 12:09:08,249 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash -966412604, now seen corresponding path program 89 times [2021-10-03 12:09:08,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:08,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744483640] [2021-10-03 12:09:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:08,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:08,357 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-03 12:09:08,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:08,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744483640] [2021-10-03 12:09:08,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744483640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:08,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:08,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:08,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779271476] [2021-10-03 12:09:08,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:08,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:08,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:08,360 INFO L87 Difference]: Start difference. First operand 1422 states and 3604 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:08,835 INFO L93 Difference]: Finished difference Result 1532 states and 3811 transitions. [2021-10-03 12:09:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:08,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:08,841 INFO L225 Difference]: With dead ends: 1532 [2021-10-03 12:09:08,842 INFO L226 Difference]: Without dead ends: 1498 [2021-10-03 12:09:08,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 175.7ms TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2021-10-03 12:09:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1410. [2021-10-03 12:09:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 2.5330021291696236) internal successors, (3569), 1409 states have internal predecessors, (3569), 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-03 12:09:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 3569 transitions. [2021-10-03 12:09:08,882 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 3569 transitions. Word has length 38 [2021-10-03 12:09:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:08,882 INFO L470 AbstractCegarLoop]: Abstraction has 1410 states and 3569 transitions. [2021-10-03 12:09:08,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 3569 transitions. [2021-10-03 12:09:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:08,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:08,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:08,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-10-03 12:09:08,887 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash -340137644, now seen corresponding path program 90 times [2021-10-03 12:09:08,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:08,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066606437] [2021-10-03 12:09:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:08,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:09,001 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-03 12:09:09,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:09,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066606437] [2021-10-03 12:09:09,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066606437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:09,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:09,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:09,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476469728] [2021-10-03 12:09:09,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:09,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:09,004 INFO L87 Difference]: Start difference. First operand 1410 states and 3569 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:09,447 INFO L93 Difference]: Finished difference Result 1508 states and 3760 transitions. [2021-10-03 12:09:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:09,450 INFO L225 Difference]: With dead ends: 1508 [2021-10-03 12:09:09,450 INFO L226 Difference]: Without dead ends: 1488 [2021-10-03 12:09:09,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 205.0ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2021-10-03 12:09:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1406. [2021-10-03 12:09:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 2.5338078291814945) internal successors, (3560), 1405 states have internal predecessors, (3560), 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-03 12:09:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 3560 transitions. [2021-10-03 12:09:09,470 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 3560 transitions. Word has length 38 [2021-10-03 12:09:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:09,470 INFO L470 AbstractCegarLoop]: Abstraction has 1406 states and 3560 transitions. [2021-10-03 12:09:09,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 3560 transitions. [2021-10-03 12:09:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:09,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:09,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-10-03 12:09:09,473 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -71123372, now seen corresponding path program 91 times [2021-10-03 12:09:09,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:09,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871358855] [2021-10-03 12:09:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:09,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:09,569 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-03 12:09:09,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:09,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871358855] [2021-10-03 12:09:09,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871358855] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:09,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:09,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:09,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849452771] [2021-10-03 12:09:09,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:09,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:09,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:09,572 INFO L87 Difference]: Start difference. First operand 1406 states and 3560 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:10,047 INFO L93 Difference]: Finished difference Result 2212 states and 5465 transitions. [2021-10-03 12:09:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:10,052 INFO L225 Difference]: With dead ends: 2212 [2021-10-03 12:09:10,052 INFO L226 Difference]: Without dead ends: 2164 [2021-10-03 12:09:10,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 185.5ms TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2021-10-03 12:09:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1408. [2021-10-03 12:09:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 2.5366027007818053) internal successors, (3569), 1407 states have internal predecessors, (3569), 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-03 12:09:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 3569 transitions. [2021-10-03 12:09:10,077 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 3569 transitions. Word has length 38 [2021-10-03 12:09:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:10,077 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 3569 transitions. [2021-10-03 12:09:10,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 3569 transitions. [2021-10-03 12:09:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:10,080 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:10,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:10,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-10-03 12:09:10,080 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash 174913284, now seen corresponding path program 92 times [2021-10-03 12:09:10,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:10,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46485493] [2021-10-03 12:09:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:10,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:10,185 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-03 12:09:10,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:10,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46485493] [2021-10-03 12:09:10,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46485493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:10,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:10,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:10,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033822130] [2021-10-03 12:09:10,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:10,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:10,188 INFO L87 Difference]: Start difference. First operand 1408 states and 3569 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:10,672 INFO L93 Difference]: Finished difference Result 2006 states and 4954 transitions. [2021-10-03 12:09:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:10,675 INFO L225 Difference]: With dead ends: 2006 [2021-10-03 12:09:10,675 INFO L226 Difference]: Without dead ends: 1982 [2021-10-03 12:09:10,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 201.9ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-10-03 12:09:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1390. [2021-10-03 12:09:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 2.525557955363571) internal successors, (3508), 1389 states have internal predecessors, (3508), 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-03 12:09:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 3508 transitions. [2021-10-03 12:09:10,695 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 3508 transitions. Word has length 38 [2021-10-03 12:09:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:10,695 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 3508 transitions. [2021-10-03 12:09:10,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 3508 transitions. [2021-10-03 12:09:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:10,697 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:10,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:10,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-10-03 12:09:10,697 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -896028732, now seen corresponding path program 93 times [2021-10-03 12:09:10,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:10,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293513929] [2021-10-03 12:09:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:10,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:10,783 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-03 12:09:10,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:10,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293513929] [2021-10-03 12:09:10,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293513929] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:10,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:10,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:09:10,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425347396] [2021-10-03 12:09:10,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:09:10,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:10,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:09:10,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:09:10,786 INFO L87 Difference]: Start difference. First operand 1390 states and 3508 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:11,172 INFO L93 Difference]: Finished difference Result 1994 states and 4880 transitions. [2021-10-03 12:09:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:11,179 INFO L225 Difference]: With dead ends: 1994 [2021-10-03 12:09:11,180 INFO L226 Difference]: Without dead ends: 1958 [2021-10-03 12:09:11,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 130.8ms TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-10-03 12:09:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1372. [2021-10-03 12:09:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1371 states have (on average 2.5229759299781183) internal successors, (3459), 1371 states have internal predecessors, (3459), 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-03 12:09:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3459 transitions. [2021-10-03 12:09:11,219 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3459 transitions. Word has length 38 [2021-10-03 12:09:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:11,219 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 3459 transitions. [2021-10-03 12:09:11,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3459 transitions. [2021-10-03 12:09:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:11,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:11,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:11,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-10-03 12:09:11,223 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash 913023252, now seen corresponding path program 94 times [2021-10-03 12:09:11,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:11,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005620834] [2021-10-03 12:09:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:11,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:11,323 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-03 12:09:11,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:11,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005620834] [2021-10-03 12:09:11,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005620834] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:11,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:11,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:11,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42675542] [2021-10-03 12:09:11,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:11,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:11,326 INFO L87 Difference]: Start difference. First operand 1372 states and 3459 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:11,779 INFO L93 Difference]: Finished difference Result 1930 states and 4728 transitions. [2021-10-03 12:09:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:11,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:11,787 INFO L225 Difference]: With dead ends: 1930 [2021-10-03 12:09:11,787 INFO L226 Difference]: Without dead ends: 1898 [2021-10-03 12:09:11,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-10-03 12:09:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1336. [2021-10-03 12:09:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 2.5235955056179775) internal successors, (3369), 1335 states have internal predecessors, (3369), 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-03 12:09:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3369 transitions. [2021-10-03 12:09:11,814 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3369 transitions. Word has length 38 [2021-10-03 12:09:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:11,814 INFO L470 AbstractCegarLoop]: Abstraction has 1336 states and 3369 transitions. [2021-10-03 12:09:11,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3369 transitions. [2021-10-03 12:09:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:11,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:11,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:11,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-10-03 12:09:11,817 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:11,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:11,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1271379452, now seen corresponding path program 95 times [2021-10-03 12:09:11,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:11,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969887687] [2021-10-03 12:09:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:11,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:11,912 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-03 12:09:11,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:11,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969887687] [2021-10-03 12:09:11,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969887687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:11,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:11,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:11,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371784862] [2021-10-03 12:09:11,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:11,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:11,915 INFO L87 Difference]: Start difference. First operand 1336 states and 3369 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:12,360 INFO L93 Difference]: Finished difference Result 1438 states and 3563 transitions. [2021-10-03 12:09:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:12,367 INFO L225 Difference]: With dead ends: 1438 [2021-10-03 12:09:12,367 INFO L226 Difference]: Without dead ends: 1414 [2021-10-03 12:09:12,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 202.5ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-10-03 12:09:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1330. [2021-10-03 12:09:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 2.525959367945824) internal successors, (3357), 1329 states have internal predecessors, (3357), 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-03 12:09:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 3357 transitions. [2021-10-03 12:09:12,402 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 3357 transitions. Word has length 38 [2021-10-03 12:09:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:12,402 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 3357 transitions. [2021-10-03 12:09:12,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 3357 transitions. [2021-10-03 12:09:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:12,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:12,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-10-03 12:09:12,407 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash 229862420, now seen corresponding path program 96 times [2021-10-03 12:09:12,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:12,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793058122] [2021-10-03 12:09:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:12,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:12,525 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-03 12:09:12,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:12,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793058122] [2021-10-03 12:09:12,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793058122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:12,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:12,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:12,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157565528] [2021-10-03 12:09:12,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:12,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:12,528 INFO L87 Difference]: Start difference. First operand 1330 states and 3357 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:13,023 INFO L93 Difference]: Finished difference Result 1450 states and 3578 transitions. [2021-10-03 12:09:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:13,028 INFO L225 Difference]: With dead ends: 1450 [2021-10-03 12:09:13,028 INFO L226 Difference]: Without dead ends: 1426 [2021-10-03 12:09:13,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 196.6ms TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2021-10-03 12:09:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1324. [2021-10-03 12:09:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 2.526077097505669) internal successors, (3342), 1323 states have internal predecessors, (3342), 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-03 12:09:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3342 transitions. [2021-10-03 12:09:13,048 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3342 transitions. Word has length 38 [2021-10-03 12:09:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:13,048 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 3342 transitions. [2021-10-03 12:09:13,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3342 transitions. [2021-10-03 12:09:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:13,050 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:13,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:13,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-10-03 12:09:13,051 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1562509486, now seen corresponding path program 97 times [2021-10-03 12:09:13,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:13,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539309572] [2021-10-03 12:09:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:13,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:13,171 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-03 12:09:13,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:13,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539309572] [2021-10-03 12:09:13,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539309572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:13,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:13,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:13,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100823009] [2021-10-03 12:09:13,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:13,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:13,173 INFO L87 Difference]: Start difference. First operand 1324 states and 3342 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:13,617 INFO L93 Difference]: Finished difference Result 1408 states and 3509 transitions. [2021-10-03 12:09:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:13,621 INFO L225 Difference]: With dead ends: 1408 [2021-10-03 12:09:13,621 INFO L226 Difference]: Without dead ends: 1382 [2021-10-03 12:09:13,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 187.0ms TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2021-10-03 12:09:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1316. [2021-10-03 12:09:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 2.526235741444867) internal successors, (3322), 1315 states have internal predecessors, (3322), 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-03 12:09:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 3322 transitions. [2021-10-03 12:09:13,639 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 3322 transitions. Word has length 38 [2021-10-03 12:09:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:13,639 INFO L470 AbstractCegarLoop]: Abstraction has 1316 states and 3322 transitions. [2021-10-03 12:09:13,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 3322 transitions. [2021-10-03 12:09:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:13,641 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:13,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:13,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-10-03 12:09:13,642 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:13,642 INFO L82 PathProgramCache]: Analyzing trace with hash 424365238, now seen corresponding path program 98 times [2021-10-03 12:09:13,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:13,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682204489] [2021-10-03 12:09:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:13,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:13,733 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-03 12:09:13,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:13,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682204489] [2021-10-03 12:09:13,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682204489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:13,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:13,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:13,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260403016] [2021-10-03 12:09:13,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:13,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:13,736 INFO L87 Difference]: Start difference. First operand 1316 states and 3322 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:14,331 INFO L93 Difference]: Finished difference Result 2108 states and 5214 transitions. [2021-10-03 12:09:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:09:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:14,339 INFO L225 Difference]: With dead ends: 2108 [2021-10-03 12:09:14,339 INFO L226 Difference]: Without dead ends: 2046 [2021-10-03 12:09:14,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 211.0ms TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-10-03 12:09:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1274. [2021-10-03 12:09:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 2.5428122545168894) internal successors, (3237), 1273 states have internal predecessors, (3237), 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-03 12:09:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3237 transitions. [2021-10-03 12:09:14,367 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3237 transitions. Word has length 38 [2021-10-03 12:09:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:14,367 INFO L470 AbstractCegarLoop]: Abstraction has 1274 states and 3237 transitions. [2021-10-03 12:09:14,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3237 transitions. [2021-10-03 12:09:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:14,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:14,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:14,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-10-03 12:09:14,370 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash 179852972, now seen corresponding path program 99 times [2021-10-03 12:09:14,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:14,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60797861] [2021-10-03 12:09:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:14,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:14,459 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-03 12:09:14,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:14,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60797861] [2021-10-03 12:09:14,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60797861] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:14,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:14,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:09:14,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70316251] [2021-10-03 12:09:14,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:09:14,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:09:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:09:14,463 INFO L87 Difference]: Start difference. First operand 1274 states and 3237 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:14,685 INFO L93 Difference]: Finished difference Result 1346 states and 3395 transitions. [2021-10-03 12:09:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:09:14,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:14,688 INFO L225 Difference]: With dead ends: 1346 [2021-10-03 12:09:14,688 INFO L226 Difference]: Without dead ends: 1282 [2021-10-03 12:09:14,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:09:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-10-03 12:09:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-10-03 12:09:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.530054644808743) internal successors, (3241), 1281 states have internal predecessors, (3241), 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-03 12:09:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3241 transitions. [2021-10-03 12:09:14,707 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3241 transitions. Word has length 38 [2021-10-03 12:09:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:14,707 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3241 transitions. [2021-10-03 12:09:14,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3241 transitions. [2021-10-03 12:09:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:14,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:14,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:14,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-10-03 12:09:14,709 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -489093180, now seen corresponding path program 100 times [2021-10-03 12:09:14,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:14,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462776853] [2021-10-03 12:09:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:14,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:14,794 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-03 12:09:14,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:14,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462776853] [2021-10-03 12:09:14,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462776853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:14,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:14,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:14,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057621158] [2021-10-03 12:09:14,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:14,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:14,797 INFO L87 Difference]: Start difference. First operand 1282 states and 3241 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:15,200 INFO L93 Difference]: Finished difference Result 1412 states and 3490 transitions. [2021-10-03 12:09:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:15,204 INFO L225 Difference]: With dead ends: 1412 [2021-10-03 12:09:15,204 INFO L226 Difference]: Without dead ends: 1350 [2021-10-03 12:09:15,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 161.0ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-10-03 12:09:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1286. [2021-10-03 12:09:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5299610894941633) internal successors, (3251), 1285 states have internal predecessors, (3251), 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-03 12:09:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3251 transitions. [2021-10-03 12:09:15,221 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3251 transitions. Word has length 38 [2021-10-03 12:09:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:15,222 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3251 transitions. [2021-10-03 12:09:15,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3251 transitions. [2021-10-03 12:09:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:15,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:15,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:15,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-10-03 12:09:15,224 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash 832987292, now seen corresponding path program 101 times [2021-10-03 12:09:15,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:15,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825378524] [2021-10-03 12:09:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:15,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:15,305 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-03 12:09:15,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:15,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825378524] [2021-10-03 12:09:15,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825378524] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:15,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:15,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:09:15,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277152053] [2021-10-03 12:09:15,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:09:15,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:09:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:09:15,308 INFO L87 Difference]: Start difference. First operand 1286 states and 3251 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:15,507 INFO L93 Difference]: Finished difference Result 1384 states and 3468 transitions. [2021-10-03 12:09:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:09:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:15,511 INFO L225 Difference]: With dead ends: 1384 [2021-10-03 12:09:15,511 INFO L226 Difference]: Without dead ends: 1332 [2021-10-03 12:09:15,511 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 75.4ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:09:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-10-03 12:09:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1294. [2021-10-03 12:09:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 2.5297757153905645) internal successors, (3271), 1293 states have internal predecessors, (3271), 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-03 12:09:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3271 transitions. [2021-10-03 12:09:15,538 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3271 transitions. Word has length 38 [2021-10-03 12:09:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:15,538 INFO L470 AbstractCegarLoop]: Abstraction has 1294 states and 3271 transitions. [2021-10-03 12:09:15,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3271 transitions. [2021-10-03 12:09:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:15,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:15,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:15,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-10-03 12:09:15,542 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 130354994, now seen corresponding path program 102 times [2021-10-03 12:09:15,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:15,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302378125] [2021-10-03 12:09:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:15,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:15,638 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-03 12:09:15,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:15,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302378125] [2021-10-03 12:09:15,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302378125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:15,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:15,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:09:15,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536874229] [2021-10-03 12:09:15,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:09:15,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:15,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:09:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:09:15,641 INFO L87 Difference]: Start difference. First operand 1294 states and 3271 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:15,884 INFO L93 Difference]: Finished difference Result 1480 states and 3696 transitions. [2021-10-03 12:09:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:09:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:15,887 INFO L225 Difference]: With dead ends: 1480 [2021-10-03 12:09:15,887 INFO L226 Difference]: Without dead ends: 1404 [2021-10-03 12:09:15,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:09:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2021-10-03 12:09:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1290. [2021-10-03 12:09:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 2.5376260667183863) internal successors, (3271), 1289 states have internal predecessors, (3271), 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-03 12:09:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3271 transitions. [2021-10-03 12:09:15,904 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3271 transitions. Word has length 38 [2021-10-03 12:09:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:15,905 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 3271 transitions. [2021-10-03 12:09:15,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3271 transitions. [2021-10-03 12:09:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:15,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:15,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:15,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-10-03 12:09:15,907 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1321353032, now seen corresponding path program 103 times [2021-10-03 12:09:15,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:15,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657333166] [2021-10-03 12:09:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:15,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:16,014 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-03 12:09:16,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:16,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657333166] [2021-10-03 12:09:16,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657333166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:16,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:16,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:16,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75919324] [2021-10-03 12:09:16,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:16,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:16,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:16,017 INFO L87 Difference]: Start difference. First operand 1290 states and 3271 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:16,466 INFO L93 Difference]: Finished difference Result 1322 states and 3321 transitions. [2021-10-03 12:09:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:16,477 INFO L225 Difference]: With dead ends: 1322 [2021-10-03 12:09:16,477 INFO L226 Difference]: Without dead ends: 1294 [2021-10-03 12:09:16,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 198.3ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-03 12:09:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1290. [2021-10-03 12:09:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 2.5329712955779673) internal successors, (3265), 1289 states have internal predecessors, (3265), 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-03 12:09:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3265 transitions. [2021-10-03 12:09:16,508 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3265 transitions. Word has length 38 [2021-10-03 12:09:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:16,508 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 3265 transitions. [2021-10-03 12:09:16,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3265 transitions. [2021-10-03 12:09:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:16,512 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:16,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:16,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-10-03 12:09:16,513 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -618547322, now seen corresponding path program 104 times [2021-10-03 12:09:16,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:16,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143498611] [2021-10-03 12:09:16,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:16,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:16,601 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-03 12:09:16,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:16,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143498611] [2021-10-03 12:09:16,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143498611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:16,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:16,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:16,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518128653] [2021-10-03 12:09:16,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:16,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:16,604 INFO L87 Difference]: Start difference. First operand 1290 states and 3265 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:17,017 INFO L93 Difference]: Finished difference Result 1444 states and 3576 transitions. [2021-10-03 12:09:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:17,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:17,021 INFO L225 Difference]: With dead ends: 1444 [2021-10-03 12:09:17,021 INFO L226 Difference]: Without dead ends: 1426 [2021-10-03 12:09:17,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 177.5ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2021-10-03 12:09:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1292. [2021-10-03 12:09:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 2.5329202168861347) internal successors, (3270), 1291 states have internal predecessors, (3270), 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-03 12:09:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3270 transitions. [2021-10-03 12:09:17,040 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3270 transitions. Word has length 38 [2021-10-03 12:09:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:17,040 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 3270 transitions. [2021-10-03 12:09:17,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3270 transitions. [2021-10-03 12:09:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:17,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:17,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:17,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-10-03 12:09:17,043 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2088137578, now seen corresponding path program 105 times [2021-10-03 12:09:17,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:17,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559339061] [2021-10-03 12:09:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:17,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:17,170 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-03 12:09:17,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:17,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559339061] [2021-10-03 12:09:17,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559339061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:17,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:17,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:17,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766331772] [2021-10-03 12:09:17,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:17,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:17,173 INFO L87 Difference]: Start difference. First operand 1292 states and 3270 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:17,694 INFO L93 Difference]: Finished difference Result 1440 states and 3564 transitions. [2021-10-03 12:09:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:17,700 INFO L225 Difference]: With dead ends: 1440 [2021-10-03 12:09:17,701 INFO L226 Difference]: Without dead ends: 1424 [2021-10-03 12:09:17,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 221.7ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-03 12:09:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1298. [2021-10-03 12:09:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 2.531225905936777) internal successors, (3283), 1297 states have internal predecessors, (3283), 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-03 12:09:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 3283 transitions. [2021-10-03 12:09:17,746 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 3283 transitions. Word has length 38 [2021-10-03 12:09:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:17,746 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 3283 transitions. [2021-10-03 12:09:17,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 3283 transitions. [2021-10-03 12:09:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:17,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:17,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:17,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-10-03 12:09:17,750 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1529471604, now seen corresponding path program 106 times [2021-10-03 12:09:17,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:17,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37782074] [2021-10-03 12:09:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:17,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:17,855 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-03 12:09:17,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:17,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37782074] [2021-10-03 12:09:17,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37782074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:17,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:17,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:17,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75642234] [2021-10-03 12:09:17,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:17,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:17,858 INFO L87 Difference]: Start difference. First operand 1298 states and 3283 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:18,268 INFO L93 Difference]: Finished difference Result 1384 states and 3444 transitions. [2021-10-03 12:09:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:18,277 INFO L225 Difference]: With dead ends: 1384 [2021-10-03 12:09:18,277 INFO L226 Difference]: Without dead ends: 1358 [2021-10-03 12:09:18,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-10-03 12:09:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1292. [2021-10-03 12:09:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 2.53137103020914) internal successors, (3268), 1291 states have internal predecessors, (3268), 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-03 12:09:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3268 transitions. [2021-10-03 12:09:18,306 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3268 transitions. Word has length 38 [2021-10-03 12:09:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:18,306 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 3268 transitions. [2021-10-03 12:09:18,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3268 transitions. [2021-10-03 12:09:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:18,309 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:18,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:18,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-10-03 12:09:18,310 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -589110762, now seen corresponding path program 107 times [2021-10-03 12:09:18,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:18,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837956906] [2021-10-03 12:09:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:18,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:18,437 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-03 12:09:18,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:18,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837956906] [2021-10-03 12:09:18,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837956906] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:18,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:18,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:18,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482354392] [2021-10-03 12:09:18,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:18,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:18,440 INFO L87 Difference]: Start difference. First operand 1292 states and 3268 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:18,958 INFO L93 Difference]: Finished difference Result 1380 states and 3432 transitions. [2021-10-03 12:09:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:18,961 INFO L225 Difference]: With dead ends: 1380 [2021-10-03 12:09:18,961 INFO L226 Difference]: Without dead ends: 1350 [2021-10-03 12:09:18,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 239.4ms TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-10-03 12:09:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1284. [2021-10-03 12:09:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 2.533125487139517) internal successors, (3250), 1283 states have internal predecessors, (3250), 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-03 12:09:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 3250 transitions. [2021-10-03 12:09:18,980 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 3250 transitions. Word has length 38 [2021-10-03 12:09:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:18,980 INFO L470 AbstractCegarLoop]: Abstraction has 1284 states and 3250 transitions. [2021-10-03 12:09:18,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 3250 transitions. [2021-10-03 12:09:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:18,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:18,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:18,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-10-03 12:09:18,983 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1870916004, now seen corresponding path program 108 times [2021-10-03 12:09:18,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:18,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723896229] [2021-10-03 12:09:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:18,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:19,088 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-03 12:09:19,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:19,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723896229] [2021-10-03 12:09:19,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723896229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:19,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:19,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:19,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564965493] [2021-10-03 12:09:19,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:19,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:19,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:19,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:19,091 INFO L87 Difference]: Start difference. First operand 1284 states and 3250 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:19,570 INFO L93 Difference]: Finished difference Result 1340 states and 3334 transitions. [2021-10-03 12:09:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:19,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:19,575 INFO L225 Difference]: With dead ends: 1340 [2021-10-03 12:09:19,575 INFO L226 Difference]: Without dead ends: 1316 [2021-10-03 12:09:19,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 232.6ms TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2021-10-03 12:09:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1278. [2021-10-03 12:09:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 2.5332811276429132) internal successors, (3235), 1277 states have internal predecessors, (3235), 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-03 12:09:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 3235 transitions. [2021-10-03 12:09:19,605 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 3235 transitions. Word has length 38 [2021-10-03 12:09:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:19,605 INFO L470 AbstractCegarLoop]: Abstraction has 1278 states and 3235 transitions. [2021-10-03 12:09:19,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 3235 transitions. [2021-10-03 12:09:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:19,609 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:19,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:19,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-10-03 12:09:19,610 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:19,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -401667014, now seen corresponding path program 109 times [2021-10-03 12:09:19,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:19,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329101863] [2021-10-03 12:09:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:19,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:19,720 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-03 12:09:19,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:19,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329101863] [2021-10-03 12:09:19,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329101863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:19,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:19,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:19,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857678554] [2021-10-03 12:09:19,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:19,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:19,723 INFO L87 Difference]: Start difference. First operand 1278 states and 3235 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:20,297 INFO L93 Difference]: Finished difference Result 1372 states and 3406 transitions. [2021-10-03 12:09:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:09:20,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:20,304 INFO L225 Difference]: With dead ends: 1372 [2021-10-03 12:09:20,304 INFO L226 Difference]: Without dead ends: 1346 [2021-10-03 12:09:20,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 281.2ms TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-10-03 12:09:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1286. [2021-10-03 12:09:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5268482490272373) internal successors, (3247), 1285 states have internal predecessors, (3247), 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-03 12:09:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3247 transitions. [2021-10-03 12:09:20,332 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3247 transitions. Word has length 38 [2021-10-03 12:09:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:20,333 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3247 transitions. [2021-10-03 12:09:20,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3247 transitions. [2021-10-03 12:09:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:20,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:20,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:20,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-10-03 12:09:20,337 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1460119182, now seen corresponding path program 110 times [2021-10-03 12:09:20,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:20,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951245814] [2021-10-03 12:09:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:20,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:20,429 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-03 12:09:20,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:20,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951245814] [2021-10-03 12:09:20,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951245814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:20,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:20,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:20,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837994324] [2021-10-03 12:09:20,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:20,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:20,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:20,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:20,432 INFO L87 Difference]: Start difference. First operand 1286 states and 3247 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:20,845 INFO L93 Difference]: Finished difference Result 1356 states and 3376 transitions. [2021-10-03 12:09:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:20,850 INFO L225 Difference]: With dead ends: 1356 [2021-10-03 12:09:20,850 INFO L226 Difference]: Without dead ends: 1318 [2021-10-03 12:09:20,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2021-10-03 12:09:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1272. [2021-10-03 12:09:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 2.5334382376081823) internal successors, (3220), 1271 states have internal predecessors, (3220), 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-03 12:09:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 3220 transitions. [2021-10-03 12:09:20,881 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 3220 transitions. Word has length 38 [2021-10-03 12:09:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:20,881 INFO L470 AbstractCegarLoop]: Abstraction has 1272 states and 3220 transitions. [2021-10-03 12:09:20,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 3220 transitions. [2021-10-03 12:09:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:20,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:20,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:20,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-10-03 12:09:20,885 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1978498408, now seen corresponding path program 111 times [2021-10-03 12:09:20,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:20,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205572515] [2021-10-03 12:09:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:20,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:20,983 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-03 12:09:20,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:20,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205572515] [2021-10-03 12:09:20,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205572515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:20,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:20,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:20,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162484395] [2021-10-03 12:09:20,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:20,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:20,986 INFO L87 Difference]: Start difference. First operand 1272 states and 3220 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:21,356 INFO L93 Difference]: Finished difference Result 1442 states and 3585 transitions. [2021-10-03 12:09:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:21,359 INFO L225 Difference]: With dead ends: 1442 [2021-10-03 12:09:21,359 INFO L226 Difference]: Without dead ends: 1424 [2021-10-03 12:09:21,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-03 12:09:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1276. [2021-10-03 12:09:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 2.5349019607843135) internal successors, (3232), 1275 states have internal predecessors, (3232), 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-03 12:09:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3232 transitions. [2021-10-03 12:09:21,378 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3232 transitions. Word has length 38 [2021-10-03 12:09:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:21,378 INFO L470 AbstractCegarLoop]: Abstraction has 1276 states and 3232 transitions. [2021-10-03 12:09:21,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3232 transitions. [2021-10-03 12:09:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:21,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:21,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:21,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-10-03 12:09:21,380 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 390216012, now seen corresponding path program 112 times [2021-10-03 12:09:21,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:21,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379036610] [2021-10-03 12:09:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:21,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:21,475 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-03 12:09:21,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:21,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379036610] [2021-10-03 12:09:21,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379036610] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:21,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:21,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:21,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422366463] [2021-10-03 12:09:21,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:21,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:21,478 INFO L87 Difference]: Start difference. First operand 1276 states and 3232 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:21,960 INFO L93 Difference]: Finished difference Result 1430 states and 3555 transitions. [2021-10-03 12:09:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:21,963 INFO L225 Difference]: With dead ends: 1430 [2021-10-03 12:09:21,964 INFO L226 Difference]: Without dead ends: 1414 [2021-10-03 12:09:21,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 203.9ms TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-10-03 12:09:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1288. [2021-10-03 12:09:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.537684537684538) internal successors, (3266), 1287 states have internal predecessors, (3266), 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-03 12:09:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3266 transitions. [2021-10-03 12:09:21,981 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3266 transitions. Word has length 38 [2021-10-03 12:09:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:21,982 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3266 transitions. [2021-10-03 12:09:21,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3266 transitions. [2021-10-03 12:09:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:21,984 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:21,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:21,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-10-03 12:09:21,985 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -168449962, now seen corresponding path program 113 times [2021-10-03 12:09:21,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:21,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424810187] [2021-10-03 12:09:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:21,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:22,088 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-03 12:09:22,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:22,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424810187] [2021-10-03 12:09:22,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424810187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:22,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:22,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:22,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210038051] [2021-10-03 12:09:22,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:22,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:22,091 INFO L87 Difference]: Start difference. First operand 1288 states and 3266 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:22,529 INFO L93 Difference]: Finished difference Result 1380 states and 3444 transitions. [2021-10-03 12:09:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:22,532 INFO L225 Difference]: With dead ends: 1380 [2021-10-03 12:09:22,533 INFO L226 Difference]: Without dead ends: 1354 [2021-10-03 12:09:22,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 230.8ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2021-10-03 12:09:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1282. [2021-10-03 12:09:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.5331772053083528) internal successors, (3245), 1281 states have internal predecessors, (3245), 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-03 12:09:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3245 transitions. [2021-10-03 12:09:22,554 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3245 transitions. Word has length 38 [2021-10-03 12:09:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:22,554 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3245 transitions. [2021-10-03 12:09:22,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3245 transitions. [2021-10-03 12:09:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:22,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:22,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:22,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-10-03 12:09:22,557 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2007934968, now seen corresponding path program 114 times [2021-10-03 12:09:22,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:22,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493190558] [2021-10-03 12:09:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:22,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:22,672 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-03 12:09:22,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:22,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493190558] [2021-10-03 12:09:22,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493190558] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:22,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:22,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:22,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266117007] [2021-10-03 12:09:22,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:22,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:22,674 INFO L87 Difference]: Start difference. First operand 1282 states and 3245 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:23,201 INFO L93 Difference]: Finished difference Result 1376 states and 3426 transitions. [2021-10-03 12:09:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:23,205 INFO L225 Difference]: With dead ends: 1376 [2021-10-03 12:09:23,206 INFO L226 Difference]: Without dead ends: 1352 [2021-10-03 12:09:23,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 270.3ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-10-03 12:09:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1280. [2021-10-03 12:09:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.5332290852228305) internal successors, (3240), 1279 states have internal predecessors, (3240), 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-03 12:09:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3240 transitions. [2021-10-03 12:09:23,234 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3240 transitions. Word has length 38 [2021-10-03 12:09:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:23,235 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3240 transitions. [2021-10-03 12:09:23,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3240 transitions. [2021-10-03 12:09:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:23,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:23,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:23,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-10-03 12:09:23,238 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2023954056, now seen corresponding path program 115 times [2021-10-03 12:09:23,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:23,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912289754] [2021-10-03 12:09:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:23,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:23,345 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-03 12:09:23,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:23,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912289754] [2021-10-03 12:09:23,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912289754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:23,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:23,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:23,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77386559] [2021-10-03 12:09:23,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:23,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:23,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:23,348 INFO L87 Difference]: Start difference. First operand 1280 states and 3240 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:23,754 INFO L93 Difference]: Finished difference Result 1390 states and 3457 transitions. [2021-10-03 12:09:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:23,757 INFO L225 Difference]: With dead ends: 1390 [2021-10-03 12:09:23,757 INFO L226 Difference]: Without dead ends: 1374 [2021-10-03 12:09:23,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 189.5ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-10-03 12:09:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1282. [2021-10-03 12:09:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.531615925058548) internal successors, (3243), 1281 states have internal predecessors, (3243), 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-03 12:09:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3243 transitions. [2021-10-03 12:09:23,774 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3243 transitions. Word has length 38 [2021-10-03 12:09:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:23,776 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3243 transitions. [2021-10-03 12:09:23,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3243 transitions. [2021-10-03 12:09:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:23,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:23,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:23,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-10-03 12:09:23,778 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -219854308, now seen corresponding path program 116 times [2021-10-03 12:09:23,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:23,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669529012] [2021-10-03 12:09:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:23,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:23,882 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-03 12:09:23,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:23,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669529012] [2021-10-03 12:09:23,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669529012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:23,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:23,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:23,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062721632] [2021-10-03 12:09:23,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:23,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:23,884 INFO L87 Difference]: Start difference. First operand 1282 states and 3243 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:24,290 INFO L93 Difference]: Finished difference Result 1384 states and 3444 transitions. [2021-10-03 12:09:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:24,293 INFO L225 Difference]: With dead ends: 1384 [2021-10-03 12:09:24,293 INFO L226 Difference]: Without dead ends: 1370 [2021-10-03 12:09:24,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 193.3ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2021-10-03 12:09:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1286. [2021-10-03 12:09:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 2.5299610894941633) internal successors, (3251), 1285 states have internal predecessors, (3251), 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-03 12:09:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3251 transitions. [2021-10-03 12:09:24,315 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3251 transitions. Word has length 38 [2021-10-03 12:09:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:24,316 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 3251 transitions. [2021-10-03 12:09:24,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3251 transitions. [2021-10-03 12:09:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:24,318 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:24,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:24,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-10-03 12:09:24,318 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1573571256, now seen corresponding path program 117 times [2021-10-03 12:09:24,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:24,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978795632] [2021-10-03 12:09:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:24,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:24,421 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-03 12:09:24,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:24,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978795632] [2021-10-03 12:09:24,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978795632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:24,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:24,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:24,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438283938] [2021-10-03 12:09:24,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:24,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:24,424 INFO L87 Difference]: Start difference. First operand 1286 states and 3251 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:24,811 INFO L93 Difference]: Finished difference Result 1370 states and 3403 transitions. [2021-10-03 12:09:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:24,814 INFO L225 Difference]: With dead ends: 1370 [2021-10-03 12:09:24,814 INFO L226 Difference]: Without dead ends: 1342 [2021-10-03 12:09:24,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-10-03 12:09:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1274. [2021-10-03 12:09:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 2.5318146111547524) internal successors, (3223), 1273 states have internal predecessors, (3223), 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-03 12:09:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3223 transitions. [2021-10-03 12:09:24,833 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3223 transitions. Word has length 38 [2021-10-03 12:09:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:24,833 INFO L470 AbstractCegarLoop]: Abstraction has 1274 states and 3223 transitions. [2021-10-03 12:09:24,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3223 transitions. [2021-10-03 12:09:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:24,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:24,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:24,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-10-03 12:09:24,836 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash 823006876, now seen corresponding path program 118 times [2021-10-03 12:09:24,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:24,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653878621] [2021-10-03 12:09:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:24,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:24,945 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-03 12:09:24,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:24,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653878621] [2021-10-03 12:09:24,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653878621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:24,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:24,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:24,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552851600] [2021-10-03 12:09:24,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:24,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:24,948 INFO L87 Difference]: Start difference. First operand 1274 states and 3223 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:25,427 INFO L93 Difference]: Finished difference Result 1360 states and 3390 transitions. [2021-10-03 12:09:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:25,430 INFO L225 Difference]: With dead ends: 1360 [2021-10-03 12:09:25,430 INFO L226 Difference]: Without dead ends: 1342 [2021-10-03 12:09:25,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 243.6ms TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-10-03 12:09:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1282. [2021-10-03 12:09:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.5253708040593286) internal successors, (3235), 1281 states have internal predecessors, (3235), 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-03 12:09:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3235 transitions. [2021-10-03 12:09:25,447 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3235 transitions. Word has length 38 [2021-10-03 12:09:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:25,447 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3235 transitions. [2021-10-03 12:09:25,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3235 transitions. [2021-10-03 12:09:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:25,449 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:25,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:25,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-10-03 12:09:25,449 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1610174224, now seen corresponding path program 119 times [2021-10-03 12:09:25,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:25,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183169420] [2021-10-03 12:09:25,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:25,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:25,543 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-03 12:09:25,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:25,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183169420] [2021-10-03 12:09:25,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183169420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:25,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:25,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:25,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560095167] [2021-10-03 12:09:25,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:25,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:25,547 INFO L87 Difference]: Start difference. First operand 1282 states and 3235 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:25,940 INFO L93 Difference]: Finished difference Result 1352 states and 3372 transitions. [2021-10-03 12:09:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:25,942 INFO L225 Difference]: With dead ends: 1352 [2021-10-03 12:09:25,943 INFO L226 Difference]: Without dead ends: 1312 [2021-10-03 12:09:25,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 191.1ms TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-10-03 12:09:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1266. [2021-10-03 12:09:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 2.533596837944664) internal successors, (3205), 1265 states have internal predecessors, (3205), 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-03 12:09:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3205 transitions. [2021-10-03 12:09:25,960 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3205 transitions. Word has length 38 [2021-10-03 12:09:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:25,960 INFO L470 AbstractCegarLoop]: Abstraction has 1266 states and 3205 transitions. [2021-10-03 12:09:25,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3205 transitions. [2021-10-03 12:09:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:25,962 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:25,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:25,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-10-03 12:09:25,963 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash -185002474, now seen corresponding path program 120 times [2021-10-03 12:09:25,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:25,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031672359] [2021-10-03 12:09:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:25,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:26,073 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-03 12:09:26,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:26,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031672359] [2021-10-03 12:09:26,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031672359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:26,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:26,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:26,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496286674] [2021-10-03 12:09:26,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:26,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:26,076 INFO L87 Difference]: Start difference. First operand 1266 states and 3205 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:26,549 INFO L93 Difference]: Finished difference Result 1406 states and 3476 transitions. [2021-10-03 12:09:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-03 12:09:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:26,552 INFO L225 Difference]: With dead ends: 1406 [2021-10-03 12:09:26,552 INFO L226 Difference]: Without dead ends: 1286 [2021-10-03 12:09:26,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 227.4ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-10-03 12:09:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1268. [2021-10-03 12:09:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 2.5138121546961325) internal successors, (3185), 1267 states have internal predecessors, (3185), 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-03 12:09:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 3185 transitions. [2021-10-03 12:09:26,567 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 3185 transitions. Word has length 38 [2021-10-03 12:09:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:26,567 INFO L470 AbstractCegarLoop]: Abstraction has 1268 states and 3185 transitions. [2021-10-03 12:09:26,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 3185 transitions. [2021-10-03 12:09:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:26,569 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:26,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:26,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-10-03 12:09:26,570 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 783226548, now seen corresponding path program 121 times [2021-10-03 12:09:26,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:26,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644009761] [2021-10-03 12:09:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:26,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:26,691 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-03 12:09:26,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:26,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644009761] [2021-10-03 12:09:26,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644009761] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:26,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:26,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:26,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414031437] [2021-10-03 12:09:26,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:26,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:26,694 INFO L87 Difference]: Start difference. First operand 1268 states and 3185 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:27,239 INFO L93 Difference]: Finished difference Result 1296 states and 3233 transitions. [2021-10-03 12:09:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:09:27,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:27,242 INFO L225 Difference]: With dead ends: 1296 [2021-10-03 12:09:27,242 INFO L226 Difference]: Without dead ends: 1274 [2021-10-03 12:09:27,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 293.8ms TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-10-03 12:09:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2021-10-03 12:09:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 2.512214342001576) internal successors, (3188), 1269 states have internal predecessors, (3188), 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-03 12:09:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 3188 transitions. [2021-10-03 12:09:27,260 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 3188 transitions. Word has length 38 [2021-10-03 12:09:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:27,260 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 3188 transitions. [2021-10-03 12:09:27,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 3188 transitions. [2021-10-03 12:09:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:27,262 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:27,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:27,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-10-03 12:09:27,263 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:27,263 INFO L82 PathProgramCache]: Analyzing trace with hash 19043690, now seen corresponding path program 122 times [2021-10-03 12:09:27,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:27,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310296962] [2021-10-03 12:09:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:27,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:27,355 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-03 12:09:27,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:27,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310296962] [2021-10-03 12:09:27,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310296962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:27,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:27,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:27,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329158186] [2021-10-03 12:09:27,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:27,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:27,357 INFO L87 Difference]: Start difference. First operand 1270 states and 3188 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:27,804 INFO L93 Difference]: Finished difference Result 1328 states and 3295 transitions. [2021-10-03 12:09:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:27,807 INFO L225 Difference]: With dead ends: 1328 [2021-10-03 12:09:27,807 INFO L226 Difference]: Without dead ends: 1308 [2021-10-03 12:09:27,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 199.1ms TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-10-03 12:09:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1276. [2021-10-03 12:09:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 2.5074509803921567) internal successors, (3197), 1275 states have internal predecessors, (3197), 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-03 12:09:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3197 transitions. [2021-10-03 12:09:27,823 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3197 transitions. Word has length 38 [2021-10-03 12:09:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:27,823 INFO L470 AbstractCegarLoop]: Abstraction has 1276 states and 3197 transitions. [2021-10-03 12:09:27,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3197 transitions. [2021-10-03 12:09:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:27,825 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:27,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:27,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-10-03 12:09:27,826 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1835383850, now seen corresponding path program 123 times [2021-10-03 12:09:27,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:27,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63480582] [2021-10-03 12:09:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:27,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:27,924 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-03 12:09:27,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:27,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63480582] [2021-10-03 12:09:27,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63480582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:27,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:27,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:27,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29463020] [2021-10-03 12:09:27,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:27,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:27,928 INFO L87 Difference]: Start difference. First operand 1276 states and 3197 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:28,635 INFO L93 Difference]: Finished difference Result 1756 states and 4240 transitions. [2021-10-03 12:09:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-03 12:09:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:28,638 INFO L225 Difference]: With dead ends: 1756 [2021-10-03 12:09:28,638 INFO L226 Difference]: Without dead ends: 1500 [2021-10-03 12:09:28,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 287.8ms TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2021-10-03 12:09:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2021-10-03 12:09:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1258. [2021-10-03 12:09:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 2.517104216388226) internal successors, (3164), 1257 states have internal predecessors, (3164), 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-03 12:09:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 3164 transitions. [2021-10-03 12:09:28,656 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 3164 transitions. Word has length 38 [2021-10-03 12:09:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:28,656 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 3164 transitions. [2021-10-03 12:09:28,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 3164 transitions. [2021-10-03 12:09:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:28,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:28,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:28,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-10-03 12:09:28,658 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 902609728, now seen corresponding path program 124 times [2021-10-03 12:09:28,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:28,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523354210] [2021-10-03 12:09:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:28,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:28,768 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-03 12:09:28,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:28,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523354210] [2021-10-03 12:09:28,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523354210] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:28,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:28,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:28,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372518197] [2021-10-03 12:09:28,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:28,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:28,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:28,771 INFO L87 Difference]: Start difference. First operand 1258 states and 3164 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:29,300 INFO L93 Difference]: Finished difference Result 1354 states and 3333 transitions. [2021-10-03 12:09:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-03 12:09:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:29,303 INFO L225 Difference]: With dead ends: 1354 [2021-10-03 12:09:29,303 INFO L226 Difference]: Without dead ends: 1330 [2021-10-03 12:09:29,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 268.7ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-10-03 12:09:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1252. [2021-10-03 12:09:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 2.5171862509992007) internal successors, (3149), 1251 states have internal predecessors, (3149), 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-03 12:09:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 3149 transitions. [2021-10-03 12:09:29,321 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 3149 transitions. Word has length 38 [2021-10-03 12:09:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:29,321 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 3149 transitions. [2021-10-03 12:09:29,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 3149 transitions. [2021-10-03 12:09:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:29,323 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:29,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:29,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-10-03 12:09:29,323 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1923108578, now seen corresponding path program 125 times [2021-10-03 12:09:29,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:29,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948829335] [2021-10-03 12:09:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:29,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:29,452 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-03 12:09:29,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:29,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948829335] [2021-10-03 12:09:29,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948829335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:29,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:29,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:29,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761070044] [2021-10-03 12:09:29,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:29,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:29,457 INFO L87 Difference]: Start difference. First operand 1252 states and 3149 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:29,954 INFO L93 Difference]: Finished difference Result 1322 states and 3281 transitions. [2021-10-03 12:09:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:29,957 INFO L225 Difference]: With dead ends: 1322 [2021-10-03 12:09:29,957 INFO L226 Difference]: Without dead ends: 1304 [2021-10-03 12:09:29,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 271.8ms TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-10-03 12:09:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1254. [2021-10-03 12:09:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 2.515562649640862) internal successors, (3152), 1253 states have internal predecessors, (3152), 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-03 12:09:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 3152 transitions. [2021-10-03 12:09:29,974 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 3152 transitions. Word has length 38 [2021-10-03 12:09:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:29,974 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 3152 transitions. [2021-10-03 12:09:29,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 3152 transitions. [2021-10-03 12:09:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:29,976 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:29,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:29,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-10-03 12:09:29,976 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -604551974, now seen corresponding path program 126 times [2021-10-03 12:09:29,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:29,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369561002] [2021-10-03 12:09:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:29,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:30,102 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-03 12:09:30,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:30,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369561002] [2021-10-03 12:09:30,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369561002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:30,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:30,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:30,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971425541] [2021-10-03 12:09:30,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:30,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:30,105 INFO L87 Difference]: Start difference. First operand 1254 states and 3152 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:30,585 INFO L93 Difference]: Finished difference Result 1330 states and 3299 transitions. [2021-10-03 12:09:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:30,588 INFO L225 Difference]: With dead ends: 1330 [2021-10-03 12:09:30,588 INFO L226 Difference]: Without dead ends: 1314 [2021-10-03 12:09:30,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 235.3ms TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-03 12:09:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1260. [2021-10-03 12:09:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1259 states have (on average 2.510722795869738) internal successors, (3161), 1259 states have internal predecessors, (3161), 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-03 12:09:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 3161 transitions. [2021-10-03 12:09:30,614 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 3161 transitions. Word has length 38 [2021-10-03 12:09:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:30,614 INFO L470 AbstractCegarLoop]: Abstraction has 1260 states and 3161 transitions. [2021-10-03 12:09:30,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 3161 transitions. [2021-10-03 12:09:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:30,616 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:30,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:30,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-10-03 12:09:30,617 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash 328054976, now seen corresponding path program 127 times [2021-10-03 12:09:30,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:30,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541682689] [2021-10-03 12:09:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:30,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:30,716 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-03 12:09:30,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:30,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541682689] [2021-10-03 12:09:30,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541682689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:30,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:30,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:30,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808740394] [2021-10-03 12:09:30,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:30,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:30,721 INFO L87 Difference]: Start difference. First operand 1260 states and 3161 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:31,281 INFO L93 Difference]: Finished difference Result 1508 states and 3664 transitions. [2021-10-03 12:09:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:31,284 INFO L225 Difference]: With dead ends: 1508 [2021-10-03 12:09:31,284 INFO L226 Difference]: Without dead ends: 1470 [2021-10-03 12:09:31,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 216.8ms TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2021-10-03 12:09:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1246. [2021-10-03 12:09:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.517269076305221) internal successors, (3134), 1245 states have internal predecessors, (3134), 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-03 12:09:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3134 transitions. [2021-10-03 12:09:31,303 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3134 transitions. Word has length 38 [2021-10-03 12:09:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:31,304 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3134 transitions. [2021-10-03 12:09:31,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3134 transitions. [2021-10-03 12:09:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:31,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:31,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:31,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-10-03 12:09:31,307 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash -914695018, now seen corresponding path program 128 times [2021-10-03 12:09:31,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:31,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782551263] [2021-10-03 12:09:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:31,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:31,406 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-03 12:09:31,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:31,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782551263] [2021-10-03 12:09:31,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782551263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:31,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:31,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:31,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475015073] [2021-10-03 12:09:31,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:31,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:31,408 INFO L87 Difference]: Start difference. First operand 1246 states and 3134 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:31,857 INFO L93 Difference]: Finished difference Result 1306 states and 3244 transitions. [2021-10-03 12:09:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:31,859 INFO L225 Difference]: With dead ends: 1306 [2021-10-03 12:09:31,859 INFO L226 Difference]: Without dead ends: 1284 [2021-10-03 12:09:31,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 220.8ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-10-03 12:09:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1246. [2021-10-03 12:09:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.5108433734939757) internal successors, (3126), 1245 states have internal predecessors, (3126), 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-03 12:09:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3126 transitions. [2021-10-03 12:09:31,877 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3126 transitions. Word has length 38 [2021-10-03 12:09:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:31,877 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3126 transitions. [2021-10-03 12:09:31,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3126 transitions. [2021-10-03 12:09:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:31,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:31,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:31,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-10-03 12:09:31,880 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 761661880, now seen corresponding path program 129 times [2021-10-03 12:09:31,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:31,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317265066] [2021-10-03 12:09:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:31,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:31,968 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-03 12:09:31,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:31,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317265066] [2021-10-03 12:09:31,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317265066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:31,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:31,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:31,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322529312] [2021-10-03 12:09:31,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:31,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:31,970 INFO L87 Difference]: Start difference. First operand 1246 states and 3126 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:32,437 INFO L93 Difference]: Finished difference Result 1506 states and 3670 transitions. [2021-10-03 12:09:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:32,440 INFO L225 Difference]: With dead ends: 1506 [2021-10-03 12:09:32,440 INFO L226 Difference]: Without dead ends: 1464 [2021-10-03 12:09:32,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 212.9ms TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2021-10-03 12:09:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1246. [2021-10-03 12:09:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.5092369477911647) internal successors, (3124), 1245 states have internal predecessors, (3124), 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-03 12:09:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3124 transitions. [2021-10-03 12:09:32,458 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3124 transitions. Word has length 38 [2021-10-03 12:09:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:32,458 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3124 transitions. [2021-10-03 12:09:32,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3124 transitions. [2021-10-03 12:09:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:32,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:32,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:32,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-10-03 12:09:32,460 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1972779968, now seen corresponding path program 130 times [2021-10-03 12:09:32,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:32,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164308314] [2021-10-03 12:09:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:32,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:32,583 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-03 12:09:32,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:32,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164308314] [2021-10-03 12:09:32,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164308314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:32,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:32,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:32,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36657481] [2021-10-03 12:09:32,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:32,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:32,586 INFO L87 Difference]: Start difference. First operand 1246 states and 3124 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:33,019 INFO L93 Difference]: Finished difference Result 1312 states and 3248 transitions. [2021-10-03 12:09:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:33,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:33,022 INFO L225 Difference]: With dead ends: 1312 [2021-10-03 12:09:33,022 INFO L226 Difference]: Without dead ends: 1294 [2021-10-03 12:09:33,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 217.2ms TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-03 12:09:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1244. [2021-10-03 12:09:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 2.509251810136766) internal successors, (3119), 1243 states have internal predecessors, (3119), 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-03 12:09:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3119 transitions. [2021-10-03 12:09:33,038 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3119 transitions. Word has length 38 [2021-10-03 12:09:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:33,039 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3119 transitions. [2021-10-03 12:09:33,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3119 transitions. [2021-10-03 12:09:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:33,040 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:33,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:33,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-10-03 12:09:33,041 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash -654223364, now seen corresponding path program 131 times [2021-10-03 12:09:33,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:33,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660270742] [2021-10-03 12:09:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:33,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:33,160 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-03 12:09:33,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:33,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660270742] [2021-10-03 12:09:33,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660270742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:33,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:33,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:33,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824193748] [2021-10-03 12:09:33,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:33,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:33,162 INFO L87 Difference]: Start difference. First operand 1244 states and 3119 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:33,553 INFO L93 Difference]: Finished difference Result 1320 states and 3266 transitions. [2021-10-03 12:09:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:33,556 INFO L225 Difference]: With dead ends: 1320 [2021-10-03 12:09:33,556 INFO L226 Difference]: Without dead ends: 1304 [2021-10-03 12:09:33,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 204.9ms TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-10-03 12:09:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1250. [2021-10-03 12:09:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 2.5044035228182544) internal successors, (3128), 1249 states have internal predecessors, (3128), 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-03 12:09:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3128 transitions. [2021-10-03 12:09:33,574 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3128 transitions. Word has length 38 [2021-10-03 12:09:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:33,574 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 3128 transitions. [2021-10-03 12:09:33,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3128 transitions. [2021-10-03 12:09:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:33,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:33,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:33,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-10-03 12:09:33,576 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash 278383586, now seen corresponding path program 132 times [2021-10-03 12:09:33,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:33,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195448730] [2021-10-03 12:09:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:33,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:33,694 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-03 12:09:33,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:33,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195448730] [2021-10-03 12:09:33,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195448730] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:33,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:33,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:33,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005507983] [2021-10-03 12:09:33,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:33,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:33,696 INFO L87 Difference]: Start difference. First operand 1250 states and 3128 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:34,126 INFO L93 Difference]: Finished difference Result 1324 states and 3278 transitions. [2021-10-03 12:09:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:34,129 INFO L225 Difference]: With dead ends: 1324 [2021-10-03 12:09:34,129 INFO L226 Difference]: Without dead ends: 1314 [2021-10-03 12:09:34,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 209.8ms TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-03 12:09:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1252. [2021-10-03 12:09:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 2.5027977617905677) internal successors, (3131), 1251 states have internal predecessors, (3131), 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-03 12:09:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 3131 transitions. [2021-10-03 12:09:34,154 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 3131 transitions. Word has length 38 [2021-10-03 12:09:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:34,155 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 3131 transitions. [2021-10-03 12:09:34,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 3131 transitions. [2021-10-03 12:09:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:34,158 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:34,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:34,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-10-03 12:09:34,158 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1838345480, now seen corresponding path program 133 times [2021-10-03 12:09:34,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:34,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103971724] [2021-10-03 12:09:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:34,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:34,286 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-03 12:09:34,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:34,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103971724] [2021-10-03 12:09:34,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103971724] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:34,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:34,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:34,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818427163] [2021-10-03 12:09:34,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:34,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:34,289 INFO L87 Difference]: Start difference. First operand 1252 states and 3131 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:34,702 INFO L93 Difference]: Finished difference Result 1418 states and 3480 transitions. [2021-10-03 12:09:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:34,705 INFO L225 Difference]: With dead ends: 1418 [2021-10-03 12:09:34,705 INFO L226 Difference]: Without dead ends: 1396 [2021-10-03 12:09:34,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2021-10-03 12:09:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1244. [2021-10-03 12:09:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 2.507642799678198) internal successors, (3117), 1243 states have internal predecessors, (3117), 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-03 12:09:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3117 transitions. [2021-10-03 12:09:34,722 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3117 transitions. Word has length 38 [2021-10-03 12:09:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:34,722 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3117 transitions. [2021-10-03 12:09:34,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3117 transitions. [2021-10-03 12:09:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:34,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:34,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:34,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-10-03 12:09:34,724 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1475534912, now seen corresponding path program 134 times [2021-10-03 12:09:34,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:34,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581190268] [2021-10-03 12:09:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:34,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:34,802 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-03 12:09:34,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:34,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581190268] [2021-10-03 12:09:34,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581190268] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:34,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:34,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:34,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484167872] [2021-10-03 12:09:34,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:34,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:34,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:34,804 INFO L87 Difference]: Start difference. First operand 1244 states and 3117 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:35,159 INFO L93 Difference]: Finished difference Result 1306 states and 3235 transitions. [2021-10-03 12:09:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:35,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:35,162 INFO L225 Difference]: With dead ends: 1306 [2021-10-03 12:09:35,162 INFO L226 Difference]: Without dead ends: 1290 [2021-10-03 12:09:35,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:09:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-10-03 12:09:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1238. [2021-10-03 12:09:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 2.50767987065481) internal successors, (3102), 1237 states have internal predecessors, (3102), 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-03 12:09:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3102 transitions. [2021-10-03 12:09:35,178 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3102 transitions. Word has length 38 [2021-10-03 12:09:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:35,178 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 3102 transitions. [2021-10-03 12:09:35,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3102 transitions. [2021-10-03 12:09:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:35,180 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:35,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:35,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-10-03 12:09:35,180 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1936448532, now seen corresponding path program 135 times [2021-10-03 12:09:35,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:35,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367502827] [2021-10-03 12:09:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:35,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:35,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-03 12:09:35,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:35,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367502827] [2021-10-03 12:09:35,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367502827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:35,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:35,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:35,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966925690] [2021-10-03 12:09:35,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:35,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:35,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:35,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:35,276 INFO L87 Difference]: Start difference. First operand 1238 states and 3102 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:35,729 INFO L93 Difference]: Finished difference Result 1466 states and 3569 transitions. [2021-10-03 12:09:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:35,732 INFO L225 Difference]: With dead ends: 1466 [2021-10-03 12:09:35,733 INFO L226 Difference]: Without dead ends: 1436 [2021-10-03 12:09:35,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2021-10-03 12:09:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1238. [2021-10-03 12:09:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 2.50767987065481) internal successors, (3102), 1237 states have internal predecessors, (3102), 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-03 12:09:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3102 transitions. [2021-10-03 12:09:35,751 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3102 transitions. Word has length 38 [2021-10-03 12:09:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:35,751 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 3102 transitions. [2021-10-03 12:09:35,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3102 transitions. [2021-10-03 12:09:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:35,753 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:35,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:35,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-10-03 12:09:35,753 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255318, now seen corresponding path program 136 times [2021-10-03 12:09:35,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:35,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538136394] [2021-10-03 12:09:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:35,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:35,845 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-03 12:09:35,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:35,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538136394] [2021-10-03 12:09:35,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538136394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:35,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:35,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:35,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537065358] [2021-10-03 12:09:35,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:35,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:35,847 INFO L87 Difference]: Start difference. First operand 1238 states and 3102 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:36,383 INFO L93 Difference]: Finished difference Result 1544 states and 3682 transitions. [2021-10-03 12:09:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-03 12:09:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:36,385 INFO L225 Difference]: With dead ends: 1544 [2021-10-03 12:09:36,386 INFO L226 Difference]: Without dead ends: 1336 [2021-10-03 12:09:36,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 198.9ms TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-10-03 12:09:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1122. [2021-10-03 12:09:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 2.4674397859054418) internal successors, (2766), 1121 states have internal predecessors, (2766), 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-03 12:09:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2766 transitions. [2021-10-03 12:09:36,399 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2766 transitions. Word has length 38 [2021-10-03 12:09:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:36,400 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 2766 transitions. [2021-10-03 12:09:36,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2766 transitions. [2021-10-03 12:09:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:36,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:36,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:36,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-10-03 12:09:36,401 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash 705839872, now seen corresponding path program 137 times [2021-10-03 12:09:36,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:36,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071983317] [2021-10-03 12:09:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:36,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:36,494 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-03 12:09:36,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:36,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071983317] [2021-10-03 12:09:36,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071983317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:36,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:36,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:36,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762233985] [2021-10-03 12:09:36,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:36,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:36,497 INFO L87 Difference]: Start difference. First operand 1122 states and 2766 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:36,977 INFO L93 Difference]: Finished difference Result 1312 states and 3144 transitions. [2021-10-03 12:09:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:36,977 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:36,979 INFO L225 Difference]: With dead ends: 1312 [2021-10-03 12:09:36,980 INFO L226 Difference]: Without dead ends: 1288 [2021-10-03 12:09:36,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 194.6ms TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2021-10-03 12:09:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1110. [2021-10-03 12:09:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 2.459873760144274) internal successors, (2728), 1109 states have internal predecessors, (2728), 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-03 12:09:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2728 transitions. [2021-10-03 12:09:36,994 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2728 transitions. Word has length 38 [2021-10-03 12:09:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:36,995 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 2728 transitions. [2021-10-03 12:09:36,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2728 transitions. [2021-10-03 12:09:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:36,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:36,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:36,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-10-03 12:09:36,997 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:36,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:36,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1307811072, now seen corresponding path program 138 times [2021-10-03 12:09:36,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:36,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848821733] [2021-10-03 12:09:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:36,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:37,085 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-03 12:09:37,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:37,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848821733] [2021-10-03 12:09:37,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848821733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:37,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:37,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:37,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664273000] [2021-10-03 12:09:37,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:37,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:37,087 INFO L87 Difference]: Start difference. First operand 1110 states and 2728 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:37,529 INFO L93 Difference]: Finished difference Result 1086 states and 2546 transitions. [2021-10-03 12:09:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:37,531 INFO L225 Difference]: With dead ends: 1086 [2021-10-03 12:09:37,532 INFO L226 Difference]: Without dead ends: 966 [2021-10-03 12:09:37,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-10-03 12:09:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 794. [2021-10-03 12:09:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.4262295081967213) internal successors, (1924), 793 states have internal predecessors, (1924), 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-03 12:09:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1924 transitions. [2021-10-03 12:09:37,543 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1924 transitions. Word has length 38 [2021-10-03 12:09:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:37,543 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1924 transitions. [2021-10-03 12:09:37,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1924 transitions. [2021-10-03 12:09:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:37,544 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:37,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:37,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-10-03 12:09:37,545 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1482565354, now seen corresponding path program 139 times [2021-10-03 12:09:37,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:37,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121061040] [2021-10-03 12:09:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:37,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:37,620 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-03 12:09:37,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:37,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121061040] [2021-10-03 12:09:37,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121061040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:37,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:37,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:37,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105133831] [2021-10-03 12:09:37,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:37,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:37,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:37,623 INFO L87 Difference]: Start difference. First operand 794 states and 1924 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:38,022 INFO L93 Difference]: Finished difference Result 948 states and 2237 transitions. [2021-10-03 12:09:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:38,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:38,024 INFO L225 Difference]: With dead ends: 948 [2021-10-03 12:09:38,024 INFO L226 Difference]: Without dead ends: 918 [2021-10-03 12:09:38,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-10-03 12:09:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 770. [2021-10-03 12:09:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 2.431729518855657) internal successors, (1870), 769 states have internal predecessors, (1870), 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-03 12:09:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1870 transitions. [2021-10-03 12:09:38,035 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1870 transitions. Word has length 38 [2021-10-03 12:09:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:38,035 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1870 transitions. [2021-10-03 12:09:38,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1870 transitions. [2021-10-03 12:09:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:38,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:38,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:38,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-10-03 12:09:38,037 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1120419600, now seen corresponding path program 140 times [2021-10-03 12:09:38,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:38,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25865961] [2021-10-03 12:09:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:38,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:38,125 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-03 12:09:38,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:38,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25865961] [2021-10-03 12:09:38,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25865961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:38,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:38,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:09:38,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194771994] [2021-10-03 12:09:38,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:09:38,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:09:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:09:38,127 INFO L87 Difference]: Start difference. First operand 770 states and 1870 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:38,383 INFO L93 Difference]: Finished difference Result 856 states and 2037 transitions. [2021-10-03 12:09:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:09:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:38,385 INFO L225 Difference]: With dead ends: 856 [2021-10-03 12:09:38,386 INFO L226 Difference]: Without dead ends: 772 [2021-10-03 12:09:38,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 104.7ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:09:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-10-03 12:09:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 736. [2021-10-03 12:09:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.3714285714285714) internal successors, (1743), 735 states have internal predecessors, (1743), 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-03 12:09:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1743 transitions. [2021-10-03 12:09:38,395 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1743 transitions. Word has length 38 [2021-10-03 12:09:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:38,395 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1743 transitions. [2021-10-03 12:09:38,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:09:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1743 transitions. [2021-10-03 12:09:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:38,396 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:38,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:38,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-10-03 12:09:38,396 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 438685318, now seen corresponding path program 141 times [2021-10-03 12:09:38,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:38,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714171368] [2021-10-03 12:09:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:38,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:38,488 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-03 12:09:38,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:38,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714171368] [2021-10-03 12:09:38,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714171368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:38,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:38,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:38,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289581975] [2021-10-03 12:09:38,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:38,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:38,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:38,491 INFO L87 Difference]: Start difference. First operand 736 states and 1743 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:38,853 INFO L93 Difference]: Finished difference Result 842 states and 1962 transitions. [2021-10-03 12:09:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:38,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:38,855 INFO L225 Difference]: With dead ends: 842 [2021-10-03 12:09:38,855 INFO L226 Difference]: Without dead ends: 824 [2021-10-03 12:09:38,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 157.4ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-10-03 12:09:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 722. [2021-10-03 12:09:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.3717059639389735) internal successors, (1710), 721 states have internal predecessors, (1710), 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-03 12:09:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1710 transitions. [2021-10-03 12:09:38,864 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1710 transitions. Word has length 38 [2021-10-03 12:09:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:38,864 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1710 transitions. [2021-10-03 12:09:38,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1710 transitions. [2021-10-03 12:09:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:38,866 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:38,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:38,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-10-03 12:09:38,866 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1149597078, now seen corresponding path program 142 times [2021-10-03 12:09:38,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:38,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890434410] [2021-10-03 12:09:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:38,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:38,965 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-03 12:09:38,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:38,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890434410] [2021-10-03 12:09:38,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890434410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:38,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:38,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:38,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444612421] [2021-10-03 12:09:38,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:38,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:38,970 INFO L87 Difference]: Start difference. First operand 722 states and 1710 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:39,413 INFO L93 Difference]: Finished difference Result 830 states and 1932 transitions. [2021-10-03 12:09:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:39,415 INFO L225 Difference]: With dead ends: 830 [2021-10-03 12:09:39,415 INFO L226 Difference]: Without dead ends: 814 [2021-10-03 12:09:39,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 204.0ms TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-03 12:09:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 734. [2021-10-03 12:09:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 2.379263301500682) internal successors, (1744), 733 states have internal predecessors, (1744), 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-03 12:09:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1744 transitions. [2021-10-03 12:09:39,425 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1744 transitions. Word has length 38 [2021-10-03 12:09:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:39,425 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1744 transitions. [2021-10-03 12:09:39,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1744 transitions. [2021-10-03 12:09:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:39,426 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:39,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:39,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-10-03 12:09:39,426 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1708263052, now seen corresponding path program 143 times [2021-10-03 12:09:39,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:39,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767955172] [2021-10-03 12:09:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:39,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:39,522 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-03 12:09:39,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:39,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767955172] [2021-10-03 12:09:39,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767955172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:39,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:39,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:39,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15301276] [2021-10-03 12:09:39,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:39,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:39,524 INFO L87 Difference]: Start difference. First operand 734 states and 1744 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:39,915 INFO L93 Difference]: Finished difference Result 784 states and 1829 transitions. [2021-10-03 12:09:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:39,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:39,917 INFO L225 Difference]: With dead ends: 784 [2021-10-03 12:09:39,917 INFO L226 Difference]: Without dead ends: 758 [2021-10-03 12:09:39,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 185.8ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-10-03 12:09:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 728. [2021-10-03 12:09:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 2.370013755158184) internal successors, (1723), 727 states have internal predecessors, (1723), 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-03 12:09:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1723 transitions. [2021-10-03 12:09:39,926 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1723 transitions. Word has length 38 [2021-10-03 12:09:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:39,926 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1723 transitions. [2021-10-03 12:09:39,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1723 transitions. [2021-10-03 12:09:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:39,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:39,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:39,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-10-03 12:09:39,927 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 468121878, now seen corresponding path program 144 times [2021-10-03 12:09:39,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:39,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838379516] [2021-10-03 12:09:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:39,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:40,028 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-03 12:09:40,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:40,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838379516] [2021-10-03 12:09:40,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838379516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:40,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:40,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:40,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196351763] [2021-10-03 12:09:40,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:40,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:40,030 INFO L87 Difference]: Start difference. First operand 728 states and 1723 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:40,363 INFO L93 Difference]: Finished difference Result 778 states and 1808 transitions. [2021-10-03 12:09:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:40,365 INFO L225 Difference]: With dead ends: 778 [2021-10-03 12:09:40,365 INFO L226 Difference]: Without dead ends: 754 [2021-10-03 12:09:40,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 174.3ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-10-03 12:09:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 726. [2021-10-03 12:09:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.3696551724137933) internal successors, (1718), 725 states have internal predecessors, (1718), 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-03 12:09:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1718 transitions. [2021-10-03 12:09:40,374 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1718 transitions. Word has length 38 [2021-10-03 12:09:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:40,375 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1718 transitions. [2021-10-03 12:09:40,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1718 transitions. [2021-10-03 12:09:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:40,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:40,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:40,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-10-03 12:09:40,376 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 731200150, now seen corresponding path program 145 times [2021-10-03 12:09:40,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:40,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467132435] [2021-10-03 12:09:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:40,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:40,474 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-03 12:09:40,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:40,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467132435] [2021-10-03 12:09:40,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467132435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:40,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:40,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:40,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666946072] [2021-10-03 12:09:40,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:40,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:40,477 INFO L87 Difference]: Start difference. First operand 726 states and 1718 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:40,779 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2021-10-03 12:09:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:40,782 INFO L225 Difference]: With dead ends: 798 [2021-10-03 12:09:40,782 INFO L226 Difference]: Without dead ends: 782 [2021-10-03 12:09:40,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 152.4ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-10-03 12:09:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 728. [2021-10-03 12:09:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 2.3672627235213204) internal successors, (1721), 727 states have internal predecessors, (1721), 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-03 12:09:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1721 transitions. [2021-10-03 12:09:40,791 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1721 transitions. Word has length 38 [2021-10-03 12:09:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:40,791 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1721 transitions. [2021-10-03 12:09:40,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1721 transitions. [2021-10-03 12:09:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:40,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:40,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:40,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-10-03 12:09:40,793 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1759667398, now seen corresponding path program 146 times [2021-10-03 12:09:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:40,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761365609] [2021-10-03 12:09:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:40,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:40,892 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-03 12:09:40,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:40,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761365609] [2021-10-03 12:09:40,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761365609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:40,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:40,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:40,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979730408] [2021-10-03 12:09:40,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:40,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:40,894 INFO L87 Difference]: Start difference. First operand 728 states and 1721 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:41,205 INFO L93 Difference]: Finished difference Result 806 states and 1868 transitions. [2021-10-03 12:09:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:41,208 INFO L225 Difference]: With dead ends: 806 [2021-10-03 12:09:41,208 INFO L226 Difference]: Without dead ends: 792 [2021-10-03 12:09:41,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 146.5ms TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-10-03 12:09:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 726. [2021-10-03 12:09:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.366896551724138) internal successors, (1716), 725 states have internal predecessors, (1716), 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-03 12:09:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1716 transitions. [2021-10-03 12:09:41,223 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1716 transitions. Word has length 38 [2021-10-03 12:09:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:41,223 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1716 transitions. [2021-10-03 12:09:41,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1716 transitions. [2021-10-03 12:09:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:41,225 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:41,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:41,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-10-03 12:09:41,225 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 33758166, now seen corresponding path program 147 times [2021-10-03 12:09:41,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:41,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890363685] [2021-10-03 12:09:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:41,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:41,325 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-03 12:09:41,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:41,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890363685] [2021-10-03 12:09:41,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890363685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:41,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:41,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:41,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230799457] [2021-10-03 12:09:41,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:41,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:41,327 INFO L87 Difference]: Start difference. First operand 726 states and 1716 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:41,614 INFO L93 Difference]: Finished difference Result 808 states and 1861 transitions. [2021-10-03 12:09:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:09:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:41,616 INFO L225 Difference]: With dead ends: 808 [2021-10-03 12:09:41,616 INFO L226 Difference]: Without dead ends: 792 [2021-10-03 12:09:41,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 118.0ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:09:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-10-03 12:09:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 732. [2021-10-03 12:09:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 2.359781121751026) internal successors, (1725), 731 states have internal predecessors, (1725), 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-03 12:09:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1725 transitions. [2021-10-03 12:09:41,625 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1725 transitions. Word has length 38 [2021-10-03 12:09:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:41,626 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1725 transitions. [2021-10-03 12:09:41,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1725 transitions. [2021-10-03 12:09:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:41,627 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:41,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:41,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-10-03 12:09:41,627 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1898443408, now seen corresponding path program 148 times [2021-10-03 12:09:41,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:41,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600716624] [2021-10-03 12:09:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:41,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:41,722 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-03 12:09:41,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:41,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600716624] [2021-10-03 12:09:41,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600716624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:41,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:41,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:41,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709480676] [2021-10-03 12:09:41,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:41,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:41,725 INFO L87 Difference]: Start difference. First operand 732 states and 1725 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:42,070 INFO L93 Difference]: Finished difference Result 818 states and 1886 transitions. [2021-10-03 12:09:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:42,072 INFO L225 Difference]: With dead ends: 818 [2021-10-03 12:09:42,072 INFO L226 Difference]: Without dead ends: 794 [2021-10-03 12:09:42,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-10-03 12:09:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 720. [2021-10-03 12:09:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.365785813630042) internal successors, (1701), 719 states have internal predecessors, (1701), 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-03 12:09:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1701 transitions. [2021-10-03 12:09:42,082 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1701 transitions. Word has length 38 [2021-10-03 12:09:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:42,083 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1701 transitions. [2021-10-03 12:09:42,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1701 transitions. [2021-10-03 12:09:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:42,084 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:42,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:42,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-10-03 12:09:42,084 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash -716806214, now seen corresponding path program 149 times [2021-10-03 12:09:42,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:42,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684912354] [2021-10-03 12:09:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:42,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:42,191 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-03 12:09:42,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:42,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684912354] [2021-10-03 12:09:42,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684912354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:42,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:42,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:42,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337211495] [2021-10-03 12:09:42,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:42,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:42,193 INFO L87 Difference]: Start difference. First operand 720 states and 1701 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:42,531 INFO L93 Difference]: Finished difference Result 770 states and 1784 transitions. [2021-10-03 12:09:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:42,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:42,533 INFO L225 Difference]: With dead ends: 770 [2021-10-03 12:09:42,533 INFO L226 Difference]: Without dead ends: 752 [2021-10-03 12:09:42,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 163.1ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-10-03 12:09:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 718. [2021-10-03 12:09:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.3654114365411436) internal successors, (1696), 717 states have internal predecessors, (1696), 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-03 12:09:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1696 transitions. [2021-10-03 12:09:42,543 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1696 transitions. Word has length 38 [2021-10-03 12:09:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:42,543 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 1696 transitions. [2021-10-03 12:09:42,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1696 transitions. [2021-10-03 12:09:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:42,544 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:42,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:42,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-10-03 12:09:42,545 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash 601750390, now seen corresponding path program 150 times [2021-10-03 12:09:42,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:42,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423747001] [2021-10-03 12:09:42,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:42,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:42,649 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-03 12:09:42,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:42,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423747001] [2021-10-03 12:09:42,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423747001] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:42,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:42,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:42,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522702354] [2021-10-03 12:09:42,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:42,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:42,651 INFO L87 Difference]: Start difference. First operand 718 states and 1696 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:42,941 INFO L93 Difference]: Finished difference Result 760 states and 1767 transitions. [2021-10-03 12:09:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:42,943 INFO L225 Difference]: With dead ends: 760 [2021-10-03 12:09:42,944 INFO L226 Difference]: Without dead ends: 744 [2021-10-03 12:09:42,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 138.1ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-03 12:09:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 718. [2021-10-03 12:09:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.3570432357043236) internal successors, (1690), 717 states have internal predecessors, (1690), 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-03 12:09:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1690 transitions. [2021-10-03 12:09:42,959 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1690 transitions. Word has length 38 [2021-10-03 12:09:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:42,960 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 1690 transitions. [2021-10-03 12:09:42,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1690 transitions. [2021-10-03 12:09:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:42,962 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:42,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:42,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-10-03 12:09:42,962 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1144979982, now seen corresponding path program 151 times [2021-10-03 12:09:42,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:42,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312559701] [2021-10-03 12:09:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:42,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:43,076 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-03 12:09:43,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:43,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312559701] [2021-10-03 12:09:43,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312559701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:43,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:43,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:43,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812863595] [2021-10-03 12:09:43,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:43,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:43,079 INFO L87 Difference]: Start difference. First operand 718 states and 1690 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:43,409 INFO L93 Difference]: Finished difference Result 752 states and 1749 transitions. [2021-10-03 12:09:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:43,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:43,410 INFO L225 Difference]: With dead ends: 752 [2021-10-03 12:09:43,410 INFO L226 Difference]: Without dead ends: 718 [2021-10-03 12:09:43,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 171.9ms TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-10-03 12:09:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 702. [2021-10-03 12:09:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 2.3680456490727533) internal successors, (1660), 701 states have internal predecessors, (1660), 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-03 12:09:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1660 transitions. [2021-10-03 12:09:43,420 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1660 transitions. Word has length 38 [2021-10-03 12:09:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:43,420 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1660 transitions. [2021-10-03 12:09:43,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1660 transitions. [2021-10-03 12:09:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:43,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:43,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:43,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-10-03 12:09:43,422 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1705507774, now seen corresponding path program 152 times [2021-10-03 12:09:43,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:43,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428714715] [2021-10-03 12:09:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:43,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:43,499 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-03 12:09:43,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:43,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428714715] [2021-10-03 12:09:43,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428714715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:43,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:43,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:09:43,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705180954] [2021-10-03 12:09:43,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:09:43,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:09:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:09:43,501 INFO L87 Difference]: Start difference. First operand 702 states and 1660 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:09:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:43,698 INFO L93 Difference]: Finished difference Result 598 states and 1356 transitions. [2021-10-03 12:09:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:09:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:43,700 INFO L225 Difference]: With dead ends: 598 [2021-10-03 12:09:43,700 INFO L226 Difference]: Without dead ends: 538 [2021-10-03 12:09:43,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-03 12:09:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 474. [2021-10-03 12:09:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.2579281183932345) internal successors, (1068), 473 states have internal predecessors, (1068), 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-03 12:09:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1068 transitions. [2021-10-03 12:09:43,707 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1068 transitions. Word has length 38 [2021-10-03 12:09:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:43,708 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1068 transitions. [2021-10-03 12:09:43,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-03 12:09:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1068 transitions. [2021-10-03 12:09:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:43,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:43,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:43,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-10-03 12:09:43,709 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -370608812, now seen corresponding path program 153 times [2021-10-03 12:09:43,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:43,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112826296] [2021-10-03 12:09:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:43,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:43,818 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-03 12:09:43,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:43,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112826296] [2021-10-03 12:09:43,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112826296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:43,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:43,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:43,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581690204] [2021-10-03 12:09:43,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:43,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:43,820 INFO L87 Difference]: Start difference. First operand 474 states and 1068 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:44,142 INFO L93 Difference]: Finished difference Result 574 states and 1284 transitions. [2021-10-03 12:09:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:44,144 INFO L225 Difference]: With dead ends: 574 [2021-10-03 12:09:44,145 INFO L226 Difference]: Without dead ends: 558 [2021-10-03 12:09:44,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 155.0ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-03 12:09:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 474. [2021-10-03 12:09:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.2536997885835097) internal successors, (1066), 473 states have internal predecessors, (1066), 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-03 12:09:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1066 transitions. [2021-10-03 12:09:44,152 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1066 transitions. Word has length 38 [2021-10-03 12:09:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:44,152 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1066 transitions. [2021-10-03 12:09:44,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1066 transitions. [2021-10-03 12:09:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:44,153 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:44,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:44,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-10-03 12:09:44,153 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash -929274786, now seen corresponding path program 154 times [2021-10-03 12:09:44,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:44,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647319665] [2021-10-03 12:09:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:44,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:44,274 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-03 12:09:44,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:44,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647319665] [2021-10-03 12:09:44,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647319665] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:44,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:44,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:44,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660930986] [2021-10-03 12:09:44,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:44,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:44,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:44,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:44,277 INFO L87 Difference]: Start difference. First operand 474 states and 1066 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:44,528 INFO L93 Difference]: Finished difference Result 552 states and 1233 transitions. [2021-10-03 12:09:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:09:44,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:44,530 INFO L225 Difference]: With dead ends: 552 [2021-10-03 12:09:44,530 INFO L226 Difference]: Without dead ends: 526 [2021-10-03 12:09:44,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 108.6ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:09:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-03 12:09:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 468. [2021-10-03 12:09:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.2419700214132763) internal successors, (1047), 467 states have internal predecessors, (1047), 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-03 12:09:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1047 transitions. [2021-10-03 12:09:44,540 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1047 transitions. Word has length 38 [2021-10-03 12:09:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:44,540 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1047 transitions. [2021-10-03 12:09:44,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1047 transitions. [2021-10-03 12:09:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:44,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:44,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:44,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-10-03 12:09:44,543 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -710360644, now seen corresponding path program 155 times [2021-10-03 12:09:44,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:44,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296005087] [2021-10-03 12:09:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:44,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:44,639 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-03 12:09:44,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:44,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296005087] [2021-10-03 12:09:44,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296005087] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:44,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:44,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197693895] [2021-10-03 12:09:44,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:44,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:44,642 INFO L87 Difference]: Start difference. First operand 468 states and 1047 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:44,923 INFO L93 Difference]: Finished difference Result 542 states and 1208 transitions. [2021-10-03 12:09:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:44,924 INFO L225 Difference]: With dead ends: 542 [2021-10-03 12:09:44,924 INFO L226 Difference]: Without dead ends: 526 [2021-10-03 12:09:44,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 144.1ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-03 12:09:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 466. [2021-10-03 12:09:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.2408602150537633) internal successors, (1042), 465 states have internal predecessors, (1042), 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-03 12:09:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1042 transitions. [2021-10-03 12:09:44,931 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1042 transitions. Word has length 38 [2021-10-03 12:09:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:44,931 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1042 transitions. [2021-10-03 12:09:44,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1042 transitions. [2021-10-03 12:09:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:44,932 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:44,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-10-03 12:09:44,932 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1093739104, now seen corresponding path program 156 times [2021-10-03 12:09:44,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:44,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810490170] [2021-10-03 12:09:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:44,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:45,017 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-03 12:09:45,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:45,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810490170] [2021-10-03 12:09:45,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810490170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:45,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:45,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:45,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500216724] [2021-10-03 12:09:45,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:45,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:45,019 INFO L87 Difference]: Start difference. First operand 466 states and 1042 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:45,311 INFO L93 Difference]: Finished difference Result 552 states and 1227 transitions. [2021-10-03 12:09:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:45,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:45,313 INFO L225 Difference]: With dead ends: 552 [2021-10-03 12:09:45,314 INFO L226 Difference]: Without dead ends: 538 [2021-10-03 12:09:45,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 137.3ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-03 12:09:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 464. [2021-10-03 12:09:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.239740820734341) internal successors, (1037), 463 states have internal predecessors, (1037), 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-03 12:09:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1037 transitions. [2021-10-03 12:09:45,322 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1037 transitions. Word has length 38 [2021-10-03 12:09:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:45,322 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1037 transitions. [2021-10-03 12:09:45,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1037 transitions. [2021-10-03 12:09:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:45,323 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:45,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:45,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-10-03 12:09:45,324 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1407802628, now seen corresponding path program 157 times [2021-10-03 12:09:45,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:45,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301687272] [2021-10-03 12:09:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:45,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:45,413 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-03 12:09:45,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:45,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301687272] [2021-10-03 12:09:45,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301687272] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:45,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:45,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:45,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200304447] [2021-10-03 12:09:45,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:45,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:45,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:45,416 INFO L87 Difference]: Start difference. First operand 464 states and 1037 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:45,671 INFO L93 Difference]: Finished difference Result 546 states and 1208 transitions. [2021-10-03 12:09:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:45,672 INFO L225 Difference]: With dead ends: 546 [2021-10-03 12:09:45,673 INFO L226 Difference]: Without dead ends: 530 [2021-10-03 12:09:45,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:09:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-03 12:09:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 458. [2021-10-03 12:09:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.236323851203501) internal successors, (1022), 457 states have internal predecessors, (1022), 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-03 12:09:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1022 transitions. [2021-10-03 12:09:45,682 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1022 transitions. Word has length 38 [2021-10-03 12:09:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:45,683 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1022 transitions. [2021-10-03 12:09:45,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1022 transitions. [2021-10-03 12:09:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:45,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:45,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:45,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-10-03 12:09:45,685 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 954963094, now seen corresponding path program 158 times [2021-10-03 12:09:45,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:45,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404061925] [2021-10-03 12:09:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:45,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:45,782 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-03 12:09:45,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:45,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404061925] [2021-10-03 12:09:45,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404061925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:45,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:45,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:45,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578637243] [2021-10-03 12:09:45,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:45,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:45,785 INFO L87 Difference]: Start difference. First operand 458 states and 1022 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:46,058 INFO L93 Difference]: Finished difference Result 498 states and 1112 transitions. [2021-10-03 12:09:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:46,060 INFO L225 Difference]: With dead ends: 498 [2021-10-03 12:09:46,060 INFO L226 Difference]: Without dead ends: 474 [2021-10-03 12:09:46,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 128.7ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-10-03 12:09:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 410. [2021-10-03 12:09:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.2640586797066016) internal successors, (926), 409 states have internal predecessors, (926), 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-03 12:09:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 926 transitions. [2021-10-03 12:09:46,068 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 926 transitions. Word has length 38 [2021-10-03 12:09:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:46,068 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 926 transitions. [2021-10-03 12:09:46,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 926 transitions. [2021-10-03 12:09:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:46,069 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:46,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:46,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-10-03 12:09:46,070 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1952534578, now seen corresponding path program 159 times [2021-10-03 12:09:46,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:46,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426830608] [2021-10-03 12:09:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:46,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:46,164 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-03 12:09:46,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:46,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426830608] [2021-10-03 12:09:46,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426830608] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:46,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:46,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:46,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617253224] [2021-10-03 12:09:46,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:46,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:46,167 INFO L87 Difference]: Start difference. First operand 410 states and 926 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:46,426 INFO L93 Difference]: Finished difference Result 516 states and 1145 transitions. [2021-10-03 12:09:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:46,427 INFO L225 Difference]: With dead ends: 516 [2021-10-03 12:09:46,427 INFO L226 Difference]: Without dead ends: 496 [2021-10-03 12:09:46,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:09:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-03 12:09:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 422. [2021-10-03 12:09:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.2707838479809976) internal successors, (956), 421 states have internal predecessors, (956), 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-03 12:09:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 956 transitions. [2021-10-03 12:09:46,433 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 956 transitions. Word has length 38 [2021-10-03 12:09:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:46,433 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 956 transitions. [2021-10-03 12:09:46,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 956 transitions. [2021-10-03 12:09:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:46,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:46,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:46,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-10-03 12:09:46,435 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash 488005178, now seen corresponding path program 160 times [2021-10-03 12:09:46,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:46,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280861931] [2021-10-03 12:09:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:46,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:46,518 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-03 12:09:46,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:46,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280861931] [2021-10-03 12:09:46,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280861931] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:46,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:46,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:46,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955899350] [2021-10-03 12:09:46,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:46,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:46,521 INFO L87 Difference]: Start difference. First operand 422 states and 956 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:46,970 INFO L93 Difference]: Finished difference Result 790 states and 1744 transitions. [2021-10-03 12:09:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:46,972 INFO L225 Difference]: With dead ends: 790 [2021-10-03 12:09:46,972 INFO L226 Difference]: Without dead ends: 750 [2021-10-03 12:09:46,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 200.2ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-03 12:09:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 428. [2021-10-03 12:09:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.2927400468384076) internal successors, (979), 427 states have internal predecessors, (979), 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-03 12:09:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 979 transitions. [2021-10-03 12:09:46,979 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 979 transitions. Word has length 38 [2021-10-03 12:09:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:46,979 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 979 transitions. [2021-10-03 12:09:46,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 979 transitions. [2021-10-03 12:09:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:46,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:46,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:46,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-10-03 12:09:46,981 INFO L402 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1018670850, now seen corresponding path program 161 times [2021-10-03 12:09:46,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:46,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578736967] [2021-10-03 12:09:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:46,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:47,082 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-03 12:09:47,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:47,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578736967] [2021-10-03 12:09:47,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578736967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:47,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:47,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:47,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961235809] [2021-10-03 12:09:47,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:47,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:47,086 INFO L87 Difference]: Start difference. First operand 428 states and 979 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:47,398 INFO L93 Difference]: Finished difference Result 548 states and 1214 transitions. [2021-10-03 12:09:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:47,400 INFO L225 Difference]: With dead ends: 548 [2021-10-03 12:09:47,400 INFO L226 Difference]: Without dead ends: 532 [2021-10-03 12:09:47,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 137.9ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:09:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-03 12:09:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 434. [2021-10-03 12:09:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.2817551963048497) internal successors, (988), 433 states have internal predecessors, (988), 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-03 12:09:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 988 transitions. [2021-10-03 12:09:47,406 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 988 transitions. Word has length 38 [2021-10-03 12:09:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:47,407 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 988 transitions. [2021-10-03 12:09:47,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 988 transitions. [2021-10-03 12:09:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:47,408 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:47,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:47,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-10-03 12:09:47,408 INFO L402 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -135686998, now seen corresponding path program 162 times [2021-10-03 12:09:47,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:47,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468495236] [2021-10-03 12:09:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:47,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:47,513 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-03 12:09:47,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:47,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468495236] [2021-10-03 12:09:47,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468495236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:47,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:47,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:47,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387317817] [2021-10-03 12:09:47,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:47,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:47,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:47,515 INFO L87 Difference]: Start difference. First operand 434 states and 988 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:47,998 INFO L93 Difference]: Finished difference Result 782 states and 1707 transitions. [2021-10-03 12:09:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:47,999 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:48,001 INFO L225 Difference]: With dead ends: 782 [2021-10-03 12:09:48,001 INFO L226 Difference]: Without dead ends: 750 [2021-10-03 12:09:48,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 214.5ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-10-03 12:09:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 426. [2021-10-03 12:09:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.2776470588235296) internal successors, (968), 425 states have internal predecessors, (968), 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-03 12:09:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 968 transitions. [2021-10-03 12:09:48,007 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 968 transitions. Word has length 38 [2021-10-03 12:09:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:48,007 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 968 transitions. [2021-10-03 12:09:48,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 968 transitions. [2021-10-03 12:09:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:48,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:48,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:48,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-10-03 12:09:48,008 INFO L402 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -665950444, now seen corresponding path program 163 times [2021-10-03 12:09:48,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:48,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091995966] [2021-10-03 12:09:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:48,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:48,124 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-03 12:09:48,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:48,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091995966] [2021-10-03 12:09:48,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091995966] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:48,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:48,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:48,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598678668] [2021-10-03 12:09:48,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:48,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:48,126 INFO L87 Difference]: Start difference. First operand 426 states and 968 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:48,620 INFO L93 Difference]: Finished difference Result 678 states and 1514 transitions. [2021-10-03 12:09:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:48,622 INFO L225 Difference]: With dead ends: 678 [2021-10-03 12:09:48,622 INFO L226 Difference]: Without dead ends: 656 [2021-10-03 12:09:48,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 252.3ms TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-10-03 12:09:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 430. [2021-10-03 12:09:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 2.275058275058275) internal successors, (976), 429 states have internal predecessors, (976), 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-03 12:09:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 976 transitions. [2021-10-03 12:09:48,631 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 976 transitions. Word has length 38 [2021-10-03 12:09:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:48,631 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 976 transitions. [2021-10-03 12:09:48,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 976 transitions. [2021-10-03 12:09:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:48,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:48,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:48,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-10-03 12:09:48,632 INFO L402 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1788365890, now seen corresponding path program 164 times [2021-10-03 12:09:48,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:48,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616437525] [2021-10-03 12:09:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:48,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:48,738 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-03 12:09:48,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:48,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616437525] [2021-10-03 12:09:48,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616437525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:48,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:48,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:48,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70973966] [2021-10-03 12:09:48,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:48,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:48,740 INFO L87 Difference]: Start difference. First operand 430 states and 976 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:49,151 INFO L93 Difference]: Finished difference Result 728 states and 1610 transitions. [2021-10-03 12:09:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:09:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:49,153 INFO L225 Difference]: With dead ends: 728 [2021-10-03 12:09:49,153 INFO L226 Difference]: Without dead ends: 700 [2021-10-03 12:09:49,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 171.0ms TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-10-03 12:09:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 420. [2021-10-03 12:09:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.2840095465393793) internal successors, (957), 419 states have internal predecessors, (957), 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-03 12:09:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 957 transitions. [2021-10-03 12:09:49,160 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 957 transitions. Word has length 38 [2021-10-03 12:09:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:49,160 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 957 transitions. [2021-10-03 12:09:49,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 957 transitions. [2021-10-03 12:09:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:49,161 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:49,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:49,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-10-03 12:09:49,162 INFO L402 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1604510092, now seen corresponding path program 165 times [2021-10-03 12:09:49,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:49,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144456434] [2021-10-03 12:09:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:49,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:49,263 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-03 12:09:49,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:49,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144456434] [2021-10-03 12:09:49,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144456434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:49,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:49,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:49,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003557896] [2021-10-03 12:09:49,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:49,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:49,265 INFO L87 Difference]: Start difference. First operand 420 states and 957 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:49,588 INFO L93 Difference]: Finished difference Result 458 states and 1024 transitions. [2021-10-03 12:09:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:49,589 INFO L225 Difference]: With dead ends: 458 [2021-10-03 12:09:49,590 INFO L226 Difference]: Without dead ends: 436 [2021-10-03 12:09:49,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 155.0ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-03 12:09:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 420. [2021-10-03 12:09:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.279236276849642) internal successors, (955), 419 states have internal predecessors, (955), 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-03 12:09:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 955 transitions. [2021-10-03 12:09:49,595 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 955 transitions. Word has length 38 [2021-10-03 12:09:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:49,595 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 955 transitions. [2021-10-03 12:09:49,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 955 transitions. [2021-10-03 12:09:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:49,596 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:49,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:49,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-10-03 12:09:49,597 INFO L402 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1926274346, now seen corresponding path program 166 times [2021-10-03 12:09:49,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:49,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674728316] [2021-10-03 12:09:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:49,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:49,694 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-03 12:09:49,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:49,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674728316] [2021-10-03 12:09:49,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674728316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:49,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:49,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:49,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761724406] [2021-10-03 12:09:49,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:49,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:49,696 INFO L87 Difference]: Start difference. First operand 420 states and 955 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:49,999 INFO L93 Difference]: Finished difference Result 478 states and 1062 transitions. [2021-10-03 12:09:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:50,000 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:50,001 INFO L225 Difference]: With dead ends: 478 [2021-10-03 12:09:50,001 INFO L226 Difference]: Without dead ends: 458 [2021-10-03 12:09:50,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-03 12:09:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 420. [2021-10-03 12:09:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.2649164677804294) internal successors, (949), 419 states have internal predecessors, (949), 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-03 12:09:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 949 transitions. [2021-10-03 12:09:50,007 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 949 transitions. Word has length 38 [2021-10-03 12:09:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:50,007 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 949 transitions. [2021-10-03 12:09:50,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 949 transitions. [2021-10-03 12:09:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:50,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:50,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:50,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-10-03 12:09:50,008 INFO L402 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 71846806, now seen corresponding path program 167 times [2021-10-03 12:09:50,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:50,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550157112] [2021-10-03 12:09:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:50,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:50,110 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-03 12:09:50,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:50,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550157112] [2021-10-03 12:09:50,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550157112] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:50,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:50,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:50,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443481605] [2021-10-03 12:09:50,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:50,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:50,113 INFO L87 Difference]: Start difference. First operand 420 states and 949 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:50,625 INFO L93 Difference]: Finished difference Result 706 states and 1548 transitions. [2021-10-03 12:09:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-03 12:09:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:50,629 INFO L225 Difference]: With dead ends: 706 [2021-10-03 12:09:50,630 INFO L226 Difference]: Without dead ends: 664 [2021-10-03 12:09:50,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 256.3ms TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2021-10-03 12:09:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-10-03 12:09:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 412. [2021-10-03 12:09:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.2603406326034063) internal successors, (929), 411 states have internal predecessors, (929), 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-03 12:09:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 929 transitions. [2021-10-03 12:09:50,640 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 929 transitions. Word has length 38 [2021-10-03 12:09:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:50,640 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 929 transitions. [2021-10-03 12:09:50,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 929 transitions. [2021-10-03 12:09:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:50,641 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:50,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:50,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-10-03 12:09:50,642 INFO L402 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1632372254, now seen corresponding path program 168 times [2021-10-03 12:09:50,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:50,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508264055] [2021-10-03 12:09:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:50,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:50,775 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-03 12:09:50,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:50,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508264055] [2021-10-03 12:09:50,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508264055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:50,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:50,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:50,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399802840] [2021-10-03 12:09:50,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:50,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:50,778 INFO L87 Difference]: Start difference. First operand 412 states and 929 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:51,057 INFO L93 Difference]: Finished difference Result 428 states and 953 transitions. [2021-10-03 12:09:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:09:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:51,059 INFO L225 Difference]: With dead ends: 428 [2021-10-03 12:09:51,059 INFO L226 Difference]: Without dead ends: 410 [2021-10-03 12:09:51,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-10-03 12:09:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-10-03 12:09:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.259168704156479) internal successors, (924), 409 states have internal predecessors, (924), 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-03 12:09:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 924 transitions. [2021-10-03 12:09:51,065 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 924 transitions. Word has length 38 [2021-10-03 12:09:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:51,065 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 924 transitions. [2021-10-03 12:09:51,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 924 transitions. [2021-10-03 12:09:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:51,066 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:51,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:51,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-10-03 12:09:51,067 INFO L402 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1344038438, now seen corresponding path program 169 times [2021-10-03 12:09:51,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:51,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476115691] [2021-10-03 12:09:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:51,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:51,204 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-03 12:09:51,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:51,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476115691] [2021-10-03 12:09:51,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476115691] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:51,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:51,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:51,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903740932] [2021-10-03 12:09:51,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:51,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:51,207 INFO L87 Difference]: Start difference. First operand 410 states and 924 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:51,606 INFO L93 Difference]: Finished difference Result 486 states and 1071 transitions. [2021-10-03 12:09:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:51,608 INFO L225 Difference]: With dead ends: 486 [2021-10-03 12:09:51,608 INFO L226 Difference]: Without dead ends: 470 [2021-10-03 12:09:51,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 215.5ms TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-10-03 12:09:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2021-10-03 12:09:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.2481927710843372) internal successors, (933), 415 states have internal predecessors, (933), 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-03 12:09:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 933 transitions. [2021-10-03 12:09:51,614 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 933 transitions. Word has length 38 [2021-10-03 12:09:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:51,614 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 933 transitions. [2021-10-03 12:09:51,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 933 transitions. [2021-10-03 12:09:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:51,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:51,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-10-03 12:09:51,615 INFO L402 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -411431488, now seen corresponding path program 170 times [2021-10-03 12:09:51,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:51,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464843596] [2021-10-03 12:09:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:51,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:51,721 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-03 12:09:51,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:51,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464843596] [2021-10-03 12:09:51,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464843596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:51,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:51,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:51,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780441482] [2021-10-03 12:09:51,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:51,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:51,723 INFO L87 Difference]: Start difference. First operand 416 states and 933 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:52,257 INFO L93 Difference]: Finished difference Result 706 states and 1533 transitions. [2021-10-03 12:09:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:52,259 INFO L225 Difference]: With dead ends: 706 [2021-10-03 12:09:52,259 INFO L226 Difference]: Without dead ends: 674 [2021-10-03 12:09:52,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 224.1ms TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-10-03 12:09:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-10-03 12:09:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 408. [2021-10-03 12:09:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.253071253071253) internal successors, (917), 407 states have internal predecessors, (917), 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-03 12:09:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 917 transitions. [2021-10-03 12:09:52,267 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 917 transitions. Word has length 38 [2021-10-03 12:09:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:52,267 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 917 transitions. [2021-10-03 12:09:52,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 917 transitions. [2021-10-03 12:09:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:52,268 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:52,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-10-03 12:09:52,268 INFO L402 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 785719838, now seen corresponding path program 171 times [2021-10-03 12:09:52,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:52,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608027720] [2021-10-03 12:09:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:52,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:52,377 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-03 12:09:52,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:52,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608027720] [2021-10-03 12:09:52,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608027720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:52,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:52,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:52,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894351773] [2021-10-03 12:09:52,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:52,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:52,379 INFO L87 Difference]: Start difference. First operand 408 states and 917 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:52,641 INFO L93 Difference]: Finished difference Result 470 states and 1035 transitions. [2021-10-03 12:09:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:09:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:52,643 INFO L225 Difference]: With dead ends: 470 [2021-10-03 12:09:52,643 INFO L226 Difference]: Without dead ends: 448 [2021-10-03 12:09:52,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 119.0ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:09:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-03 12:09:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 396. [2021-10-03 12:09:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.250632911392405) internal successors, (889), 395 states have internal predecessors, (889), 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-03 12:09:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 889 transitions. [2021-10-03 12:09:52,648 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 889 transitions. Word has length 38 [2021-10-03 12:09:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:52,648 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 889 transitions. [2021-10-03 12:09:52,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 889 transitions. [2021-10-03 12:09:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:52,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:52,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:52,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-10-03 12:09:52,649 INFO L402 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1138440244, now seen corresponding path program 172 times [2021-10-03 12:09:52,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:52,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49122011] [2021-10-03 12:09:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:52,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:52,744 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-03 12:09:52,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:52,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49122011] [2021-10-03 12:09:52,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49122011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:52,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:52,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:52,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842747408] [2021-10-03 12:09:52,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:52,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:52,746 INFO L87 Difference]: Start difference. First operand 396 states and 889 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:53,142 INFO L93 Difference]: Finished difference Result 610 states and 1366 transitions. [2021-10-03 12:09:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:53,144 INFO L225 Difference]: With dead ends: 610 [2021-10-03 12:09:53,144 INFO L226 Difference]: Without dead ends: 588 [2021-10-03 12:09:53,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 180.7ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-10-03 12:09:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 402. [2021-10-03 12:09:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.2693266832917707) internal successors, (910), 401 states have internal predecessors, (910), 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-03 12:09:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 910 transitions. [2021-10-03 12:09:53,150 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 910 transitions. Word has length 38 [2021-10-03 12:09:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:53,150 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 910 transitions. [2021-10-03 12:09:53,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 910 transitions. [2021-10-03 12:09:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:53,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:53,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:53,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-10-03 12:09:53,151 INFO L402 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 16024798, now seen corresponding path program 173 times [2021-10-03 12:09:53,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:53,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646750577] [2021-10-03 12:09:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:53,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:53,243 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-03 12:09:53,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:53,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646750577] [2021-10-03 12:09:53,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646750577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:53,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:53,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:53,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576151042] [2021-10-03 12:09:53,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:53,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:53,246 INFO L87 Difference]: Start difference. First operand 402 states and 910 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:53,681 INFO L93 Difference]: Finished difference Result 626 states and 1393 transitions. [2021-10-03 12:09:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:53,683 INFO L225 Difference]: With dead ends: 626 [2021-10-03 12:09:53,683 INFO L226 Difference]: Without dead ends: 610 [2021-10-03 12:09:53,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-03 12:09:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 398. [2021-10-03 12:09:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.2670025188916876) internal successors, (900), 397 states have internal predecessors, (900), 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-03 12:09:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 900 transitions. [2021-10-03 12:09:53,689 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 900 transitions. Word has length 38 [2021-10-03 12:09:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:53,689 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 900 transitions. [2021-10-03 12:09:53,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 900 transitions. [2021-10-03 12:09:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:53,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:53,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:53,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-10-03 12:09:53,690 INFO L402 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1997626146, now seen corresponding path program 174 times [2021-10-03 12:09:53,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:53,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088479086] [2021-10-03 12:09:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:53,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:53,786 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-03 12:09:53,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:53,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088479086] [2021-10-03 12:09:53,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088479086] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:53,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:53,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:53,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242322850] [2021-10-03 12:09:53,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:53,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:53,789 INFO L87 Difference]: Start difference. First operand 398 states and 900 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:54,062 INFO L93 Difference]: Finished difference Result 534 states and 1178 transitions. [2021-10-03 12:09:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:54,064 INFO L225 Difference]: With dead ends: 534 [2021-10-03 12:09:54,064 INFO L226 Difference]: Without dead ends: 514 [2021-10-03 12:09:54,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 125.2ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-03 12:09:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2021-10-03 12:09:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.256926952141058) internal successors, (896), 397 states have internal predecessors, (896), 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-03 12:09:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 896 transitions. [2021-10-03 12:09:54,070 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 896 transitions. Word has length 38 [2021-10-03 12:09:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:54,071 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 896 transitions. [2021-10-03 12:09:54,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 896 transitions. [2021-10-03 12:09:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:54,071 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:54,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:54,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-10-03 12:09:54,072 INFO L402 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:54,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2122586868, now seen corresponding path program 175 times [2021-10-03 12:09:54,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:54,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106480024] [2021-10-03 12:09:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:54,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:54,158 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-03 12:09:54,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:54,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106480024] [2021-10-03 12:09:54,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106480024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:54,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:54,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:09:54,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226876076] [2021-10-03 12:09:54,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:09:54,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:09:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:09:54,160 INFO L87 Difference]: Start difference. First operand 398 states and 896 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:54,471 INFO L93 Difference]: Finished difference Result 546 states and 1192 transitions. [2021-10-03 12:09:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:54,472 INFO L225 Difference]: With dead ends: 546 [2021-10-03 12:09:54,473 INFO L226 Difference]: Without dead ends: 514 [2021-10-03 12:09:54,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:09:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-03 12:09:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 370. [2021-10-03 12:09:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.2710027100271004) internal successors, (838), 369 states have internal predecessors, (838), 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-03 12:09:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 838 transitions. [2021-10-03 12:09:54,478 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 838 transitions. Word has length 38 [2021-10-03 12:09:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:54,478 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 838 transitions. [2021-10-03 12:09:54,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:09:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 838 transitions. [2021-10-03 12:09:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:54,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:54,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:54,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-10-03 12:09:54,479 INFO L402 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1215853216, now seen corresponding path program 176 times [2021-10-03 12:09:54,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:54,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501760334] [2021-10-03 12:09:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:54,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:54,599 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-03 12:09:54,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:54,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501760334] [2021-10-03 12:09:54,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501760334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:54,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:54,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:54,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767029791] [2021-10-03 12:09:54,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:54,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:54,601 INFO L87 Difference]: Start difference. First operand 370 states and 838 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:54,925 INFO L93 Difference]: Finished difference Result 400 states and 885 transitions. [2021-10-03 12:09:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:54,926 INFO L225 Difference]: With dead ends: 400 [2021-10-03 12:09:54,926 INFO L226 Difference]: Without dead ends: 372 [2021-10-03 12:09:54,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 198.4ms TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-03 12:09:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2021-10-03 12:09:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.254742547425474) internal successors, (832), 369 states have internal predecessors, (832), 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-03 12:09:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 832 transitions. [2021-10-03 12:09:54,931 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 832 transitions. Word has length 38 [2021-10-03 12:09:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:54,931 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 832 transitions. [2021-10-03 12:09:54,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 832 transitions. [2021-10-03 12:09:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:54,932 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:54,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-10-03 12:09:54,932 INFO L402 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash -530904308, now seen corresponding path program 177 times [2021-10-03 12:09:54,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:54,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217903657] [2021-10-03 12:09:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:54,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:55,037 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-03 12:09:55,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:55,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217903657] [2021-10-03 12:09:55,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217903657] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:55,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:55,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:55,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796130487] [2021-10-03 12:09:55,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:55,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:55,039 INFO L87 Difference]: Start difference. First operand 370 states and 832 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:55,532 INFO L93 Difference]: Finished difference Result 488 states and 1056 transitions. [2021-10-03 12:09:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-03 12:09:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:55,534 INFO L225 Difference]: With dead ends: 488 [2021-10-03 12:09:55,534 INFO L226 Difference]: Without dead ends: 458 [2021-10-03 12:09:55,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 276.6ms TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2021-10-03 12:09:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-10-03 12:09:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 378. [2021-10-03 12:09:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.2387267904509285) internal successors, (844), 377 states have internal predecessors, (844), 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-03 12:09:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 844 transitions. [2021-10-03 12:09:55,539 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 844 transitions. Word has length 38 [2021-10-03 12:09:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:55,539 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 844 transitions. [2021-10-03 12:09:55,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 844 transitions. [2021-10-03 12:09:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:55,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:55,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:55,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-10-03 12:09:55,541 INFO L402 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:55,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1123928840, now seen corresponding path program 178 times [2021-10-03 12:09:55,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:55,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198816110] [2021-10-03 12:09:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:55,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:55,633 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-03 12:09:55,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:55,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198816110] [2021-10-03 12:09:55,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198816110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:55,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:55,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:55,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011867587] [2021-10-03 12:09:55,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:55,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:55,636 INFO L87 Difference]: Start difference. First operand 378 states and 844 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:56,025 INFO L93 Difference]: Finished difference Result 540 states and 1166 transitions. [2021-10-03 12:09:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:56,027 INFO L225 Difference]: With dead ends: 540 [2021-10-03 12:09:56,027 INFO L226 Difference]: Without dead ends: 492 [2021-10-03 12:09:56,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 190.5ms TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-03 12:09:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 364. [2021-10-03 12:09:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.2506887052341598) internal successors, (817), 363 states have internal predecessors, (817), 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-03 12:09:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 817 transitions. [2021-10-03 12:09:56,037 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 817 transitions. Word has length 38 [2021-10-03 12:09:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:56,038 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 817 transitions. [2021-10-03 12:09:56,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 817 transitions. [2021-10-03 12:09:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:56,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:56,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:56,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-10-03 12:09:56,040 INFO L402 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1991501878, now seen corresponding path program 179 times [2021-10-03 12:09:56,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:56,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557643139] [2021-10-03 12:09:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:56,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:56,175 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-03 12:09:56,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:56,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557643139] [2021-10-03 12:09:56,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557643139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:56,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:56,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:56,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170545167] [2021-10-03 12:09:56,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:56,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:56,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:56,178 INFO L87 Difference]: Start difference. First operand 364 states and 817 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:56,463 INFO L93 Difference]: Finished difference Result 402 states and 874 transitions. [2021-10-03 12:09:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:09:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:56,465 INFO L225 Difference]: With dead ends: 402 [2021-10-03 12:09:56,465 INFO L226 Difference]: Without dead ends: 378 [2021-10-03 12:09:56,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:09:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-03 12:09:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 358. [2021-10-03 12:09:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.246498599439776) internal successors, (802), 357 states have internal predecessors, (802), 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-03 12:09:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 802 transitions. [2021-10-03 12:09:56,470 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 802 transitions. Word has length 38 [2021-10-03 12:09:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:56,470 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 802 transitions. [2021-10-03 12:09:56,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 802 transitions. [2021-10-03 12:09:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:56,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:56,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:56,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-10-03 12:09:56,471 INFO L402 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1057727862, now seen corresponding path program 180 times [2021-10-03 12:09:56,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:56,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454282223] [2021-10-03 12:09:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:56,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:56,577 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-03 12:09:56,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:56,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454282223] [2021-10-03 12:09:56,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454282223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:56,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:56,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:56,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937075288] [2021-10-03 12:09:56,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:56,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:56,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:56,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:56,580 INFO L87 Difference]: Start difference. First operand 358 states and 802 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:56,945 INFO L93 Difference]: Finished difference Result 462 states and 993 transitions. [2021-10-03 12:09:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:09:56,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:56,947 INFO L225 Difference]: With dead ends: 462 [2021-10-03 12:09:56,947 INFO L226 Difference]: Without dead ends: 436 [2021-10-03 12:09:56,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 187.4ms TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-03 12:09:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 366. [2021-10-03 12:09:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.23013698630137) internal successors, (814), 365 states have internal predecessors, (814), 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-03 12:09:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 814 transitions. [2021-10-03 12:09:56,952 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 814 transitions. Word has length 38 [2021-10-03 12:09:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:56,952 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 814 transitions. [2021-10-03 12:09:56,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 814 transitions. [2021-10-03 12:09:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:56,953 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:56,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:56,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-10-03 12:09:56,953 INFO L402 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1039509986, now seen corresponding path program 181 times [2021-10-03 12:09:56,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:56,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712803760] [2021-10-03 12:09:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:56,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:57,056 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-03 12:09:57,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:57,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712803760] [2021-10-03 12:09:57,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712803760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:57,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:57,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:57,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095224564] [2021-10-03 12:09:57,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:57,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:57,059 INFO L87 Difference]: Start difference. First operand 366 states and 814 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:57,444 INFO L93 Difference]: Finished difference Result 446 states and 963 transitions. [2021-10-03 12:09:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:57,446 INFO L225 Difference]: With dead ends: 446 [2021-10-03 12:09:57,446 INFO L226 Difference]: Without dead ends: 408 [2021-10-03 12:09:57,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 207.4ms TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:09:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-10-03 12:09:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 352. [2021-10-03 12:09:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.242165242165242) internal successors, (787), 351 states have internal predecessors, (787), 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-03 12:09:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 787 transitions. [2021-10-03 12:09:57,451 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 787 transitions. Word has length 38 [2021-10-03 12:09:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:57,451 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 787 transitions. [2021-10-03 12:09:57,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 787 transitions. [2021-10-03 12:09:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:57,452 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:57,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:57,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-10-03 12:09:57,452 INFO L402 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash -494062880, now seen corresponding path program 182 times [2021-10-03 12:09:57,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:57,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320114390] [2021-10-03 12:09:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:57,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:57,569 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-03 12:09:57,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:57,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320114390] [2021-10-03 12:09:57,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320114390] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:57,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:57,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:57,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5425864] [2021-10-03 12:09:57,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:57,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:57,571 INFO L87 Difference]: Start difference. First operand 352 states and 787 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:58,019 INFO L93 Difference]: Finished difference Result 562 states and 1245 transitions. [2021-10-03 12:09:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:09:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:58,021 INFO L225 Difference]: With dead ends: 562 [2021-10-03 12:09:58,021 INFO L226 Difference]: Without dead ends: 540 [2021-10-03 12:09:58,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 260.1ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-03 12:09:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-10-03 12:09:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2021-10-03 12:09:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.234501347708895) internal successors, (829), 371 states have internal predecessors, (829), 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-03 12:09:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 829 transitions. [2021-10-03 12:09:58,027 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 829 transitions. Word has length 38 [2021-10-03 12:09:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:58,027 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 829 transitions. [2021-10-03 12:09:58,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 829 transitions. [2021-10-03 12:09:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:58,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:58,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:58,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-10-03 12:09:58,028 INFO L402 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1087087412, now seen corresponding path program 183 times [2021-10-03 12:09:58,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:58,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431055571] [2021-10-03 12:09:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:58,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:58,125 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-03 12:09:58,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:58,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431055571] [2021-10-03 12:09:58,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431055571] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:58,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:58,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:09:58,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085320295] [2021-10-03 12:09:58,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:09:58,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:09:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:09:58,127 INFO L87 Difference]: Start difference. First operand 372 states and 829 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:58,551 INFO L93 Difference]: Finished difference Result 628 states and 1370 transitions. [2021-10-03 12:09:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:09:58,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:58,553 INFO L225 Difference]: With dead ends: 628 [2021-10-03 12:09:58,553 INFO L226 Difference]: Without dead ends: 578 [2021-10-03 12:09:58,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:09:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-10-03 12:09:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 358. [2021-10-03 12:09:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.2408963585434174) internal successors, (800), 357 states have internal predecessors, (800), 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-03 12:09:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 800 transitions. [2021-10-03 12:09:58,559 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 800 transitions. Word has length 38 [2021-10-03 12:09:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:58,559 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 800 transitions. [2021-10-03 12:09:58,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:09:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 800 transitions. [2021-10-03 12:09:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:58,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:58,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:58,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-10-03 12:09:58,561 INFO L402 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1552147830, now seen corresponding path program 184 times [2021-10-03 12:09:58,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:58,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760633611] [2021-10-03 12:09:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:58,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:58,684 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-03 12:09:58,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:58,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760633611] [2021-10-03 12:09:58,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760633611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:58,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:58,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:58,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726794107] [2021-10-03 12:09:58,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:58,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:58,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:58,687 INFO L87 Difference]: Start difference. First operand 358 states and 800 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:59,047 INFO L93 Difference]: Finished difference Result 432 states and 942 transitions. [2021-10-03 12:09:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:09:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:59,048 INFO L225 Difference]: With dead ends: 432 [2021-10-03 12:09:59,049 INFO L226 Difference]: Without dead ends: 414 [2021-10-03 12:09:59,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 203.2ms TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:09:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-10-03 12:09:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 360. [2021-10-03 12:09:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.2367688022284122) internal successors, (803), 359 states have internal predecessors, (803), 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-03 12:09:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 803 transitions. [2021-10-03 12:09:59,054 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 803 transitions. Word has length 38 [2021-10-03 12:09:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:59,054 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 803 transitions. [2021-10-03 12:09:59,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 803 transitions. [2021-10-03 12:09:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:59,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:59,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:59,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-10-03 12:09:59,055 INFO L402 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 478930592, now seen corresponding path program 185 times [2021-10-03 12:09:59,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:59,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547571015] [2021-10-03 12:09:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:59,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:59,195 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-03 12:09:59,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:59,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547571015] [2021-10-03 12:09:59,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547571015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:59,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:59,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:59,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058309927] [2021-10-03 12:09:59,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:59,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:59,197 INFO L87 Difference]: Start difference. First operand 360 states and 803 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:09:59,581 INFO L93 Difference]: Finished difference Result 470 states and 1025 transitions. [2021-10-03 12:09:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:09:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:09:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:09:59,582 INFO L225 Difference]: With dead ends: 470 [2021-10-03 12:09:59,583 INFO L226 Difference]: Without dead ends: 454 [2021-10-03 12:09:59,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 210.3ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:09:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-10-03 12:09:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 366. [2021-10-03 12:09:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.2246575342465755) internal successors, (812), 365 states have internal predecessors, (812), 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-03 12:09:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 812 transitions. [2021-10-03 12:09:59,587 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 812 transitions. Word has length 38 [2021-10-03 12:09:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:09:59,587 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 812 transitions. [2021-10-03 12:09:59,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:09:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 812 transitions. [2021-10-03 12:09:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:09:59,588 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:09:59,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:09:59,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-10-03 12:09:59,589 INFO L402 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:09:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:09:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1570365706, now seen corresponding path program 186 times [2021-10-03 12:09:59,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:09:59,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120784376] [2021-10-03 12:09:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:09:59,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:09:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:09:59,714 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-03 12:09:59,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:09:59,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120784376] [2021-10-03 12:09:59,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120784376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:09:59,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:09:59,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:09:59,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573716056] [2021-10-03 12:09:59,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:09:59,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:09:59,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:09:59,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:09:59,716 INFO L87 Difference]: Start difference. First operand 366 states and 812 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:00,123 INFO L93 Difference]: Finished difference Result 438 states and 959 transitions. [2021-10-03 12:10:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:00,125 INFO L225 Difference]: With dead ends: 438 [2021-10-03 12:10:00,125 INFO L226 Difference]: Without dead ends: 428 [2021-10-03 12:10:00,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 224.1ms TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:10:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-03 12:10:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 368. [2021-10-03 12:10:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.220708446866485) internal successors, (815), 367 states have internal predecessors, (815), 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-03 12:10:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 815 transitions. [2021-10-03 12:10:00,130 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 815 transitions. Word has length 38 [2021-10-03 12:10:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:00,130 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 815 transitions. [2021-10-03 12:10:00,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 815 transitions. [2021-10-03 12:10:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:00,131 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:00,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:00,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-10-03 12:10:00,131 INFO L402 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 477425842, now seen corresponding path program 187 times [2021-10-03 12:10:00,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:00,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529978348] [2021-10-03 12:10:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:00,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:00,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-03 12:10:00,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:00,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529978348] [2021-10-03 12:10:00,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529978348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:00,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:00,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:00,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268529704] [2021-10-03 12:10:00,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:00,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:00,262 INFO L87 Difference]: Start difference. First operand 368 states and 815 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:00,678 INFO L93 Difference]: Finished difference Result 560 states and 1224 transitions. [2021-10-03 12:10:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:00,679 INFO L225 Difference]: With dead ends: 560 [2021-10-03 12:10:00,679 INFO L226 Difference]: Without dead ends: 538 [2021-10-03 12:10:00,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 216.2ms TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:10:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-03 12:10:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 358. [2021-10-03 12:10:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.235294117647059) internal successors, (798), 357 states have internal predecessors, (798), 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-03 12:10:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 798 transitions. [2021-10-03 12:10:00,685 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 798 transitions. Word has length 38 [2021-10-03 12:10:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:00,685 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 798 transitions. [2021-10-03 12:10:00,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 798 transitions. [2021-10-03 12:10:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:00,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:00,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:00,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-10-03 12:10:00,686 INFO L402 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 605727114, now seen corresponding path program 188 times [2021-10-03 12:10:00,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:00,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657068167] [2021-10-03 12:10:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:00,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:00,777 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-03 12:10:00,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:00,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657068167] [2021-10-03 12:10:00,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657068167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:00,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:00,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:00,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99700149] [2021-10-03 12:10:00,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:00,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:00,780 INFO L87 Difference]: Start difference. First operand 358 states and 798 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:01,103 INFO L93 Difference]: Finished difference Result 498 states and 1086 transitions. [2021-10-03 12:10:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:10:01,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:01,105 INFO L225 Difference]: With dead ends: 498 [2021-10-03 12:10:01,105 INFO L226 Difference]: Without dead ends: 482 [2021-10-03 12:10:01,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 148.1ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-10-03 12:10:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 364. [2021-10-03 12:10:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.2231404958677685) internal successors, (807), 363 states have internal predecessors, (807), 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-03 12:10:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 807 transitions. [2021-10-03 12:10:01,110 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 807 transitions. Word has length 38 [2021-10-03 12:10:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:01,110 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 807 transitions. [2021-10-03 12:10:01,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 807 transitions. [2021-10-03 12:10:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:01,111 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:01,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:01,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-10-03 12:10:01,112 INFO L402 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -874561944, now seen corresponding path program 189 times [2021-10-03 12:10:01,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:01,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456263816] [2021-10-03 12:10:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:01,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:01,235 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-03 12:10:01,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:01,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456263816] [2021-10-03 12:10:01,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456263816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:01,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:01,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:01,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383112196] [2021-10-03 12:10:01,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:01,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:01,239 INFO L87 Difference]: Start difference. First operand 364 states and 807 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:01,594 INFO L93 Difference]: Finished difference Result 484 states and 1059 transitions. [2021-10-03 12:10:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:10:01,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:01,596 INFO L225 Difference]: With dead ends: 484 [2021-10-03 12:10:01,596 INFO L226 Difference]: Without dead ends: 466 [2021-10-03 12:10:01,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-10-03 12:10:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 358. [2021-10-03 12:10:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.2184873949579833) internal successors, (792), 357 states have internal predecessors, (792), 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-03 12:10:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 792 transitions. [2021-10-03 12:10:01,601 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 792 transitions. Word has length 38 [2021-10-03 12:10:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:01,601 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 792 transitions. [2021-10-03 12:10:01,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 792 transitions. [2021-10-03 12:10:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:01,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:01,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:01,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-10-03 12:10:01,602 INFO L402 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1651841568, now seen corresponding path program 190 times [2021-10-03 12:10:01,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:01,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252845795] [2021-10-03 12:10:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:01,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:01,707 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-03 12:10:01,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:01,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252845795] [2021-10-03 12:10:01,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252845795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:01,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:01,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:01,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055236586] [2021-10-03 12:10:01,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:01,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:01,709 INFO L87 Difference]: Start difference. First operand 358 states and 792 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:02,049 INFO L93 Difference]: Finished difference Result 496 states and 1089 transitions. [2021-10-03 12:10:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:02,051 INFO L225 Difference]: With dead ends: 496 [2021-10-03 12:10:02,051 INFO L226 Difference]: Without dead ends: 480 [2021-10-03 12:10:02,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 185.7ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-03 12:10:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 360. [2021-10-03 12:10:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.214484679665738) internal successors, (795), 359 states have internal predecessors, (795), 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-03 12:10:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 795 transitions. [2021-10-03 12:10:02,056 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 795 transitions. Word has length 38 [2021-10-03 12:10:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:02,057 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 795 transitions. [2021-10-03 12:10:02,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 795 transitions. [2021-10-03 12:10:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:02,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:02,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:02,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-10-03 12:10:02,058 INFO L402 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1520710282, now seen corresponding path program 191 times [2021-10-03 12:10:02,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:02,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380000275] [2021-10-03 12:10:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:02,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:02,160 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-03 12:10:02,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:02,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380000275] [2021-10-03 12:10:02,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380000275] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:02,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:02,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:02,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849357648] [2021-10-03 12:10:02,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:02,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:02,163 INFO L87 Difference]: Start difference. First operand 360 states and 795 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:02,490 INFO L93 Difference]: Finished difference Result 472 states and 1033 transitions. [2021-10-03 12:10:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:02,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:02,492 INFO L225 Difference]: With dead ends: 472 [2021-10-03 12:10:02,492 INFO L226 Difference]: Without dead ends: 444 [2021-10-03 12:10:02,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 181.5ms TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-03 12:10:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 344. [2021-10-03 12:10:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.2303206997084546) internal successors, (765), 343 states have internal predecessors, (765), 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-03 12:10:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 765 transitions. [2021-10-03 12:10:02,499 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 765 transitions. Word has length 38 [2021-10-03 12:10:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:02,499 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 765 transitions. [2021-10-03 12:10:02,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 765 transitions. [2021-10-03 12:10:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:02,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:02,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:02,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-10-03 12:10:02,501 INFO L402 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:02,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash 936810114, now seen corresponding path program 192 times [2021-10-03 12:10:02,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:02,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198186898] [2021-10-03 12:10:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:02,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:02,597 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-03 12:10:02,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:02,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198186898] [2021-10-03 12:10:02,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198186898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:02,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:02,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:02,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440591612] [2021-10-03 12:10:02,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:02,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:02,600 INFO L87 Difference]: Start difference. First operand 344 states and 765 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:02,891 INFO L93 Difference]: Finished difference Result 368 states and 799 transitions. [2021-10-03 12:10:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:02,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:02,893 INFO L225 Difference]: With dead ends: 368 [2021-10-03 12:10:02,893 INFO L226 Difference]: Without dead ends: 346 [2021-10-03 12:10:02,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 175.9ms TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-10-03 12:10:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2021-10-03 12:10:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.2128279883381925) internal successors, (759), 343 states have internal predecessors, (759), 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-03 12:10:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 759 transitions. [2021-10-03 12:10:02,898 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 759 transitions. Word has length 38 [2021-10-03 12:10:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:02,898 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 759 transitions. [2021-10-03 12:10:02,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 759 transitions. [2021-10-03 12:10:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:02,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:02,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:02,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-10-03 12:10:02,899 INFO L402 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash -573960658, now seen corresponding path program 193 times [2021-10-03 12:10:02,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:02,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099344014] [2021-10-03 12:10:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:02,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:03,000 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-03 12:10:03,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:03,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099344014] [2021-10-03 12:10:03,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099344014] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:03,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:03,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:03,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014444576] [2021-10-03 12:10:03,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:03,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:03,004 INFO L87 Difference]: Start difference. First operand 344 states and 759 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:03,388 INFO L93 Difference]: Finished difference Result 418 states and 893 transitions. [2021-10-03 12:10:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:10:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:03,389 INFO L225 Difference]: With dead ends: 418 [2021-10-03 12:10:03,390 INFO L226 Difference]: Without dead ends: 394 [2021-10-03 12:10:03,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 227.2ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:10:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-03 12:10:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 360. [2021-10-03 12:10:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.1922005571030643) internal successors, (787), 359 states have internal predecessors, (787), 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-03 12:10:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 787 transitions. [2021-10-03 12:10:03,394 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 787 transitions. Word has length 38 [2021-10-03 12:10:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:03,394 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 787 transitions. [2021-10-03 12:10:03,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 787 transitions. [2021-10-03 12:10:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:03,395 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:03,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:03,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-10-03 12:10:03,396 INFO L402 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1908309166, now seen corresponding path program 194 times [2021-10-03 12:10:03,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:03,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041655149] [2021-10-03 12:10:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:03,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:03,477 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-03 12:10:03,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:03,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041655149] [2021-10-03 12:10:03,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041655149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:03,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:03,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:10:03,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988756507] [2021-10-03 12:10:03,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:10:03,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:10:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:10:03,479 INFO L87 Difference]: Start difference. First operand 360 states and 787 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:10:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:03,795 INFO L93 Difference]: Finished difference Result 464 states and 993 transitions. [2021-10-03 12:10:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:10:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:03,797 INFO L225 Difference]: With dead ends: 464 [2021-10-03 12:10:03,797 INFO L226 Difference]: Without dead ends: 446 [2021-10-03 12:10:03,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 166.6ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-03 12:10:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 360. [2021-10-03 12:10:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.1922005571030643) internal successors, (787), 359 states have internal predecessors, (787), 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-03 12:10:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 787 transitions. [2021-10-03 12:10:03,801 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 787 transitions. Word has length 38 [2021-10-03 12:10:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:03,802 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 787 transitions. [2021-10-03 12:10:03,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:10:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 787 transitions. [2021-10-03 12:10:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:03,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:03,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:03,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-10-03 12:10:03,803 INFO L402 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 35271900, now seen corresponding path program 195 times [2021-10-03 12:10:03,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:03,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275858198] [2021-10-03 12:10:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:03,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:03,895 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-03 12:10:03,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:03,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275858198] [2021-10-03 12:10:03,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275858198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:03,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:03,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:03,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871299727] [2021-10-03 12:10:03,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:03,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:03,897 INFO L87 Difference]: Start difference. First operand 360 states and 787 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:04,275 INFO L93 Difference]: Finished difference Result 452 states and 966 transitions. [2021-10-03 12:10:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:10:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:04,277 INFO L225 Difference]: With dead ends: 452 [2021-10-03 12:10:04,277 INFO L226 Difference]: Without dead ends: 412 [2021-10-03 12:10:04,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 180.6ms TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-03 12:10:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 332. [2021-10-03 12:10:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.193353474320242) internal successors, (726), 331 states have internal predecessors, (726), 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-03 12:10:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 726 transitions. [2021-10-03 12:10:04,282 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 726 transitions. Word has length 38 [2021-10-03 12:10:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:04,282 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 726 transitions. [2021-10-03 12:10:04,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 726 transitions. [2021-10-03 12:10:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:04,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:04,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:04,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-10-03 12:10:04,283 INFO L402 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -633369806, now seen corresponding path program 196 times [2021-10-03 12:10:04,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:04,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119718305] [2021-10-03 12:10:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:04,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:04,381 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-03 12:10:04,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:04,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119718305] [2021-10-03 12:10:04,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119718305] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:04,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:04,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:04,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108881717] [2021-10-03 12:10:04,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:04,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:04,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:04,384 INFO L87 Difference]: Start difference. First operand 332 states and 726 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:04,630 INFO L93 Difference]: Finished difference Result 354 states and 759 transitions. [2021-10-03 12:10:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:04,632 INFO L225 Difference]: With dead ends: 354 [2021-10-03 12:10:04,633 INFO L226 Difference]: Without dead ends: 330 [2021-10-03 12:10:04,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 136.1ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-03 12:10:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2021-10-03 12:10:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.187692307692308) internal successors, (711), 325 states have internal predecessors, (711), 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-03 12:10:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 711 transitions. [2021-10-03 12:10:04,638 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 711 transitions. Word has length 38 [2021-10-03 12:10:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:04,638 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 711 transitions. [2021-10-03 12:10:04,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 711 transitions. [2021-10-03 12:10:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:04,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:04,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:04,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-10-03 12:10:04,639 INFO L402 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1879107362, now seen corresponding path program 197 times [2021-10-03 12:10:04,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:04,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824225293] [2021-10-03 12:10:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:04,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:04,744 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-03 12:10:04,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:04,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824225293] [2021-10-03 12:10:04,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824225293] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:04,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:04,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:04,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978127258] [2021-10-03 12:10:04,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:04,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:04,747 INFO L87 Difference]: Start difference. First operand 326 states and 711 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:05,054 INFO L93 Difference]: Finished difference Result 364 states and 778 transitions. [2021-10-03 12:10:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:05,055 INFO L225 Difference]: With dead ends: 364 [2021-10-03 12:10:05,056 INFO L226 Difference]: Without dead ends: 338 [2021-10-03 12:10:05,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:10:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-03 12:10:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2021-10-03 12:10:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.171171171171171) internal successors, (723), 333 states have internal predecessors, (723), 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-03 12:10:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 723 transitions. [2021-10-03 12:10:05,061 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 723 transitions. Word has length 38 [2021-10-03 12:10:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:05,061 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 723 transitions. [2021-10-03 12:10:05,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 723 transitions. [2021-10-03 12:10:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:05,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:05,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:05,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-10-03 12:10:05,062 INFO L402 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash 695200652, now seen corresponding path program 198 times [2021-10-03 12:10:05,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:05,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347506335] [2021-10-03 12:10:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:05,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:05,171 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-03 12:10:05,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:05,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347506335] [2021-10-03 12:10:05,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347506335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:05,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:05,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:05,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056186352] [2021-10-03 12:10:05,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:05,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:05,173 INFO L87 Difference]: Start difference. First operand 334 states and 723 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:05,479 INFO L93 Difference]: Finished difference Result 358 states and 763 transitions. [2021-10-03 12:10:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:05,481 INFO L225 Difference]: With dead ends: 358 [2021-10-03 12:10:05,481 INFO L226 Difference]: Without dead ends: 320 [2021-10-03 12:10:05,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 175.1ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-10-03 12:10:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2021-10-03 12:10:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.1818181818181817) internal successors, (696), 319 states have internal predecessors, (696), 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-03 12:10:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 696 transitions. [2021-10-03 12:10:05,486 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 696 transitions. Word has length 38 [2021-10-03 12:10:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:05,486 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 696 transitions. [2021-10-03 12:10:05,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 696 transitions. [2021-10-03 12:10:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:05,487 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:05,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:05,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-10-03 12:10:05,487 INFO L402 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -537119230, now seen corresponding path program 199 times [2021-10-03 12:10:05,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:05,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739376444] [2021-10-03 12:10:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:05,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:05,574 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-03 12:10:05,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:05,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739376444] [2021-10-03 12:10:05,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739376444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:05,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:05,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:05,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457301837] [2021-10-03 12:10:05,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:05,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:05,576 INFO L87 Difference]: Start difference. First operand 320 states and 696 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:05,923 INFO L93 Difference]: Finished difference Result 430 states and 929 transitions. [2021-10-03 12:10:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:10:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:05,924 INFO L225 Difference]: With dead ends: 430 [2021-10-03 12:10:05,924 INFO L226 Difference]: Without dead ends: 414 [2021-10-03 12:10:05,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-10-03 12:10:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 364. [2021-10-03 12:10:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.1955922865013773) internal successors, (797), 363 states have internal predecessors, (797), 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-03 12:10:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 797 transitions. [2021-10-03 12:10:05,929 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 797 transitions. Word has length 38 [2021-10-03 12:10:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:05,929 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 797 transitions. [2021-10-03 12:10:05,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 797 transitions. [2021-10-03 12:10:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:05,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:05,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:05,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-10-03 12:10:05,933 INFO L402 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1945150594, now seen corresponding path program 200 times [2021-10-03 12:10:05,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:05,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67730237] [2021-10-03 12:10:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:05,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:06,017 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-03 12:10:06,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:06,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67730237] [2021-10-03 12:10:06,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67730237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:06,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:06,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:10:06,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51520732] [2021-10-03 12:10:06,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:10:06,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:10:06,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:10:06,019 INFO L87 Difference]: Start difference. First operand 364 states and 797 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:10:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:06,315 INFO L93 Difference]: Finished difference Result 490 states and 1043 transitions. [2021-10-03 12:10:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:06,316 INFO L225 Difference]: With dead ends: 490 [2021-10-03 12:10:06,316 INFO L226 Difference]: Without dead ends: 472 [2021-10-03 12:10:06,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 145.0ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-03 12:10:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 352. [2021-10-03 12:10:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.2108262108262107) internal successors, (776), 351 states have internal predecessors, (776), 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-03 12:10:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 776 transitions. [2021-10-03 12:10:06,322 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 776 transitions. Word has length 38 [2021-10-03 12:10:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:06,322 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 776 transitions. [2021-10-03 12:10:06,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-03 12:10:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 776 transitions. [2021-10-03 12:10:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:06,323 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:06,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:06,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-10-03 12:10:06,324 INFO L402 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash 72113328, now seen corresponding path program 201 times [2021-10-03 12:10:06,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:06,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784862085] [2021-10-03 12:10:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:06,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:06,418 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-03 12:10:06,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:06,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784862085] [2021-10-03 12:10:06,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784862085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:06,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:06,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:06,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804263454] [2021-10-03 12:10:06,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:06,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:06,420 INFO L87 Difference]: Start difference. First operand 352 states and 776 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:06,790 INFO L93 Difference]: Finished difference Result 464 states and 993 transitions. [2021-10-03 12:10:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:06,791 INFO L225 Difference]: With dead ends: 464 [2021-10-03 12:10:06,792 INFO L226 Difference]: Without dead ends: 436 [2021-10-03 12:10:06,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 179.7ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-10-03 12:10:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 336. [2021-10-03 12:10:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.1850746268656716) internal successors, (732), 335 states have internal predecessors, (732), 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-03 12:10:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 732 transitions. [2021-10-03 12:10:06,796 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 732 transitions. Word has length 38 [2021-10-03 12:10:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:06,797 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 732 transitions. [2021-10-03 12:10:06,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 732 transitions. [2021-10-03 12:10:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:06,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:06,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:06,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-10-03 12:10:06,798 INFO L402 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1468361038, now seen corresponding path program 202 times [2021-10-03 12:10:06,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:06,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638305862] [2021-10-03 12:10:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:06,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:06,912 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-03 12:10:06,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:06,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638305862] [2021-10-03 12:10:06,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638305862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:06,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:06,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:06,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067716024] [2021-10-03 12:10:06,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:06,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:06,914 INFO L87 Difference]: Start difference. First operand 336 states and 732 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:07,224 INFO L93 Difference]: Finished difference Result 384 states and 822 transitions. [2021-10-03 12:10:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:07,225 INFO L225 Difference]: With dead ends: 384 [2021-10-03 12:10:07,225 INFO L226 Difference]: Without dead ends: 366 [2021-10-03 12:10:07,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 195.1ms TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-03 12:10:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2021-10-03 12:10:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.157593123209169) internal successors, (753), 349 states have internal predecessors, (753), 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-03 12:10:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 753 transitions. [2021-10-03 12:10:07,230 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 753 transitions. Word has length 38 [2021-10-03 12:10:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:07,230 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 753 transitions. [2021-10-03 12:10:07,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 753 transitions. [2021-10-03 12:10:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:07,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:07,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:07,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-10-03 12:10:07,231 INFO L402 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1105946976, now seen corresponding path program 203 times [2021-10-03 12:10:07,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:07,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872370952] [2021-10-03 12:10:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:07,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:07,328 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-03 12:10:07,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:07,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872370952] [2021-10-03 12:10:07,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872370952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:07,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:07,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:07,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004506889] [2021-10-03 12:10:07,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:07,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:07,330 INFO L87 Difference]: Start difference. First operand 350 states and 753 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:07,642 INFO L93 Difference]: Finished difference Result 388 states and 816 transitions. [2021-10-03 12:10:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:07,644 INFO L225 Difference]: With dead ends: 388 [2021-10-03 12:10:07,644 INFO L226 Difference]: Without dead ends: 348 [2021-10-03 12:10:07,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-10-03 12:10:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 336. [2021-10-03 12:10:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.1611940298507464) internal successors, (724), 335 states have internal predecessors, (724), 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-03 12:10:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 724 transitions. [2021-10-03 12:10:07,649 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 724 transitions. Word has length 38 [2021-10-03 12:10:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:07,649 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 724 transitions. [2021-10-03 12:10:07,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 724 transitions. [2021-10-03 12:10:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:07,650 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:07,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:07,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-10-03 12:10:07,650 INFO L402 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1728716862, now seen corresponding path program 204 times [2021-10-03 12:10:07,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:07,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120964297] [2021-10-03 12:10:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:07,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:07,744 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-03 12:10:07,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:07,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120964297] [2021-10-03 12:10:07,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120964297] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:07,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:07,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:07,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754235431] [2021-10-03 12:10:07,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:07,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:07,747 INFO L87 Difference]: Start difference. First operand 336 states and 724 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:08,005 INFO L93 Difference]: Finished difference Result 380 states and 806 transitions. [2021-10-03 12:10:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:08,006 INFO L225 Difference]: With dead ends: 380 [2021-10-03 12:10:08,006 INFO L226 Difference]: Without dead ends: 368 [2021-10-03 12:10:08,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 146.5ms TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-03 12:10:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 340. [2021-10-03 12:10:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.150442477876106) internal successors, (729), 339 states have internal predecessors, (729), 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-03 12:10:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 729 transitions. [2021-10-03 12:10:08,011 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 729 transitions. Word has length 38 [2021-10-03 12:10:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:08,011 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 729 transitions. [2021-10-03 12:10:08,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 729 transitions. [2021-10-03 12:10:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:08,012 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:08,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:08,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-10-03 12:10:08,012 INFO L402 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1482680206, now seen corresponding path program 205 times [2021-10-03 12:10:08,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:08,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158431431] [2021-10-03 12:10:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:08,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:08,105 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-03 12:10:08,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:08,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158431431] [2021-10-03 12:10:08,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158431431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:08,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:08,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:08,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615259443] [2021-10-03 12:10:08,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:08,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:08,107 INFO L87 Difference]: Start difference. First operand 340 states and 729 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:08,350 INFO L93 Difference]: Finished difference Result 352 states and 747 transitions. [2021-10-03 12:10:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:08,352 INFO L225 Difference]: With dead ends: 352 [2021-10-03 12:10:08,352 INFO L226 Difference]: Without dead ends: 308 [2021-10-03 12:10:08,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 147.8ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-03 12:10:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-10-03 12:10:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.1596091205211727) internal successors, (663), 307 states have internal predecessors, (663), 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-03 12:10:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 663 transitions. [2021-10-03 12:10:08,356 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 663 transitions. Word has length 38 [2021-10-03 12:10:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:08,356 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 663 transitions. [2021-10-03 12:10:08,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 663 transitions. [2021-10-03 12:10:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:08,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:08,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:08,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-10-03 12:10:08,357 INFO L402 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -645828724, now seen corresponding path program 206 times [2021-10-03 12:10:08,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:08,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283895145] [2021-10-03 12:10:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:08,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:08,469 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-03 12:10:08,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:08,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283895145] [2021-10-03 12:10:08,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283895145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:08,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:08,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:08,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285033642] [2021-10-03 12:10:08,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:08,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:08,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:08,471 INFO L87 Difference]: Start difference. First operand 308 states and 663 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:08,771 INFO L93 Difference]: Finished difference Result 410 states and 868 transitions. [2021-10-03 12:10:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:10:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:08,773 INFO L225 Difference]: With dead ends: 410 [2021-10-03 12:10:08,773 INFO L226 Difference]: Without dead ends: 388 [2021-10-03 12:10:08,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:10:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-03 12:10:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 308. [2021-10-03 12:10:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.1530944625407167) internal successors, (661), 307 states have internal predecessors, (661), 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-03 12:10:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 661 transitions. [2021-10-03 12:10:08,777 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 661 transitions. Word has length 38 [2021-10-03 12:10:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:08,777 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 661 transitions. [2021-10-03 12:10:08,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 661 transitions. [2021-10-03 12:10:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:08,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:08,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:08,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-10-03 12:10:08,778 INFO L402 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1316120102, now seen corresponding path program 207 times [2021-10-03 12:10:08,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:08,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134601418] [2021-10-03 12:10:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:08,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:08,888 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-03 12:10:08,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:08,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134601418] [2021-10-03 12:10:08,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134601418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:08,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:08,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:08,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876997244] [2021-10-03 12:10:08,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:08,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:08,892 INFO L87 Difference]: Start difference. First operand 308 states and 661 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:09,266 INFO L93 Difference]: Finished difference Result 410 states and 866 transitions. [2021-10-03 12:10:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:10:09,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:09,268 INFO L225 Difference]: With dead ends: 410 [2021-10-03 12:10:09,268 INFO L226 Difference]: Without dead ends: 390 [2021-10-03 12:10:09,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 206.0ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:10:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-03 12:10:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 314. [2021-10-03 12:10:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.121405750798722) internal successors, (664), 313 states have internal predecessors, (664), 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-03 12:10:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 664 transitions. [2021-10-03 12:10:09,272 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 664 transitions. Word has length 38 [2021-10-03 12:10:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:09,273 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 664 transitions. [2021-10-03 12:10:09,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 664 transitions. [2021-10-03 12:10:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:09,273 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:09,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:09,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-10-03 12:10:09,274 INFO L402 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1238853256, now seen corresponding path program 208 times [2021-10-03 12:10:09,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:09,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688600414] [2021-10-03 12:10:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:09,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:09,378 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-03 12:10:09,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:09,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688600414] [2021-10-03 12:10:09,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688600414] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:09,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:09,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:09,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745456490] [2021-10-03 12:10:09,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:09,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:09,380 INFO L87 Difference]: Start difference. First operand 314 states and 664 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:09,757 INFO L93 Difference]: Finished difference Result 474 states and 988 transitions. [2021-10-03 12:10:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:10:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:09,760 INFO L225 Difference]: With dead ends: 474 [2021-10-03 12:10:09,760 INFO L226 Difference]: Without dead ends: 424 [2021-10-03 12:10:09,760 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 196.0ms TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2021-10-03 12:10:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-10-03 12:10:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 298. [2021-10-03 12:10:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.121212121212121) internal successors, (630), 297 states have internal predecessors, (630), 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-03 12:10:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 630 transitions. [2021-10-03 12:10:09,766 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 630 transitions. Word has length 38 [2021-10-03 12:10:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:09,766 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 630 transitions. [2021-10-03 12:10:09,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 630 transitions. [2021-10-03 12:10:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:09,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:09,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:09,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-10-03 12:10:09,767 INFO L402 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1703913674, now seen corresponding path program 209 times [2021-10-03 12:10:09,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:09,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668161267] [2021-10-03 12:10:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:09,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:09,908 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-03 12:10:09,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:09,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668161267] [2021-10-03 12:10:09,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668161267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:09,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:09,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:09,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476043564] [2021-10-03 12:10:09,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:09,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:09,910 INFO L87 Difference]: Start difference. First operand 298 states and 630 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:10,193 INFO L93 Difference]: Finished difference Result 332 states and 681 transitions. [2021-10-03 12:10:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:10,194 INFO L225 Difference]: With dead ends: 332 [2021-10-03 12:10:10,195 INFO L226 Difference]: Without dead ends: 314 [2021-10-03 12:10:10,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 172.2ms TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-03 12:10:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 296. [2021-10-03 12:10:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.1186440677966103) internal successors, (625), 295 states have internal predecessors, (625), 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-03 12:10:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 625 transitions. [2021-10-03 12:10:10,200 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 625 transitions. Word has length 38 [2021-10-03 12:10:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:10,201 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 625 transitions. [2021-10-03 12:10:10,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 625 transitions. [2021-10-03 12:10:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:10,202 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:10,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:10,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-10-03 12:10:10,202 INFO L402 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash 327164748, now seen corresponding path program 210 times [2021-10-03 12:10:10,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:10,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801168276] [2021-10-03 12:10:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:10,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:10,353 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-03 12:10:10,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:10,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801168276] [2021-10-03 12:10:10,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801168276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:10,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:10,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:10,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080869195] [2021-10-03 12:10:10,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:10,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:10,355 INFO L87 Difference]: Start difference. First operand 296 states and 625 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:10,692 INFO L93 Difference]: Finished difference Result 330 states and 676 transitions. [2021-10-03 12:10:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:10,693 INFO L225 Difference]: With dead ends: 330 [2021-10-03 12:10:10,693 INFO L226 Difference]: Without dead ends: 314 [2021-10-03 12:10:10,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 195.5ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-03 12:10:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 296. [2021-10-03 12:10:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.0983050847457627) internal successors, (619), 295 states have internal predecessors, (619), 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-03 12:10:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 619 transitions. [2021-10-03 12:10:10,697 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 619 transitions. Word has length 38 [2021-10-03 12:10:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:10,697 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 619 transitions. [2021-10-03 12:10:10,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 619 transitions. [2021-10-03 12:10:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:10,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:10,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:10,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-10-03 12:10:10,698 INFO L402 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1722131550, now seen corresponding path program 211 times [2021-10-03 12:10:10,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:10,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137822316] [2021-10-03 12:10:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:10,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:10,823 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-03 12:10:10,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:10,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137822316] [2021-10-03 12:10:10,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137822316] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:10,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:10,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:10,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330258836] [2021-10-03 12:10:10,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:10,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:10,825 INFO L87 Difference]: Start difference. First operand 296 states and 619 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:11,138 INFO L93 Difference]: Finished difference Result 322 states and 658 transitions. [2021-10-03 12:10:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:11,139 INFO L225 Difference]: With dead ends: 322 [2021-10-03 12:10:11,139 INFO L226 Difference]: Without dead ends: 312 [2021-10-03 12:10:11,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 189.0ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-10-03 12:10:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 296. [2021-10-03 12:10:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.0915254237288137) internal successors, (617), 295 states have internal predecessors, (617), 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-03 12:10:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 617 transitions. [2021-10-03 12:10:11,143 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 617 transitions. Word has length 38 [2021-10-03 12:10:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:11,143 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 617 transitions. [2021-10-03 12:10:11,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 617 transitions. [2021-10-03 12:10:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:11,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:11,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:11,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-10-03 12:10:11,144 INFO L402 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 325659998, now seen corresponding path program 212 times [2021-10-03 12:10:11,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:11,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194881334] [2021-10-03 12:10:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:11,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:11,272 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-03 12:10:11,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:11,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194881334] [2021-10-03 12:10:11,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194881334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:11,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:11,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:11,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727472346] [2021-10-03 12:10:11,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:11,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:11,275 INFO L87 Difference]: Start difference. First operand 296 states and 617 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:11,566 INFO L93 Difference]: Finished difference Result 406 states and 842 transitions. [2021-10-03 12:10:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:11,568 INFO L225 Difference]: With dead ends: 406 [2021-10-03 12:10:11,568 INFO L226 Difference]: Without dead ends: 384 [2021-10-03 12:10:11,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 186.3ms TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-10-03 12:10:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 282. [2021-10-03 12:10:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.106761565836299) internal successors, (592), 281 states have internal predecessors, (592), 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-03 12:10:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 592 transitions. [2021-10-03 12:10:11,572 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 592 transitions. Word has length 38 [2021-10-03 12:10:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:11,572 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 592 transitions. [2021-10-03 12:10:11,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 592 transitions. [2021-10-03 12:10:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:11,573 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:11,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:11,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-10-03 12:10:11,573 INFO L402 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 453961270, now seen corresponding path program 213 times [2021-10-03 12:10:11,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:11,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400715652] [2021-10-03 12:10:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:11,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:11,665 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-03 12:10:11,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:11,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400715652] [2021-10-03 12:10:11,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400715652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:11,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:11,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:11,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040799735] [2021-10-03 12:10:11,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:11,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:11,667 INFO L87 Difference]: Start difference. First operand 282 states and 592 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:11,937 INFO L93 Difference]: Finished difference Result 384 states and 789 transitions. [2021-10-03 12:10:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:11,938 INFO L225 Difference]: With dead ends: 384 [2021-10-03 12:10:11,939 INFO L226 Difference]: Without dead ends: 368 [2021-10-03 12:10:11,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 137.1ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-03 12:10:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 288. [2021-10-03 12:10:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.0940766550522647) internal successors, (601), 287 states have internal predecessors, (601), 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-03 12:10:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 601 transitions. [2021-10-03 12:10:11,943 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 601 transitions. Word has length 38 [2021-10-03 12:10:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:11,943 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 601 transitions. [2021-10-03 12:10:11,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 601 transitions. [2021-10-03 12:10:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:11,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:11,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:11,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-10-03 12:10:11,944 INFO L402 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1026327788, now seen corresponding path program 214 times [2021-10-03 12:10:11,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:11,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568395280] [2021-10-03 12:10:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:11,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:12,039 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-03 12:10:12,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:12,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568395280] [2021-10-03 12:10:12,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568395280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:12,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:12,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:12,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512135026] [2021-10-03 12:10:12,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:12,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:12,041 INFO L87 Difference]: Start difference. First operand 288 states and 601 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:12,323 INFO L93 Difference]: Finished difference Result 370 states and 762 transitions. [2021-10-03 12:10:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:12,325 INFO L225 Difference]: With dead ends: 370 [2021-10-03 12:10:12,325 INFO L226 Difference]: Without dead ends: 352 [2021-10-03 12:10:12,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 148.7ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-03 12:10:12,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 282. [2021-10-03 12:10:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.0854092526690393) internal successors, (586), 281 states have internal predecessors, (586), 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-03 12:10:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 586 transitions. [2021-10-03 12:10:12,329 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 586 transitions. Word has length 38 [2021-10-03 12:10:12,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:12,329 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 586 transitions. [2021-10-03 12:10:12,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 586 transitions. [2021-10-03 12:10:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:12,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:12,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:12,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-10-03 12:10:12,330 INFO L402 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1803607412, now seen corresponding path program 215 times [2021-10-03 12:10:12,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:12,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442303472] [2021-10-03 12:10:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:12,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:12,431 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-03 12:10:12,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:12,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442303472] [2021-10-03 12:10:12,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442303472] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:12,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:12,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:12,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649570928] [2021-10-03 12:10:12,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:12,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:12,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:12,433 INFO L87 Difference]: Start difference. First operand 282 states and 586 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:12,675 INFO L93 Difference]: Finished difference Result 374 states and 780 transitions. [2021-10-03 12:10:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:12,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:12,677 INFO L225 Difference]: With dead ends: 374 [2021-10-03 12:10:12,677 INFO L226 Difference]: Without dead ends: 358 [2021-10-03 12:10:12,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 140.4ms TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-03 12:10:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 282. [2021-10-03 12:10:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.078291814946619) internal successors, (584), 281 states have internal predecessors, (584), 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-03 12:10:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 584 transitions. [2021-10-03 12:10:12,682 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 584 transitions. Word has length 38 [2021-10-03 12:10:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:12,682 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 584 transitions. [2021-10-03 12:10:12,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 584 transitions. [2021-10-03 12:10:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:12,683 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:12,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:12,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-10-03 12:10:12,683 INFO L402 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1368944438, now seen corresponding path program 216 times [2021-10-03 12:10:12,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:12,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754316575] [2021-10-03 12:10:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:12,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:12,779 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-03 12:10:12,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:12,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754316575] [2021-10-03 12:10:12,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754316575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:12,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:12,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:12,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682216784] [2021-10-03 12:10:12,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:12,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:12,782 INFO L87 Difference]: Start difference. First operand 282 states and 584 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:13,024 INFO L93 Difference]: Finished difference Result 350 states and 724 transitions. [2021-10-03 12:10:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:13,026 INFO L225 Difference]: With dead ends: 350 [2021-10-03 12:10:13,026 INFO L226 Difference]: Without dead ends: 338 [2021-10-03 12:10:13,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 135.7ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-03 12:10:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2021-10-03 12:10:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.0711743772241995) internal successors, (582), 281 states have internal predecessors, (582), 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-03 12:10:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 582 transitions. [2021-10-03 12:10:13,031 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 582 transitions. Word has length 38 [2021-10-03 12:10:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 582 transitions. [2021-10-03 12:10:13,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 582 transitions. [2021-10-03 12:10:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:13,032 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:13,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:13,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-10-03 12:10:13,032 INFO L402 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash -524033034, now seen corresponding path program 217 times [2021-10-03 12:10:13,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:13,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710537621] [2021-10-03 12:10:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:13,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:13,123 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-03 12:10:13,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:13,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710537621] [2021-10-03 12:10:13,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710537621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:13,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:13,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:13,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286289545] [2021-10-03 12:10:13,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:13,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:13,126 INFO L87 Difference]: Start difference. First operand 282 states and 582 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:13,370 INFO L93 Difference]: Finished difference Result 294 states and 602 transitions. [2021-10-03 12:10:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:13,371 INFO L225 Difference]: With dead ends: 294 [2021-10-03 12:10:13,371 INFO L226 Difference]: Without dead ends: 264 [2021-10-03 12:10:13,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 114.8ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-03 12:10:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-10-03 12:10:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.08745247148289) internal successors, (549), 263 states have internal predecessors, (549), 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-03 12:10:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 549 transitions. [2021-10-03 12:10:13,374 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 549 transitions. Word has length 38 [2021-10-03 12:10:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:13,375 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 549 transitions. [2021-10-03 12:10:13,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 549 transitions. [2021-10-03 12:10:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:13,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:13,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:13,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-10-03 12:10:13,376 INFO L402 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 161112942, now seen corresponding path program 218 times [2021-10-03 12:10:13,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:13,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004890852] [2021-10-03 12:10:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:13,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:13,476 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-03 12:10:13,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:13,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004890852] [2021-10-03 12:10:13,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004890852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:13,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:13,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:13,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236108655] [2021-10-03 12:10:13,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:13,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:13,479 INFO L87 Difference]: Start difference. First operand 264 states and 549 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:13,737 INFO L93 Difference]: Finished difference Result 336 states and 693 transitions. [2021-10-03 12:10:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:13,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:13,739 INFO L225 Difference]: With dead ends: 336 [2021-10-03 12:10:13,739 INFO L226 Difference]: Without dead ends: 320 [2021-10-03 12:10:13,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 154.6ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-10-03 12:10:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 264. [2021-10-03 12:10:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.079847908745247) internal successors, (547), 263 states have internal predecessors, (547), 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-03 12:10:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 547 transitions. [2021-10-03 12:10:13,742 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 547 transitions. Word has length 38 [2021-10-03 12:10:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:13,743 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 547 transitions. [2021-10-03 12:10:13,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 547 transitions. [2021-10-03 12:10:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:13,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:13,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:13,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-10-03 12:10:13,743 INFO L402 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash -271620556, now seen corresponding path program 219 times [2021-10-03 12:10:13,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:13,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55317155] [2021-10-03 12:10:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:13,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:13,863 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-03 12:10:13,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:13,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55317155] [2021-10-03 12:10:13,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55317155] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:13,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:13,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:13,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533141256] [2021-10-03 12:10:13,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:13,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:13,865 INFO L87 Difference]: Start difference. First operand 264 states and 547 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:14,137 INFO L93 Difference]: Finished difference Result 336 states and 691 transitions. [2021-10-03 12:10:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:14,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:14,138 INFO L225 Difference]: With dead ends: 336 [2021-10-03 12:10:14,139 INFO L226 Difference]: Without dead ends: 322 [2021-10-03 12:10:14,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-03 12:10:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2021-10-03 12:10:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.0940766550522647) internal successors, (601), 287 states have internal predecessors, (601), 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-03 12:10:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 601 transitions. [2021-10-03 12:10:14,142 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 601 transitions. Word has length 38 [2021-10-03 12:10:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:14,143 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 601 transitions. [2021-10-03 12:10:14,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 601 transitions. [2021-10-03 12:10:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:14,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:14,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-10-03 12:10:14,144 INFO L402 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1651584530, now seen corresponding path program 220 times [2021-10-03 12:10:14,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:14,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880684455] [2021-10-03 12:10:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:14,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:14,230 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-03 12:10:14,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:14,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880684455] [2021-10-03 12:10:14,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880684455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:14,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:14,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:14,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761663341] [2021-10-03 12:10:14,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:14,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:14,232 INFO L87 Difference]: Start difference. First operand 288 states and 601 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:14,465 INFO L93 Difference]: Finished difference Result 382 states and 779 transitions. [2021-10-03 12:10:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:14,466 INFO L225 Difference]: With dead ends: 382 [2021-10-03 12:10:14,466 INFO L226 Difference]: Without dead ends: 364 [2021-10-03 12:10:14,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 111.7ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-03 12:10:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 260. [2021-10-03 12:10:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.115830115830116) internal successors, (548), 259 states have internal predecessors, (548), 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-03 12:10:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 548 transitions. [2021-10-03 12:10:14,471 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 548 transitions. Word has length 38 [2021-10-03 12:10:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:14,471 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 548 transitions. [2021-10-03 12:10:14,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 548 transitions. [2021-10-03 12:10:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:14,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:14,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:14,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-10-03 12:10:14,472 INFO L402 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash 770345500, now seen corresponding path program 221 times [2021-10-03 12:10:14,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:14,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455597026] [2021-10-03 12:10:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:14,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:14,568 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-03 12:10:14,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:14,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455597026] [2021-10-03 12:10:14,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455597026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:14,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:14,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:14,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873853958] [2021-10-03 12:10:14,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:14,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:14,570 INFO L87 Difference]: Start difference. First operand 260 states and 548 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:14,904 INFO L93 Difference]: Finished difference Result 356 states and 729 transitions. [2021-10-03 12:10:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:10:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:14,906 INFO L225 Difference]: With dead ends: 356 [2021-10-03 12:10:14,906 INFO L226 Difference]: Without dead ends: 328 [2021-10-03 12:10:14,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 168.9ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-03 12:10:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 244. [2021-10-03 12:10:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.074074074074074) internal successors, (504), 243 states have internal predecessors, (504), 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-03 12:10:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 504 transitions. [2021-10-03 12:10:14,911 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 504 transitions. Word has length 38 [2021-10-03 12:10:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:14,912 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 504 transitions. [2021-10-03 12:10:14,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 504 transitions. [2021-10-03 12:10:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:14,912 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:14,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:14,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-10-03 12:10:14,913 INFO L402 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -770128866, now seen corresponding path program 222 times [2021-10-03 12:10:14,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:14,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031013169] [2021-10-03 12:10:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:14,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:15,025 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-03 12:10:15,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:15,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031013169] [2021-10-03 12:10:15,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031013169] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:15,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:15,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:15,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452181946] [2021-10-03 12:10:15,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:15,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:15,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:15,027 INFO L87 Difference]: Start difference. First operand 244 states and 504 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:15,270 INFO L93 Difference]: Finished difference Result 284 states and 572 transitions. [2021-10-03 12:10:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:15,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:15,272 INFO L225 Difference]: With dead ends: 284 [2021-10-03 12:10:15,272 INFO L226 Difference]: Without dead ends: 266 [2021-10-03 12:10:15,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 149.1ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:10:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-03 12:10:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2021-10-03 12:10:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.070539419087137) internal successors, (499), 241 states have internal predecessors, (499), 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-03 12:10:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 499 transitions. [2021-10-03 12:10:15,276 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 499 transitions. Word has length 38 [2021-10-03 12:10:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:15,277 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 499 transitions. [2021-10-03 12:10:15,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 499 transitions. [2021-10-03 12:10:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:15,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:15,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:15,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-10-03 12:10:15,278 INFO L402 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:15,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1260949556, now seen corresponding path program 223 times [2021-10-03 12:10:15,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:15,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998828784] [2021-10-03 12:10:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:15,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:15,387 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-03 12:10:15,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:15,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998828784] [2021-10-03 12:10:15,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998828784] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:15,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:15,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:15,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248054504] [2021-10-03 12:10:15,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:15,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:15,389 INFO L87 Difference]: Start difference. First operand 242 states and 499 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:15,641 INFO L93 Difference]: Finished difference Result 278 states and 561 transitions. [2021-10-03 12:10:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:15,643 INFO L225 Difference]: With dead ends: 278 [2021-10-03 12:10:15,643 INFO L226 Difference]: Without dead ends: 262 [2021-10-03 12:10:15,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 140.1ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-03 12:10:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2021-10-03 12:10:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.032388663967611) internal successors, (502), 247 states have internal predecessors, (502), 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-03 12:10:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 502 transitions. [2021-10-03 12:10:15,646 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 502 transitions. Word has length 38 [2021-10-03 12:10:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:15,646 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 502 transitions. [2021-10-03 12:10:15,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 502 transitions. [2021-10-03 12:10:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:15,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:15,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:15,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2021-10-03 12:10:15,647 INFO L402 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1804179148, now seen corresponding path program 224 times [2021-10-03 12:10:15,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:15,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341618309] [2021-10-03 12:10:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:15,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:15,744 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-03 12:10:15,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:15,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341618309] [2021-10-03 12:10:15,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341618309] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:15,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:15,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:15,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536027175] [2021-10-03 12:10:15,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:15,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:15,747 INFO L87 Difference]: Start difference. First operand 248 states and 502 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:16,049 INFO L93 Difference]: Finished difference Result 280 states and 552 transitions. [2021-10-03 12:10:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:10:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:16,051 INFO L225 Difference]: With dead ends: 280 [2021-10-03 12:10:16,051 INFO L226 Difference]: Without dead ends: 240 [2021-10-03 12:10:16,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 159.5ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:10:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-03 12:10:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2021-10-03 12:10:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.026431718061674) internal successors, (460), 227 states have internal predecessors, (460), 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-03 12:10:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 460 transitions. [2021-10-03 12:10:16,054 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 460 transitions. Word has length 38 [2021-10-03 12:10:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:16,054 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 460 transitions. [2021-10-03 12:10:16,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 460 transitions. [2021-10-03 12:10:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:16,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:16,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:16,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-10-03 12:10:16,055 INFO L402 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1030484690, now seen corresponding path program 225 times [2021-10-03 12:10:16,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:16,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193493710] [2021-10-03 12:10:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:16,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:16,149 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-03 12:10:16,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:16,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193493710] [2021-10-03 12:10:16,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193493710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:16,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:16,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:16,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374120248] [2021-10-03 12:10:16,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:16,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:16,151 INFO L87 Difference]: Start difference. First operand 228 states and 460 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:16,337 INFO L93 Difference]: Finished difference Result 272 states and 542 transitions. [2021-10-03 12:10:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:16,338 INFO L225 Difference]: With dead ends: 272 [2021-10-03 12:10:16,338 INFO L226 Difference]: Without dead ends: 260 [2021-10-03 12:10:16,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 116.1ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-10-03 12:10:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2021-10-03 12:10:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.012987012987013) internal successors, (465), 231 states have internal predecessors, (465), 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-03 12:10:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 465 transitions. [2021-10-03 12:10:16,343 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 465 transitions. Word has length 38 [2021-10-03 12:10:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:16,343 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 465 transitions. [2021-10-03 12:10:16,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 465 transitions. [2021-10-03 12:10:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:16,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:16,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:16,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-10-03 12:10:16,344 INFO L402 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash -784448034, now seen corresponding path program 226 times [2021-10-03 12:10:16,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:16,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608614185] [2021-10-03 12:10:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:16,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:16,446 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-03 12:10:16,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:16,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608614185] [2021-10-03 12:10:16,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608614185] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:16,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:16,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:16,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116456954] [2021-10-03 12:10:16,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:16,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:16,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:16,448 INFO L87 Difference]: Start difference. First operand 232 states and 465 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:16,627 INFO L93 Difference]: Finished difference Result 244 states and 483 transitions. [2021-10-03 12:10:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:16,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:16,629 INFO L225 Difference]: With dead ends: 244 [2021-10-03 12:10:16,629 INFO L226 Difference]: Without dead ends: 212 [2021-10-03 12:10:16,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 126.8ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-03 12:10:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-10-03 12:10:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.028436018957346) internal successors, (428), 211 states have internal predecessors, (428), 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-03 12:10:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 428 transitions. [2021-10-03 12:10:16,632 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 428 transitions. Word has length 38 [2021-10-03 12:10:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:16,632 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 428 transitions. [2021-10-03 12:10:16,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 428 transitions. [2021-10-03 12:10:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:16,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:16,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:16,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-10-03 12:10:16,633 INFO L402 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2022262326, now seen corresponding path program 227 times [2021-10-03 12:10:16,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:16,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515781654] [2021-10-03 12:10:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:16,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:16,719 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-03 12:10:16,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:16,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515781654] [2021-10-03 12:10:16,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515781654] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:16,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:16,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:16,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305753281] [2021-10-03 12:10:16,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:16,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:16,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:16,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:16,721 INFO L87 Difference]: Start difference. First operand 212 states and 428 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:16,887 INFO L93 Difference]: Finished difference Result 234 states and 463 transitions. [2021-10-03 12:10:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:16,888 INFO L225 Difference]: With dead ends: 234 [2021-10-03 12:10:16,888 INFO L226 Difference]: Without dead ends: 214 [2021-10-03 12:10:16,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 80.5ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:10:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-03 12:10:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2021-10-03 12:10:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.0) internal successors, (422), 211 states have internal predecessors, (422), 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-03 12:10:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 422 transitions. [2021-10-03 12:10:16,892 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 422 transitions. Word has length 38 [2021-10-03 12:10:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:16,892 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 422 transitions. [2021-10-03 12:10:16,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 422 transitions. [2021-10-03 12:10:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:16,893 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:16,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:16,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-10-03 12:10:16,893 INFO L402 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1944995480, now seen corresponding path program 228 times [2021-10-03 12:10:16,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:16,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455475541] [2021-10-03 12:10:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:16,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:17,021 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-03 12:10:17,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:17,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455475541] [2021-10-03 12:10:17,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455475541] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:17,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:17,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-03 12:10:17,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966159861] [2021-10-03 12:10:17,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:10:17,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:17,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:10:17,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:10:17,024 INFO L87 Difference]: Start difference. First operand 212 states and 422 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:17,283 INFO L93 Difference]: Finished difference Result 256 states and 506 transitions. [2021-10-03 12:10:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:10:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:17,284 INFO L225 Difference]: With dead ends: 256 [2021-10-03 12:10:17,284 INFO L226 Difference]: Without dead ends: 234 [2021-10-03 12:10:17,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 154.3ms TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:10:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-10-03 12:10:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2021-10-03 12:10:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.9853658536585366) internal successors, (407), 205 states have internal predecessors, (407), 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-03 12:10:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 407 transitions. [2021-10-03 12:10:17,287 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 407 transitions. Word has length 38 [2021-10-03 12:10:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:17,287 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 407 transitions. [2021-10-03 12:10:17,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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-03 12:10:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 407 transitions. [2021-10-03 12:10:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:17,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:17,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:17,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2021-10-03 12:10:17,288 INFO L402 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1208897404, now seen corresponding path program 229 times [2021-10-03 12:10:17,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:17,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180617039] [2021-10-03 12:10:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:17,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:17,378 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-03 12:10:17,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:17,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180617039] [2021-10-03 12:10:17,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180617039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:17,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:17,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:17,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732823050] [2021-10-03 12:10:17,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:17,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:17,380 INFO L87 Difference]: Start difference. First operand 206 states and 407 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:17,567 INFO L93 Difference]: Finished difference Result 226 states and 437 transitions. [2021-10-03 12:10:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:17,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:17,568 INFO L225 Difference]: With dead ends: 226 [2021-10-03 12:10:17,569 INFO L226 Difference]: Without dead ends: 210 [2021-10-03 12:10:17,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 89.8ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:10:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-03 12:10:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2021-10-03 12:10:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.9698492462311559) internal successors, (392), 199 states have internal predecessors, (392), 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-03 12:10:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 392 transitions. [2021-10-03 12:10:17,572 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 392 transitions. Word has length 38 [2021-10-03 12:10:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:17,572 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 392 transitions. [2021-10-03 12:10:17,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 392 transitions. [2021-10-03 12:10:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:17,573 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:17,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:17,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2021-10-03 12:10:17,573 INFO L402 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash -271391654, now seen corresponding path program 230 times [2021-10-03 12:10:17,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:17,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229336749] [2021-10-03 12:10:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:17,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:17,668 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-03 12:10:17,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:17,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229336749] [2021-10-03 12:10:17,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229336749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:17,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:17,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:17,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444990397] [2021-10-03 12:10:17,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:17,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:17,671 INFO L87 Difference]: Start difference. First operand 200 states and 392 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:17,877 INFO L93 Difference]: Finished difference Result 212 states and 410 transitions. [2021-10-03 12:10:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:17,878 INFO L225 Difference]: With dead ends: 212 [2021-10-03 12:10:17,878 INFO L226 Difference]: Without dead ends: 194 [2021-10-03 12:10:17,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-03 12:10:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-10-03 12:10:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.9533678756476685) internal successors, (377), 193 states have internal predecessors, (377), 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-03 12:10:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 377 transitions. [2021-10-03 12:10:17,881 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 377 transitions. Word has length 38 [2021-10-03 12:10:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:17,881 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 377 transitions. [2021-10-03 12:10:17,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 377 transitions. [2021-10-03 12:10:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:17,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:17,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:17,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-10-03 12:10:17,882 INFO L402 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1048671278, now seen corresponding path program 231 times [2021-10-03 12:10:17,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:17,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516739177] [2021-10-03 12:10:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:17,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:17,977 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-03 12:10:17,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:17,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516739177] [2021-10-03 12:10:17,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516739177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:17,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:17,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:17,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858707055] [2021-10-03 12:10:17,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:17,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:17,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:17,979 INFO L87 Difference]: Start difference. First operand 194 states and 377 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:18,170 INFO L93 Difference]: Finished difference Result 208 states and 400 transitions. [2021-10-03 12:10:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:18,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:18,172 INFO L225 Difference]: With dead ends: 208 [2021-10-03 12:10:18,172 INFO L226 Difference]: Without dead ends: 192 [2021-10-03 12:10:18,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:10:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-03 12:10:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-10-03 12:10:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.9476439790575917) internal successors, (372), 191 states have internal predecessors, (372), 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-03 12:10:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 372 transitions. [2021-10-03 12:10:18,175 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 372 transitions. Word has length 38 [2021-10-03 12:10:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:18,175 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 372 transitions. [2021-10-03 12:10:18,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 372 transitions. [2021-10-03 12:10:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:18,176 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:18,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:18,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-10-03 12:10:18,176 INFO L402 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2123880572, now seen corresponding path program 232 times [2021-10-03 12:10:18,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:18,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083255637] [2021-10-03 12:10:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:18,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:18,272 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-03 12:10:18,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:18,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083255637] [2021-10-03 12:10:18,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083255637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:18,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:18,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:18,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702058406] [2021-10-03 12:10:18,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:18,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:18,275 INFO L87 Difference]: Start difference. First operand 192 states and 372 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:18,453 INFO L93 Difference]: Finished difference Result 164 states and 310 transitions. [2021-10-03 12:10:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:18,454 INFO L225 Difference]: With dead ends: 164 [2021-10-03 12:10:18,454 INFO L226 Difference]: Without dead ends: 144 [2021-10-03 12:10:18,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 105.8ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-03 12:10:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-10-03 12:10:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.944055944055944) internal successors, (278), 143 states have internal predecessors, (278), 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-03 12:10:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 278 transitions. [2021-10-03 12:10:18,458 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 278 transitions. Word has length 38 [2021-10-03 12:10:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:18,458 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 278 transitions. [2021-10-03 12:10:18,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 278 transitions. [2021-10-03 12:10:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:18,459 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:18,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:18,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2021-10-03 12:10:18,460 INFO L402 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1340592674, now seen corresponding path program 233 times [2021-10-03 12:10:18,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:18,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850000053] [2021-10-03 12:10:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:18,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:18,544 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-03 12:10:18,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:18,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850000053] [2021-10-03 12:10:18,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850000053] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:18,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:18,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:18,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37541217] [2021-10-03 12:10:18,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:18,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:18,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:18,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:18,546 INFO L87 Difference]: Start difference. First operand 144 states and 278 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:18,681 INFO L93 Difference]: Finished difference Result 160 states and 300 transitions. [2021-10-03 12:10:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:18,682 INFO L225 Difference]: With dead ends: 160 [2021-10-03 12:10:18,682 INFO L226 Difference]: Without dead ends: 146 [2021-10-03 12:10:18,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 73.7ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:10:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-03 12:10:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2021-10-03 12:10:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.902097902097902) internal successors, (272), 143 states have internal predecessors, (272), 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-03 12:10:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 272 transitions. [2021-10-03 12:10:18,685 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 272 transitions. Word has length 38 [2021-10-03 12:10:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:18,686 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 272 transitions. [2021-10-03 12:10:18,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 272 transitions. [2021-10-03 12:10:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:18,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:18,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:18,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-10-03 12:10:18,686 INFO L402 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -298626618, now seen corresponding path program 234 times [2021-10-03 12:10:18,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:18,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633178501] [2021-10-03 12:10:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:18,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:18,769 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-03 12:10:18,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:18,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633178501] [2021-10-03 12:10:18,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633178501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:18,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:18,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:18,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989054599] [2021-10-03 12:10:18,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:18,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:18,772 INFO L87 Difference]: Start difference. First operand 144 states and 272 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:18,957 INFO L93 Difference]: Finished difference Result 184 states and 345 transitions. [2021-10-03 12:10:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:18,958 INFO L225 Difference]: With dead ends: 184 [2021-10-03 12:10:18,958 INFO L226 Difference]: Without dead ends: 160 [2021-10-03 12:10:18,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 103.2ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:10:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-03 12:10:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2021-10-03 12:10:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-03 12:10:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 239 transitions. [2021-10-03 12:10:18,961 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 239 transitions. Word has length 38 [2021-10-03 12:10:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:18,961 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 239 transitions. [2021-10-03 12:10:18,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 239 transitions. [2021-10-03 12:10:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:18,962 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:18,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:18,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-10-03 12:10:18,962 INFO L402 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1123219246, now seen corresponding path program 235 times [2021-10-03 12:10:18,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:18,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510382116] [2021-10-03 12:10:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:18,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:19,060 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-03 12:10:19,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:19,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510382116] [2021-10-03 12:10:19,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510382116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:19,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:19,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:19,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681620214] [2021-10-03 12:10:19,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:19,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:19,063 INFO L87 Difference]: Start difference. First operand 132 states and 239 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:19,232 INFO L93 Difference]: Finished difference Result 144 states and 257 transitions. [2021-10-03 12:10:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:19,233 INFO L225 Difference]: With dead ends: 144 [2021-10-03 12:10:19,233 INFO L226 Difference]: Without dead ends: 128 [2021-10-03 12:10:19,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 103.0ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:10:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-10-03 12:10:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2021-10-03 12:10:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.792) internal successors, (224), 125 states have internal predecessors, (224), 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-03 12:10:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 224 transitions. [2021-10-03 12:10:19,236 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 224 transitions. Word has length 38 [2021-10-03 12:10:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:19,237 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 224 transitions. [2021-10-03 12:10:19,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 224 transitions. [2021-10-03 12:10:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:19,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:19,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:19,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-10-03 12:10:19,237 INFO L402 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1666448838, now seen corresponding path program 236 times [2021-10-03 12:10:19,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:19,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402811308] [2021-10-03 12:10:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:19,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:19,337 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-03 12:10:19,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:19,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402811308] [2021-10-03 12:10:19,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402811308] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:19,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:19,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:19,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432163162] [2021-10-03 12:10:19,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:19,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:19,339 INFO L87 Difference]: Start difference. First operand 126 states and 224 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:19,522 INFO L93 Difference]: Finished difference Result 138 states and 242 transitions. [2021-10-03 12:10:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:10:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:19,523 INFO L225 Difference]: With dead ends: 138 [2021-10-03 12:10:19,523 INFO L226 Difference]: Without dead ends: 120 [2021-10-03 12:10:19,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 118.8ms TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-10-03 12:10:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-10-03 12:10:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 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-03 12:10:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 209 transitions. [2021-10-03 12:10:19,526 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 209 transitions. Word has length 38 [2021-10-03 12:10:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:19,526 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 209 transitions. [2021-10-03 12:10:19,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 209 transitions. [2021-10-03 12:10:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:19,526 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:19,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:19,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-10-03 12:10:19,527 INFO L402 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -638378450, now seen corresponding path program 237 times [2021-10-03 12:10:19,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:19,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484732448] [2021-10-03 12:10:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:19,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:19,601 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-03 12:10:19,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:19,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484732448] [2021-10-03 12:10:19,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484732448] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:19,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:19,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:10:19,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816045929] [2021-10-03 12:10:19,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-03 12:10:19,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-03 12:10:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:10:19,603 INFO L87 Difference]: Start difference. First operand 120 states and 209 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:19,756 INFO L93 Difference]: Finished difference Result 128 states and 219 transitions. [2021-10-03 12:10:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:19,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:19,757 INFO L225 Difference]: With dead ends: 128 [2021-10-03 12:10:19,758 INFO L226 Difference]: Without dead ends: 116 [2021-10-03 12:10:19,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 95.7ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:10:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-03 12:10:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-10-03 12:10:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 115 states have internal predecessors, (200), 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-03 12:10:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2021-10-03 12:10:19,760 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 38 [2021-10-03 12:10:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:19,760 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2021-10-03 12:10:19,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-03 12:10:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2021-10-03 12:10:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-03 12:10:19,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:10:19,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:10:19,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2021-10-03 12:10:19,761 INFO L402 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-03 12:10:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:10:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -392341794, now seen corresponding path program 238 times [2021-10-03 12:10:19,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:10:19,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228343121] [2021-10-03 12:10:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:10:19,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:10:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:10:19,862 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-03 12:10:19,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:10:19,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228343121] [2021-10-03 12:10:19,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228343121] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:10:19,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:10:19,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:10:19,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83044741] [2021-10-03 12:10:19,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:10:19,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:10:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:10:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:10:19,865 INFO L87 Difference]: Start difference. First operand 116 states and 200 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:10:20,001 INFO L93 Difference]: Finished difference Result 68 states and 112 transitions. [2021-10-03 12:10:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:10:20,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-10-03 12:10:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:10:20,002 INFO L225 Difference]: With dead ends: 68 [2021-10-03 12:10:20,002 INFO L226 Difference]: Without dead ends: 0 [2021-10-03 12:10:20,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 118.4ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:10:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-03 12:10:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-03 12:10:20,003 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-03 12:10:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-03 12:10:20,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2021-10-03 12:10:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:10:20,003 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-03 12:10:20,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-03 12:10:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-03 12:10:20,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-03 12:10:20,006 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-03 12:10:20,007 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-03 12:10:20,007 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-03 12:10:20,007 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-03 12:10:20,007 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-03 12:10:20,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-10-03 12:10:20,012 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-03 12:10:20,012 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-03 12:10:20,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:10:20 BasicIcfg [2021-10-03 12:10:20,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-03 12:10:20,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-03 12:10:20,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-03 12:10:20,015 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-03 12:10:20,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:08:01" (3/4) ... [2021-10-03 12:10:20,019 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-03 12:10:20,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-03 12:10:20,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-03 12:10:20,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-03 12:10:20,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-10-03 12:10:20,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-10-03 12:10:20,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-03 12:10:20,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-03 12:10:20,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-03 12:10:20,071 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-03 12:10:20,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-03 12:10:20,074 INFO L168 Benchmark]: Toolchain (without parser) took 139801.46 ms. Allocated memory was 54.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 30.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 768.5 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,074 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 12:10:20,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.74 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 31.0 MB in the end (delta: -880.9 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 54.5 MB. Free memory was 30.9 MB in the beginning and 28.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,076 INFO L168 Benchmark]: Boogie Preprocessor took 27.84 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 27.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 12:10:20,076 INFO L168 Benchmark]: RCFGBuilder took 591.79 ms. Allocated memory is still 54.5 MB. Free memory was 27.6 MB in the beginning and 24.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,077 INFO L168 Benchmark]: TraceAbstraction took 138747.65 ms. Allocated memory was 54.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 24.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 757.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,077 INFO L168 Benchmark]: Witness Printer took 56.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:10:20,079 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.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.74 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 31.0 MB in the end (delta: -880.9 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 54.5 MB. Free memory was 30.9 MB in the beginning and 28.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.84 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 27.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 591.79 ms. Allocated memory is still 54.5 MB. Free memory was 27.6 MB in the beginning and 24.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 138747.65 ms. Allocated memory was 54.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 24.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 757.1 MB. Max. memory is 16.1 GB. * Witness Printer took 56.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB 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: 5076.6ms, 162 PlacesBefore, 56 PlacesAfterwards, 155 TransitionsBefore, 46 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 135 TotalNumberOfCompositions, 11537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5870, positive: 5616, positive conditional: 0, positive unconditional: 5616, negative: 254, negative conditional: 0, negative unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2870, positive: 2801, positive conditional: 0, positive unconditional: 2801, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2870, positive: 2665, positive conditional: 0, positive unconditional: 2665, negative: 205, negative conditional: 0, negative unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5870, positive: 2815, positive conditional: 0, positive unconditional: 2815, negative: 185, negative conditional: 0, negative unconditional: 185, unknown: 2870, unknown conditional: 0, unknown unconditional: 2870] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - 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: 99]: 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 9 procedures, 207 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 138484.2ms, OverallIterations: 239, TraceHistogramMax: 1, EmptinessCheckTime: 824.8ms, AutomataDifference: 96875.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5398.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 16402 SDtfs, 19671 SDslu, 97940 SDs, 0 SdLazy, 95631 SolverSat, 6439 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47554.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5203 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 4803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15780 ImplicationChecksByTransitivity, 41085.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5046occurred in iteration=7, InterpolantAutomatonStates: 4219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8553.8ms AutomataMinimizationTime, 239 MinimizatonAttempts, 59850 StatesRemovedByMinimization, 226 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 454.1ms SsaConstructionTime, 4571.0ms SatisfiabilityAnalysisTime, 19939.9ms InterpolantComputationTime, 9070 NumberOfCodeBlocks, 9070 NumberOfCodeBlocksAsserted, 239 NumberOfCheckSat, 8831 ConstructedInterpolants, 0 QuantifiedInterpolants, 28094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 239 InterpolantComputations, 239 PerfectInterpolantSequences, 0/0 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-03 12:10:20,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...