./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:08:55,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:08:55,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:08:55,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:08:55,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:08:55,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:08:55,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:08:55,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:08:55,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:08:55,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:08:55,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:08:55,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:08:55,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:08:55,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:08:55,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:08:55,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:08:55,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:08:55,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:08:55,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:08:55,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:08:55,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:08:55,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:08:55,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:08:55,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:08:55,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:08:55,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:08:55,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:08:55,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:08:55,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:08:55,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2024-11-07 00:08:56,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:08:56,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:08:56,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:08:56,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:08:56,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:08:56,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:08:57,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:08:57,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:08:57,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:08:57,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a68cca8a/fed9f87861294bcaa0b9e0d853f85e7b/FLAGd9de05395 [2024-11-07 00:08:57,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a68cca8a/fed9f87861294bcaa0b9e0d853f85e7b [2024-11-07 00:08:57,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:08:57,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:08:57,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:08:57,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:08:57,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:08:57,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:08:57" (1/1) ... [2024-11-07 00:08:57,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b820ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:57, skipping insertion in model container [2024-11-07 00:08:57,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:08:57" (1/1) ... [2024-11-07 00:08:57,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:08:58,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-07 00:08:58,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:08:58,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:08:58,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-07 00:08:58,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:08:58,204 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:08:58,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58 WrapperNode [2024-11-07 00:08:58,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:08:58,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:08:58,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:08:58,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:08:58,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,269 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 498 [2024-11-07 00:08:58,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:08:58,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:08:58,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:08:58,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:08:58,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:08:58,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:08:58,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:08:58,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:08:58,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:08:58,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (1/1) ... [2024-11-07 00:08:58,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:08:58,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:08:58,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:08:58,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:08:58,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:08:58,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:08:58,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:08:58,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:08:58,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:08:58,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:08:59,325 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-07 00:08:59,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:08:59,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:08:59,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:08:59,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:08:59 BoogieIcfgContainer [2024-11-07 00:08:59,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:08:59,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:08:59,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:08:59,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:08:59,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:08:57" (1/3) ... [2024-11-07 00:08:59,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209affdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:08:59, skipping insertion in model container [2024-11-07 00:08:59,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:08:58" (2/3) ... [2024-11-07 00:08:59,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209affdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:08:59, skipping insertion in model container [2024-11-07 00:08:59,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:08:59" (3/3) ... [2024-11-07 00:08:59,360 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:08:59,374 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:08:59,374 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:08:59,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:08:59,448 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70ca52fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:08:59,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:08:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 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) [2024-11-07 00:08:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 00:08:59,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:08:59,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:08:59,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:08:59,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:08:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 395135632, now seen corresponding path program 1 times [2024-11-07 00:08:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:08:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952567666] [2024-11-07 00:08:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:08:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:08:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:08:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:08:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:08:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952567666] [2024-11-07 00:08:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952567666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:08:59,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:08:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:08:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12031279] [2024-11-07 00:08:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:08:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:08:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:08:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:08:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:08:59,968 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 136 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) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:08:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:00,000 INFO L93 Difference]: Finished difference Result 211 states and 367 transitions. [2024-11-07 00:09:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:09:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 00:09:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:00,013 INFO L225 Difference]: With dead ends: 211 [2024-11-07 00:09:00,013 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 00:09:00,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:09:00,022 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:00,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 00:09:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-07 00:09:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions. [2024-11-07 00:09:00,080 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37 [2024-11-07 00:09:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:00,081 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 232 transitions. [2024-11-07 00:09:00,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2024-11-07 00:09:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 00:09:00,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:00,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:00,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:09:00,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:00,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -422512818, now seen corresponding path program 1 times [2024-11-07 00:09:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326965911] [2024-11-07 00:09:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326965911] [2024-11-07 00:09:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326965911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320938701] [2024-11-07 00:09:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:00,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:00,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:00,510 INFO L87 Difference]: Start difference. First operand 133 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:00,631 INFO L93 Difference]: Finished difference Result 210 states and 360 transitions. [2024-11-07 00:09:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 00:09:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:00,633 INFO L225 Difference]: With dead ends: 210 [2024-11-07 00:09:00,633 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 00:09:00,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:00,634 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:00,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 00:09:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-07 00:09:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2024-11-07 00:09:00,642 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2024-11-07 00:09:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:00,642 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2024-11-07 00:09:00,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2024-11-07 00:09:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 00:09:00,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:00,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:00,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:09:00,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:00,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1398422292, now seen corresponding path program 1 times [2024-11-07 00:09:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:00,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357640004] [2024-11-07 00:09:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:00,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357640004] [2024-11-07 00:09:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357640004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425357657] [2024-11-07 00:09:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:00,916 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:00,998 INFO L93 Difference]: Finished difference Result 269 states and 432 transitions. [2024-11-07 00:09:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 00:09:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:01,001 INFO L225 Difference]: With dead ends: 269 [2024-11-07 00:09:01,001 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 00:09:01,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:01,002 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:01,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 00:09:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-07 00:09:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5625) internal successors, (300), 192 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-11-07 00:09:01,019 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 66 [2024-11-07 00:09:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:01,019 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-11-07 00:09:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-11-07 00:09:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:09:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:01,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:09:01,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1852534978, now seen corresponding path program 1 times [2024-11-07 00:09:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142038485] [2024-11-07 00:09:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142038485] [2024-11-07 00:09:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142038485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879347677] [2024-11-07 00:09:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:01,186 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:01,237 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2024-11-07 00:09:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:01,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:09:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:01,240 INFO L225 Difference]: With dead ends: 443 [2024-11-07 00:09:01,240 INFO L226 Difference]: Without dead ends: 310 [2024-11-07 00:09:01,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:01,246 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:01,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-07 00:09:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2024-11-07 00:09:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.5967213114754097) internal successors, (487), 305 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 487 transitions. [2024-11-07 00:09:01,281 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 487 transitions. Word has length 68 [2024-11-07 00:09:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 487 transitions. [2024-11-07 00:09:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 487 transitions. [2024-11-07 00:09:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 00:09:01,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:01,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:09:01,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1172652176, now seen corresponding path program 1 times [2024-11-07 00:09:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817380416] [2024-11-07 00:09:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817380416] [2024-11-07 00:09:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817380416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082185916] [2024-11-07 00:09:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:01,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:01,484 INFO L87 Difference]: Start difference. First operand 306 states and 487 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:01,548 INFO L93 Difference]: Finished difference Result 766 states and 1249 transitions. [2024-11-07 00:09:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 00:09:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:01,552 INFO L225 Difference]: With dead ends: 766 [2024-11-07 00:09:01,552 INFO L226 Difference]: Without dead ends: 520 [2024-11-07 00:09:01,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:01,556 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:01,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-07 00:09:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 514. [2024-11-07 00:09:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.612085769980507) internal successors, (827), 513 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 827 transitions. [2024-11-07 00:09:01,600 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 827 transitions. Word has length 70 [2024-11-07 00:09:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:01,602 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 827 transitions. [2024-11-07 00:09:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 827 transitions. [2024-11-07 00:09:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:09:01,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:01,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:09:01,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:01,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash 648029982, now seen corresponding path program 1 times [2024-11-07 00:09:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25304384] [2024-11-07 00:09:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25304384] [2024-11-07 00:09:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25304384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789856989] [2024-11-07 00:09:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:01,862 INFO L87 Difference]: Start difference. First operand 514 states and 827 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:02,074 INFO L93 Difference]: Finished difference Result 2190 states and 3633 transitions. [2024-11-07 00:09:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:09:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 00:09:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:02,084 INFO L225 Difference]: With dead ends: 2190 [2024-11-07 00:09:02,084 INFO L226 Difference]: Without dead ends: 1736 [2024-11-07 00:09:02,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:02,087 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 812 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:02,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1144 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-07 00:09:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 912. [2024-11-07 00:09:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.628979143798024) internal successors, (1484), 911 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1484 transitions. [2024-11-07 00:09:02,146 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1484 transitions. Word has length 72 [2024-11-07 00:09:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:02,146 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1484 transitions. [2024-11-07 00:09:02,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1484 transitions. [2024-11-07 00:09:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:09:02,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:02,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:02,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:09:02,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:02,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash 986227649, now seen corresponding path program 1 times [2024-11-07 00:09:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66084603] [2024-11-07 00:09:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66084603] [2024-11-07 00:09:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66084603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011770578] [2024-11-07 00:09:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:02,290 INFO L87 Difference]: Start difference. First operand 912 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:02,406 INFO L93 Difference]: Finished difference Result 2654 states and 4394 transitions. [2024-11-07 00:09:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-07 00:09:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:02,416 INFO L225 Difference]: With dead ends: 2654 [2024-11-07 00:09:02,416 INFO L226 Difference]: Without dead ends: 1802 [2024-11-07 00:09:02,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:02,420 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 359 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:02,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 578 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-07 00:09:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1348. [2024-11-07 00:09:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.6384558277654047) internal successors, (2207), 1347 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2207 transitions. [2024-11-07 00:09:02,487 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2207 transitions. Word has length 73 [2024-11-07 00:09:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2207 transitions. [2024-11-07 00:09:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2207 transitions. [2024-11-07 00:09:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:09:02,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:02,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:02,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:09:02,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:02,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1245542219, now seen corresponding path program 1 times [2024-11-07 00:09:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349316659] [2024-11-07 00:09:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:02,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349316659] [2024-11-07 00:09:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349316659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:02,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484491269] [2024-11-07 00:09:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:02,651 INFO L87 Difference]: Start difference. First operand 1348 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:02,801 INFO L93 Difference]: Finished difference Result 3908 states and 6458 transitions. [2024-11-07 00:09:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-07 00:09:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:02,814 INFO L225 Difference]: With dead ends: 3908 [2024-11-07 00:09:02,816 INFO L226 Difference]: Without dead ends: 2620 [2024-11-07 00:09:02,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:02,821 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:02,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2024-11-07 00:09:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1972. [2024-11-07 00:09:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.637239979705733) internal successors, (3227), 1971 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3227 transitions. [2024-11-07 00:09:02,904 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3227 transitions. Word has length 74 [2024-11-07 00:09:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 3227 transitions. [2024-11-07 00:09:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3227 transitions. [2024-11-07 00:09:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:09:02,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:02,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:02,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:09:02,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:02,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1541927048, now seen corresponding path program 1 times [2024-11-07 00:09:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163766679] [2024-11-07 00:09:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163766679] [2024-11-07 00:09:03,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163766679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:03,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:03,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159481613] [2024-11-07 00:09:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:03,037 INFO L87 Difference]: Start difference. First operand 1972 states and 3227 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:03,193 INFO L93 Difference]: Finished difference Result 5692 states and 9382 transitions. [2024-11-07 00:09:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-07 00:09:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:03,216 INFO L225 Difference]: With dead ends: 5692 [2024-11-07 00:09:03,216 INFO L226 Difference]: Without dead ends: 3780 [2024-11-07 00:09:03,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:03,221 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:03,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-07 00:09:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2860. [2024-11-07 00:09:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.634487583071004) internal successors, (4673), 2859 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4673 transitions. [2024-11-07 00:09:03,357 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4673 transitions. Word has length 75 [2024-11-07 00:09:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:03,357 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4673 transitions. [2024-11-07 00:09:03,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4673 transitions. [2024-11-07 00:09:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:09:03,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:03,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:09:03,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 268884983, now seen corresponding path program 1 times [2024-11-07 00:09:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140839084] [2024-11-07 00:09:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140839084] [2024-11-07 00:09:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140839084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432559579] [2024-11-07 00:09:03,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:03,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:03,461 INFO L87 Difference]: Start difference. First operand 2860 states and 4673 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:03,553 INFO L93 Difference]: Finished difference Result 6550 states and 10704 transitions. [2024-11-07 00:09:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-07 00:09:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:03,574 INFO L225 Difference]: With dead ends: 6550 [2024-11-07 00:09:03,575 INFO L226 Difference]: Without dead ends: 4512 [2024-11-07 00:09:03,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:03,581 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:03,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2024-11-07 00:09:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510. [2024-11-07 00:09:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.6185406963850077) internal successors, (7298), 4509 states have internal predecessors, (7298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 7298 transitions. [2024-11-07 00:09:03,742 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 7298 transitions. Word has length 76 [2024-11-07 00:09:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 7298 transitions. [2024-11-07 00:09:03,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 7298 transitions. [2024-11-07 00:09:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:09:03,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:03,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:03,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:09:03,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1813417673, now seen corresponding path program 1 times [2024-11-07 00:09:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:03,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547343314] [2024-11-07 00:09:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547343314] [2024-11-07 00:09:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547343314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888612381] [2024-11-07 00:09:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:03,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:03,851 INFO L87 Difference]: Start difference. First operand 4510 states and 7298 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:03,972 INFO L93 Difference]: Finished difference Result 9926 states and 16104 transitions. [2024-11-07 00:09:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-07 00:09:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:04,004 INFO L225 Difference]: With dead ends: 9926 [2024-11-07 00:09:04,005 INFO L226 Difference]: Without dead ends: 6732 [2024-11-07 00:09:04,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:04,015 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:04,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2024-11-07 00:09:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 6730. [2024-11-07 00:09:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.607965522365879) internal successors, (10820), 6729 states have internal predecessors, (10820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 10820 transitions. [2024-11-07 00:09:04,281 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 10820 transitions. Word has length 76 [2024-11-07 00:09:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:04,282 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 10820 transitions. [2024-11-07 00:09:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 10820 transitions. [2024-11-07 00:09:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:09:04,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:04,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:09:04,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:04,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1616320119, now seen corresponding path program 1 times [2024-11-07 00:09:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428834398] [2024-11-07 00:09:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428834398] [2024-11-07 00:09:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428834398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558825508] [2024-11-07 00:09:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:04,391 INFO L87 Difference]: Start difference. First operand 6730 states and 10820 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:04,616 INFO L93 Difference]: Finished difference Result 15111 states and 24508 transitions. [2024-11-07 00:09:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-07 00:09:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:04,676 INFO L225 Difference]: With dead ends: 15111 [2024-11-07 00:09:04,677 INFO L226 Difference]: Without dead ends: 10171 [2024-11-07 00:09:04,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:04,689 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:04,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2024-11-07 00:09:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2024-11-07 00:09:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.6009047993705743) internal successors, (16278), 10168 states have internal predecessors, (16278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16278 transitions. [2024-11-07 00:09:05,069 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16278 transitions. Word has length 76 [2024-11-07 00:09:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:05,070 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16278 transitions. [2024-11-07 00:09:05,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16278 transitions. [2024-11-07 00:09:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:09:05,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:05,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:05,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:09:05,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2139270896, now seen corresponding path program 1 times [2024-11-07 00:09:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161868440] [2024-11-07 00:09:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161868440] [2024-11-07 00:09:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161868440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101677626] [2024-11-07 00:09:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:05,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:05,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:05,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:05,355 INFO L87 Difference]: Start difference. First operand 10169 states and 16278 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:05,591 INFO L93 Difference]: Finished difference Result 20262 states and 32453 transitions. [2024-11-07 00:09:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:09:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:05,621 INFO L225 Difference]: With dead ends: 20262 [2024-11-07 00:09:05,622 INFO L226 Difference]: Without dead ends: 10171 [2024-11-07 00:09:05,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:05,639 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:05,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 537 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2024-11-07 00:09:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2024-11-07 00:09:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.5886113296616837) internal successors, (16153), 10168 states have internal predecessors, (16153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16153 transitions. [2024-11-07 00:09:06,012 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16153 transitions. Word has length 77 [2024-11-07 00:09:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:06,012 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16153 transitions. [2024-11-07 00:09:06,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16153 transitions. [2024-11-07 00:09:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:09:06,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:06,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:09:06,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -297465128, now seen corresponding path program 1 times [2024-11-07 00:09:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392088115] [2024-11-07 00:09:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392088115] [2024-11-07 00:09:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392088115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966513429] [2024-11-07 00:09:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:06,314 INFO L87 Difference]: Start difference. First operand 10169 states and 16153 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:06,742 INFO L93 Difference]: Finished difference Result 29138 states and 46435 transitions. [2024-11-07 00:09:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-07 00:09:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:06,806 INFO L225 Difference]: With dead ends: 29138 [2024-11-07 00:09:06,806 INFO L226 Difference]: Without dead ends: 19047 [2024-11-07 00:09:06,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:06,833 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 185 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:06,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 541 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19047 states. [2024-11-07 00:09:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 19045. [2024-11-07 00:09:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19045 states, 19044 states have (on average 1.5750892669607226) internal successors, (29996), 19044 states have internal predecessors, (29996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 29996 transitions. [2024-11-07 00:09:07,545 INFO L78 Accepts]: Start accepts. Automaton has 19045 states and 29996 transitions. Word has length 80 [2024-11-07 00:09:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:07,545 INFO L471 AbstractCegarLoop]: Abstraction has 19045 states and 29996 transitions. [2024-11-07 00:09:07,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19045 states and 29996 transitions. [2024-11-07 00:09:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:09:07,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:07,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:09:07,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:07,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1060060007, now seen corresponding path program 1 times [2024-11-07 00:09:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544972391] [2024-11-07 00:09:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544972391] [2024-11-07 00:09:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544972391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:07,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:09:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502441077] [2024-11-07 00:09:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:09:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:09:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:07,948 INFO L87 Difference]: Start difference. First operand 19045 states and 29996 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:08,266 INFO L93 Difference]: Finished difference Result 20133 states and 31445 transitions. [2024-11-07 00:09:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:09:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:09:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:08,327 INFO L225 Difference]: With dead ends: 20133 [2024-11-07 00:09:08,328 INFO L226 Difference]: Without dead ends: 20131 [2024-11-07 00:09:08,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:08,344 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:08,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2024-11-07 00:09:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131. [2024-11-07 00:09:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20131 states, 20130 states have (on average 1.5436164927968206) internal successors, (31073), 20130 states have internal predecessors, (31073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 31073 transitions. [2024-11-07 00:09:08,967 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 31073 transitions. Word has length 81 [2024-11-07 00:09:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:08,968 INFO L471 AbstractCegarLoop]: Abstraction has 20131 states and 31073 transitions. [2024-11-07 00:09:08,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 31073 transitions. [2024-11-07 00:09:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 00:09:08,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:08,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:08,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:09:08,971 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:08,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1195435618, now seen corresponding path program 1 times [2024-11-07 00:09:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330732487] [2024-11-07 00:09:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 00:09:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330732487] [2024-11-07 00:09:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330732487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739141474] [2024-11-07 00:09:09,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:09,177 INFO L87 Difference]: Start difference. First operand 20131 states and 31073 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:09,844 INFO L93 Difference]: Finished difference Result 49399 states and 76493 transitions. [2024-11-07 00:09:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-07 00:09:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:09,978 INFO L225 Difference]: With dead ends: 49399 [2024-11-07 00:09:09,978 INFO L226 Difference]: Without dead ends: 39817 [2024-11-07 00:09:10,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:09:10,012 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 452 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:10,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 823 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39817 states. [2024-11-07 00:09:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39817 to 31003. [2024-11-07 00:09:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 31002 states have (on average 1.5418037545964776) internal successors, (47799), 31002 states have internal predecessors, (47799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 47799 transitions. [2024-11-07 00:09:11,018 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 47799 transitions. Word has length 109 [2024-11-07 00:09:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 47799 transitions. [2024-11-07 00:09:11,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 47799 transitions. [2024-11-07 00:09:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 00:09:11,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:11,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:09:11,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -886867038, now seen corresponding path program 1 times [2024-11-07 00:09:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649771828] [2024-11-07 00:09:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:09:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649771828] [2024-11-07 00:09:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649771828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175484064] [2024-11-07 00:09:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:11,239 INFO L87 Difference]: Start difference. First operand 31003 states and 47799 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:11,975 INFO L93 Difference]: Finished difference Result 53263 states and 82485 transitions. [2024-11-07 00:09:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-07 00:09:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:12,113 INFO L225 Difference]: With dead ends: 53263 [2024-11-07 00:09:12,114 INFO L226 Difference]: Without dead ends: 43681 [2024-11-07 00:09:12,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:09:12,141 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 445 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:12,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 947 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43681 states. [2024-11-07 00:09:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43681 to 42075. [2024-11-07 00:09:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42075 states, 42074 states have (on average 1.5423064125112895) internal successors, (64891), 42074 states have internal predecessors, (64891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42075 states to 42075 states and 64891 transitions. [2024-11-07 00:09:13,275 INFO L78 Accepts]: Start accepts. Automaton has 42075 states and 64891 transitions. Word has length 109 [2024-11-07 00:09:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:13,275 INFO L471 AbstractCegarLoop]: Abstraction has 42075 states and 64891 transitions. [2024-11-07 00:09:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 42075 states and 64891 transitions. [2024-11-07 00:09:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 00:09:13,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:13,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:13,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:09:13,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:13,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1752096542, now seen corresponding path program 1 times [2024-11-07 00:09:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:13,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338088621] [2024-11-07 00:09:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:09:13,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338088621] [2024-11-07 00:09:13,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338088621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:13,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:13,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:13,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882492395] [2024-11-07 00:09:13,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:13,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:13,464 INFO L87 Difference]: Start difference. First operand 42075 states and 64891 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:14,226 INFO L93 Difference]: Finished difference Result 59859 states and 92855 transitions. [2024-11-07 00:09:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-07 00:09:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:14,405 INFO L225 Difference]: With dead ends: 59859 [2024-11-07 00:09:14,405 INFO L226 Difference]: Without dead ends: 50017 [2024-11-07 00:09:14,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:09:14,447 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 440 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:14,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 927 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50017 states. [2024-11-07 00:09:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50017 to 48411. [2024-11-07 00:09:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48411 states, 48410 states have (on average 1.5449493906217724) internal successors, (74791), 48410 states have internal predecessors, (74791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48411 states to 48411 states and 74791 transitions. [2024-11-07 00:09:15,959 INFO L78 Accepts]: Start accepts. Automaton has 48411 states and 74791 transitions. Word has length 109 [2024-11-07 00:09:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:15,960 INFO L471 AbstractCegarLoop]: Abstraction has 48411 states and 74791 transitions. [2024-11-07 00:09:15,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 48411 states and 74791 transitions. [2024-11-07 00:09:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 00:09:15,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:15,963 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:15,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:09:15,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:15,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 19451263, now seen corresponding path program 1 times [2024-11-07 00:09:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40292190] [2024-11-07 00:09:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:09:16,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:16,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40292190] [2024-11-07 00:09:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40292190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:16,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:16,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:16,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976535601] [2024-11-07 00:09:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:16,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:16,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:16,057 INFO L87 Difference]: Start difference. First operand 48411 states and 74791 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:17,218 INFO L93 Difference]: Finished difference Result 107187 states and 166366 transitions. [2024-11-07 00:09:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:17,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-07 00:09:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:17,480 INFO L225 Difference]: With dead ends: 107187 [2024-11-07 00:09:17,480 INFO L226 Difference]: Without dead ends: 78153 [2024-11-07 00:09:17,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:17,527 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:17,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 366 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78153 states. [2024-11-07 00:09:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78153 to 77948. [2024-11-07 00:09:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77948 states, 77947 states have (on average 1.5465123737924487) internal successors, (120546), 77947 states have internal predecessors, (120546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77948 states to 77948 states and 120546 transitions. [2024-11-07 00:09:19,662 INFO L78 Accepts]: Start accepts. Automaton has 77948 states and 120546 transitions. Word has length 110 [2024-11-07 00:09:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:19,663 INFO L471 AbstractCegarLoop]: Abstraction has 77948 states and 120546 transitions. [2024-11-07 00:09:19,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 77948 states and 120546 transitions. [2024-11-07 00:09:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 00:09:19,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:19,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:09:19,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -403250563, now seen corresponding path program 1 times [2024-11-07 00:09:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867828065] [2024-11-07 00:09:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:09:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867828065] [2024-11-07 00:09:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867828065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163665570] [2024-11-07 00:09:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:19,818 INFO L87 Difference]: Start difference. First operand 77948 states and 120546 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:21,300 INFO L93 Difference]: Finished difference Result 139209 states and 216195 transitions. [2024-11-07 00:09:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-07 00:09:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:21,603 INFO L225 Difference]: With dead ends: 139209 [2024-11-07 00:09:21,604 INFO L226 Difference]: Without dead ends: 106937 [2024-11-07 00:09:21,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:21,655 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 187 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:21,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 673 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106937 states. [2024-11-07 00:09:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106937 to 103676. [2024-11-07 00:09:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103676 states, 103675 states have (on average 1.5447986496262358) internal successors, (160157), 103675 states have internal predecessors, (160157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103676 states to 103676 states and 160157 transitions. [2024-11-07 00:09:24,169 INFO L78 Accepts]: Start accepts. Automaton has 103676 states and 160157 transitions. Word has length 110 [2024-11-07 00:09:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:24,169 INFO L471 AbstractCegarLoop]: Abstraction has 103676 states and 160157 transitions. [2024-11-07 00:09:24,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103676 states and 160157 transitions. [2024-11-07 00:09:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 00:09:24,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:24,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:24,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:09:24,173 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:24,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1187171385, now seen corresponding path program 1 times [2024-11-07 00:09:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419069606] [2024-11-07 00:09:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:09:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419069606] [2024-11-07 00:09:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419069606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763139280] [2024-11-07 00:09:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:24,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:24,292 INFO L87 Difference]: Start difference. First operand 103676 states and 160157 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:25,957 INFO L93 Difference]: Finished difference Result 158887 states and 246384 transitions. [2024-11-07 00:09:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:25,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-07 00:09:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:26,215 INFO L225 Difference]: With dead ends: 158887 [2024-11-07 00:09:26,215 INFO L226 Difference]: Without dead ends: 128825 [2024-11-07 00:09:26,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:26,271 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 192 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:26,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 675 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128825 states. [2024-11-07 00:09:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128825 to 122437. [2024-11-07 00:09:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122437 states, 122436 states have (on average 1.5437208010715802) internal successors, (189007), 122436 states have internal predecessors, (189007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122437 states to 122437 states and 189007 transitions. [2024-11-07 00:09:29,158 INFO L78 Accepts]: Start accepts. Automaton has 122437 states and 189007 transitions. Word has length 111 [2024-11-07 00:09:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:29,158 INFO L471 AbstractCegarLoop]: Abstraction has 122437 states and 189007 transitions. [2024-11-07 00:09:29,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 122437 states and 189007 transitions. [2024-11-07 00:09:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 00:09:29,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:29,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:29,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:09:29,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 166103031, now seen corresponding path program 1 times [2024-11-07 00:09:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494277935] [2024-11-07 00:09:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:09:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494277935] [2024-11-07 00:09:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494277935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:29,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:29,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826724574] [2024-11-07 00:09:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:29,250 INFO L87 Difference]: Start difference. First operand 122437 states and 189007 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:31,740 INFO L93 Difference]: Finished difference Result 259823 states and 401914 transitions. [2024-11-07 00:09:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-07 00:09:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:32,245 INFO L225 Difference]: With dead ends: 259823 [2024-11-07 00:09:32,245 INFO L226 Difference]: Without dead ends: 201641 [2024-11-07 00:09:32,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:32,347 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:32,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 367 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201641 states. [2024-11-07 00:09:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201641 to 201111. [2024-11-07 00:09:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201111 states, 201110 states have (on average 1.5416687385013177) internal successors, (310045), 201110 states have internal predecessors, (310045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201111 states to 201111 states and 310045 transitions. [2024-11-07 00:09:36,708 INFO L78 Accepts]: Start accepts. Automaton has 201111 states and 310045 transitions. Word has length 111 [2024-11-07 00:09:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:36,709 INFO L471 AbstractCegarLoop]: Abstraction has 201111 states and 310045 transitions. [2024-11-07 00:09:36,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 201111 states and 310045 transitions. [2024-11-07 00:09:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 00:09:36,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:36,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:09:36,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:09:36,712 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1809869492, now seen corresponding path program 1 times [2024-11-07 00:09:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119107785] [2024-11-07 00:09:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119107785] [2024-11-07 00:09:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119107785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348280506] [2024-11-07 00:09:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:36,808 INFO L87 Difference]: Start difference. First operand 201111 states and 310045 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:09:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:42,020 INFO L93 Difference]: Finished difference Result 599120 states and 921764 transitions. [2024-11-07 00:09:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-07 00:09:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:43,013 INFO L225 Difference]: With dead ends: 599120 [2024-11-07 00:09:43,013 INFO L226 Difference]: Without dead ends: 398081 [2024-11-07 00:09:43,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:43,168 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:43,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398081 states. [2024-11-07 00:09:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398081 to 398079. [2024-11-07 00:09:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398079 states, 398078 states have (on average 1.5265676575947427) internal successors, (607693), 398078 states have internal predecessors, (607693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)