./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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', '60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd'] 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-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:19:41,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:19:41,207 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:19:41,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:19:41,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:19:41,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:19:41,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:19:41,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:19:41,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:19:41,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:19:41,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:19:41,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:19:41,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:19:41,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:19:41,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:19:41,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:19:41,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:19:41,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:19:41,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:19:41,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:19:41,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:19:41,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:19:41,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:19:41,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:19:41,237 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 -> 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd [2024-11-07 00:19:41,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:19:41,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:19:41,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:19:41,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:19:41,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:19:41,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:19:42,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:19:43,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:19:43,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:19:43,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa3d4c5a1/70813ae5492f4aed86e62a2fc55e9adc/FLAGba0588488 [2024-11-07 00:19:43,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa3d4c5a1/70813ae5492f4aed86e62a2fc55e9adc [2024-11-07 00:19:43,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:19:43,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:19:43,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:19:43,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:19:43,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:19:43,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:43,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1d2b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43, skipping insertion in model container [2024-11-07 00:19:43,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:43,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:19:43,823 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-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-07 00:19:43,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:19:43,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:19:43,927 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-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-07 00:19:43,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:19:43,998 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:19:43,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43 WrapperNode [2024-11-07 00:19:44,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:19:44,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:19:44,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:19:44,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:19:44,016 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:19:43" (1/1) ... [2024-11-07 00:19:44,046 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:19:43" (1/1) ... [2024-11-07 00:19:44,174 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2024-11-07 00:19:44,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:19:44,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:19:44,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:19:44,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:19:44,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,264 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:19:44,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:19:44,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:19:44,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:19:44,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:19:44,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (1/1) ... [2024-11-07 00:19:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:19:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:19:44,409 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:19:44,415 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:19:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:19:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:19:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:19:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:19:44,618 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:19:44,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:19:46,199 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-07 00:19:46,201 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:19:46,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:19:46,242 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:19:46,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:19:46 BoogieIcfgContainer [2024-11-07 00:19:46,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:19:46,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:19:46,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:19:46,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:19:46,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:19:43" (1/3) ... [2024-11-07 00:19:46,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2558f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:19:46, skipping insertion in model container [2024-11-07 00:19:46,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:43" (2/3) ... [2024-11-07 00:19:46,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2558f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:19:46, skipping insertion in model container [2024-11-07 00:19:46,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:19:46" (3/3) ... [2024-11-07 00:19:46,260 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:19:46,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:19:46,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:19:46,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:19:46,436 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;@2d22dca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:19:46,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:19:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:19:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 00:19:46,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:46,471 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, 1, 1, 1, 1, 1, 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:19:46,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:46,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 430105228, now seen corresponding path program 1 times [2024-11-07 00:19:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83636494] [2024-11-07 00:19:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:47,865 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:19:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83636494] [2024-11-07 00:19:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83636494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452103694] [2024-11-07 00:19:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:47,925 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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:19:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:48,112 INFO L93 Difference]: Finished difference Result 589 states and 1021 transitions. [2024-11-07 00:19:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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:19:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:48,136 INFO L225 Difference]: With dead ends: 589 [2024-11-07 00:19:48,140 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 00:19:48,143 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:19:48,153 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 232 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:48,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1074 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 00:19:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2024-11-07 00:19:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.660633484162896) internal successors, (734), 442 states have internal predecessors, (734), 0 states have call successors, (0), 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:19:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 734 transitions. [2024-11-07 00:19:48,293 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 734 transitions. Word has length 110 [2024-11-07 00:19:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:48,293 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 734 transitions. [2024-11-07 00:19:48,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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:19:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 734 transitions. [2024-11-07 00:19:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 00:19:48,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:48,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:19:48,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:48,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1228540371, now seen corresponding path program 1 times [2024-11-07 00:19:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456550276] [2024-11-07 00:19:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:48,611 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:19:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:48,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456550276] [2024-11-07 00:19:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456550276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:48,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:48,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942440819] [2024-11-07 00:19:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:48,615 INFO L87 Difference]: Start difference. First operand 443 states and 734 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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:19:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:48,669 INFO L93 Difference]: Finished difference Result 933 states and 1550 transitions. [2024-11-07 00:19:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:48,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-07 00:19:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:48,676 INFO L225 Difference]: With dead ends: 933 [2024-11-07 00:19:48,676 INFO L226 Difference]: Without dead ends: 679 [2024-11-07 00:19:48,677 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:19:48,678 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 200 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1028 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:19:48,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1028 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-07 00:19:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2024-11-07 00:19:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.6587537091988132) internal successors, (1118), 674 states have internal predecessors, (1118), 0 states have call successors, (0), 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:19:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1118 transitions. [2024-11-07 00:19:48,722 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1118 transitions. Word has length 113 [2024-11-07 00:19:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1118 transitions. [2024-11-07 00:19:48,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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:19:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1118 transitions. [2024-11-07 00:19:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:19:48,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:48,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:19:48,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:48,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1403707664, now seen corresponding path program 1 times [2024-11-07 00:19:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135758858] [2024-11-07 00:19:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:48,936 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:19:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135758858] [2024-11-07 00:19:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135758858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:48,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537625161] [2024-11-07 00:19:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:48,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:48,940 INFO L87 Difference]: Start difference. First operand 675 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:19:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:48,990 INFO L93 Difference]: Finished difference Result 1611 states and 2668 transitions. [2024-11-07 00:19:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-07 00:19:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:48,998 INFO L225 Difference]: With dead ends: 1611 [2024-11-07 00:19:48,999 INFO L226 Difference]: Without dead ends: 1125 [2024-11-07 00:19:49,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:19:49,002 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 194 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1029 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:19:49,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-07 00:19:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2024-11-07 00:19:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.6511627906976745) internal successors, (1846), 1118 states have internal predecessors, (1846), 0 states have call successors, (0), 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:19:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1846 transitions. [2024-11-07 00:19:49,053 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1846 transitions. Word has length 116 [2024-11-07 00:19:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1846 transitions. [2024-11-07 00:19:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:19:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1846 transitions. [2024-11-07 00:19:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:19:49,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:49,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:19:49,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1658128561, now seen corresponding path program 1 times [2024-11-07 00:19:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788975759] [2024-11-07 00:19:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:49,262 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:19:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788975759] [2024-11-07 00:19:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788975759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:49,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:49,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289602498] [2024-11-07 00:19:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:49,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:49,265 INFO L87 Difference]: Start difference. First operand 1119 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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:19:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:49,314 INFO L93 Difference]: Finished difference Result 2907 states and 4784 transitions. [2024-11-07 00:19:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-07 00:19:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:49,323 INFO L225 Difference]: With dead ends: 2907 [2024-11-07 00:19:49,323 INFO L226 Difference]: Without dead ends: 1977 [2024-11-07 00:19:49,325 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:19:49,327 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 188 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1030 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:19:49,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1030 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-11-07 00:19:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1967. [2024-11-07 00:19:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.6388606307222788) internal successors, (3222), 1966 states have internal predecessors, (3222), 0 states have call successors, (0), 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:19:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3222 transitions. [2024-11-07 00:19:49,372 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3222 transitions. Word has length 119 [2024-11-07 00:19:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:49,372 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3222 transitions. [2024-11-07 00:19:49,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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:19:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3222 transitions. [2024-11-07 00:19:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:19:49,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:49,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:19:49,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:49,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1735235476, now seen corresponding path program 1 times [2024-11-07 00:19:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237579997] [2024-11-07 00:19:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:49,643 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:19:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:49,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237579997] [2024-11-07 00:19:49,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237579997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:49,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:19:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68190205] [2024-11-07 00:19:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:49,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:19:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:19:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:19:49,645 INFO L87 Difference]: Start difference. First operand 1967 states and 3222 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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:19:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:49,937 INFO L93 Difference]: Finished difference Result 10223 states and 16898 transitions. [2024-11-07 00:19:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:19:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-07 00:19:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:49,968 INFO L225 Difference]: With dead ends: 10223 [2024-11-07 00:19:49,968 INFO L226 Difference]: Without dead ends: 8445 [2024-11-07 00:19:49,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:19:49,979 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 2115 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:49,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 3920 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2024-11-07 00:19:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 3625. [2024-11-07 00:19:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3624 states have (on average 1.6382450331125828) internal successors, (5937), 3624 states have internal predecessors, (5937), 0 states have call successors, (0), 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:19:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5937 transitions. [2024-11-07 00:19:50,141 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5937 transitions. Word has length 122 [2024-11-07 00:19:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5937 transitions. [2024-11-07 00:19:50,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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:19:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5937 transitions. [2024-11-07 00:19:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:19:50,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:50,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:19:50,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2109337106, now seen corresponding path program 1 times [2024-11-07 00:19:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:50,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286516709] [2024-11-07 00:19:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:50,283 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:19:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286516709] [2024-11-07 00:19:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286516709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103587059] [2024-11-07 00:19:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:50,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:50,286 INFO L87 Difference]: Start difference. First operand 3625 states and 5937 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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:19:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:50,437 INFO L93 Difference]: Finished difference Result 10605 states and 17475 transitions. [2024-11-07 00:19:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-07 00:19:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:50,461 INFO L225 Difference]: With dead ends: 10605 [2024-11-07 00:19:50,462 INFO L226 Difference]: Without dead ends: 7169 [2024-11-07 00:19:50,466 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:19:50,467 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 658 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1763 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:19:50,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1763 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-11-07 00:19:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 5380. [2024-11-07 00:19:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 5379 states have (on average 1.6417549730433165) internal successors, (8831), 5379 states have internal predecessors, (8831), 0 states have call successors, (0), 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:19:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 8831 transitions. [2024-11-07 00:19:50,576 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 8831 transitions. Word has length 123 [2024-11-07 00:19:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:50,576 INFO L471 AbstractCegarLoop]: Abstraction has 5380 states and 8831 transitions. [2024-11-07 00:19:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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:19:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 8831 transitions. [2024-11-07 00:19:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:19:50,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:50,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:19:50,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1027444837, now seen corresponding path program 1 times [2024-11-07 00:19:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360964649] [2024-11-07 00:19:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:50,785 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:19:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360964649] [2024-11-07 00:19:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360964649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659720956] [2024-11-07 00:19:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:50,788 INFO L87 Difference]: Start difference. First operand 5380 states and 8831 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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:19:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:50,887 INFO L93 Difference]: Finished difference Result 15777 states and 25981 transitions. [2024-11-07 00:19:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-11-07 00:19:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:50,924 INFO L225 Difference]: With dead ends: 15777 [2024-11-07 00:19:50,925 INFO L226 Difference]: Without dead ends: 10586 [2024-11-07 00:19:50,935 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:19:50,935 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 656 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1653 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:50,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1653 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10586 states. [2024-11-07 00:19:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10586 to 7959. [2024-11-07 00:19:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7959 states, 7958 states have (on average 1.6406132194018597) internal successors, (13056), 7958 states have internal predecessors, (13056), 0 states have call successors, (0), 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:19:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13056 transitions. [2024-11-07 00:19:51,160 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 13056 transitions. Word has length 124 [2024-11-07 00:19:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:51,160 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 13056 transitions. [2024-11-07 00:19:51,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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:19:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 13056 transitions. [2024-11-07 00:19:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:19:51,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:51,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:19:51,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -275676370, now seen corresponding path program 1 times [2024-11-07 00:19:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:51,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636203031] [2024-11-07 00:19:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:51,288 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:19:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636203031] [2024-11-07 00:19:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636203031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:51,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:51,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911062029] [2024-11-07 00:19:51,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:51,289 INFO L87 Difference]: Start difference. First operand 7959 states and 13056 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:51,411 INFO L93 Difference]: Finished difference Result 15656 states and 25739 transitions. [2024-11-07 00:19:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:19:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:51,440 INFO L225 Difference]: With dead ends: 15656 [2024-11-07 00:19:51,440 INFO L226 Difference]: Without dead ends: 11380 [2024-11-07 00:19:51,451 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:19:51,452 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 193 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1120 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:51,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2024-11-07 00:19:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11378. [2024-11-07 00:19:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11378 states, 11377 states have (on average 1.6374263865693943) internal successors, (18629), 11377 states have internal predecessors, (18629), 0 states have call successors, (0), 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:19:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 18629 transitions. [2024-11-07 00:19:51,802 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 18629 transitions. Word has length 125 [2024-11-07 00:19:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:51,803 INFO L471 AbstractCegarLoop]: Abstraction has 11378 states and 18629 transitions. [2024-11-07 00:19:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 18629 transitions. [2024-11-07 00:19:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:19:51,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:51,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:19:51,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 15369622, now seen corresponding path program 1 times [2024-11-07 00:19:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469434669] [2024-11-07 00:19:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:51,913 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:19:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469434669] [2024-11-07 00:19:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469434669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107399841] [2024-11-07 00:19:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:51,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:51,915 INFO L87 Difference]: Start difference. First operand 11378 states and 18629 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:51,994 INFO L93 Difference]: Finished difference Result 22088 states and 36263 transitions. [2024-11-07 00:19:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:19:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:52,027 INFO L225 Difference]: With dead ends: 22088 [2024-11-07 00:19:52,027 INFO L226 Difference]: Without dead ends: 16096 [2024-11-07 00:19:52,042 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:19:52,044 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 187 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1094 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:19:52,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1094 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2024-11-07 00:19:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 16094. [2024-11-07 00:19:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16094 states, 16093 states have (on average 1.6340645000932081) internal successors, (26297), 16093 states have internal predecessors, (26297), 0 states have call successors, (0), 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:19:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 26297 transitions. [2024-11-07 00:19:52,394 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 26297 transitions. Word has length 125 [2024-11-07 00:19:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 16094 states and 26297 transitions. [2024-11-07 00:19:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 26297 transitions. [2024-11-07 00:19:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:19:52,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:52,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:19:52,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1843964843, now seen corresponding path program 1 times [2024-11-07 00:19:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:52,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116182502] [2024-11-07 00:19:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:52,650 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:19:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116182502] [2024-11-07 00:19:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116182502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790695267] [2024-11-07 00:19:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:52,653 INFO L87 Difference]: Start difference. First operand 16094 states and 26297 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:52,887 INFO L93 Difference]: Finished difference Result 50960 states and 83572 transitions. [2024-11-07 00:19:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:19:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:52,968 INFO L225 Difference]: With dead ends: 50960 [2024-11-07 00:19:52,968 INFO L226 Difference]: Without dead ends: 35474 [2024-11-07 00:19:53,008 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:19:53,011 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 654 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:53,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1550 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2024-11-07 00:19:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 25732. [2024-11-07 00:19:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25732 states, 25731 states have (on average 1.6325444016944541) internal successors, (42007), 25731 states have internal predecessors, (42007), 0 states have call successors, (0), 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:19:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 42007 transitions. [2024-11-07 00:19:53,590 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 42007 transitions. Word has length 125 [2024-11-07 00:19:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:53,591 INFO L471 AbstractCegarLoop]: Abstraction has 25732 states and 42007 transitions. [2024-11-07 00:19:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 42007 transitions. [2024-11-07 00:19:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:19:53,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:53,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:19:53,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -815921210, now seen corresponding path program 1 times [2024-11-07 00:19:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846025620] [2024-11-07 00:19:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:53,804 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:19:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846025620] [2024-11-07 00:19:53,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846025620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:53,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:53,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678055799] [2024-11-07 00:19:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:53,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:53,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:53,806 INFO L87 Difference]: Start difference. First operand 25732 states and 42007 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:53,946 INFO L93 Difference]: Finished difference Result 55910 states and 91585 transitions. [2024-11-07 00:19:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:19:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:54,023 INFO L225 Difference]: With dead ends: 55910 [2024-11-07 00:19:54,023 INFO L226 Difference]: Without dead ends: 38187 [2024-11-07 00:19:54,051 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:19:54,052 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1165 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:19:54,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2024-11-07 00:19:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 38185. [2024-11-07 00:19:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38185 states, 38184 states have (on average 1.6302639849151477) internal successors, (62250), 38184 states have internal predecessors, (62250), 0 states have call successors, (0), 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:19:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38185 states to 38185 states and 62250 transitions. [2024-11-07 00:19:54,756 INFO L78 Accepts]: Start accepts. Automaton has 38185 states and 62250 transitions. Word has length 125 [2024-11-07 00:19:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 38185 states and 62250 transitions. [2024-11-07 00:19:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38185 states and 62250 transitions. [2024-11-07 00:19:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:19:54,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:54,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:19:54,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1819340837, now seen corresponding path program 1 times [2024-11-07 00:19:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994050623] [2024-11-07 00:19:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:54,992 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:19:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:54,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994050623] [2024-11-07 00:19:54,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994050623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:54,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117284441] [2024-11-07 00:19:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:54,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:54,994 INFO L87 Difference]: Start difference. First operand 38185 states and 62250 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:55,291 INFO L93 Difference]: Finished difference Result 83692 states and 137539 transitions. [2024-11-07 00:19:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:19:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:55,591 INFO L225 Difference]: With dead ends: 83692 [2024-11-07 00:19:55,592 INFO L226 Difference]: Without dead ends: 56811 [2024-11-07 00:19:55,621 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:19:55,621 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 205 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1203 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:19:55,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56811 states. [2024-11-07 00:19:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56811 to 56809. [2024-11-07 00:19:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56809 states, 56808 states have (on average 1.63212927756654) internal successors, (92718), 56808 states have internal predecessors, (92718), 0 states have call successors, (0), 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:19:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56809 states to 56809 states and 92718 transitions. [2024-11-07 00:19:56,671 INFO L78 Accepts]: Start accepts. Automaton has 56809 states and 92718 transitions. Word has length 125 [2024-11-07 00:19:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 56809 states and 92718 transitions. [2024-11-07 00:19:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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:19:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56809 states and 92718 transitions. [2024-11-07 00:19:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:19:56,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:56,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:19:56,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1381723230, now seen corresponding path program 1 times [2024-11-07 00:19:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494541423] [2024-11-07 00:19:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:56,822 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:19:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494541423] [2024-11-07 00:19:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494541423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:56,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:56,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:56,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448216612] [2024-11-07 00:19:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:56,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:56,824 INFO L87 Difference]: Start difference. First operand 56809 states and 92718 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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:19:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:57,548 INFO L93 Difference]: Finished difference Result 182062 states and 297983 transitions. [2024-11-07 00:19:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:57,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-11-07 00:19:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:57,844 INFO L225 Difference]: With dead ends: 182062 [2024-11-07 00:19:57,845 INFO L226 Difference]: Without dead ends: 125497 [2024-11-07 00:19:57,972 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:19:57,973 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 652 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1766 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:19:57,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1766 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2024-11-07 00:20:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 90928. [2024-11-07 00:20:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6284601933419116) internal successors, (148071), 90927 states have internal predecessors, (148071), 0 states have call successors, (0), 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:20:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 148071 transitions. [2024-11-07 00:20:00,998 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 148071 transitions. Word has length 126 [2024-11-07 00:20:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:00,999 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 148071 transitions. [2024-11-07 00:20:00,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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:20:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 148071 transitions. [2024-11-07 00:20:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 00:20:01,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:01,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:01,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:20:01,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2086532755, now seen corresponding path program 1 times [2024-11-07 00:20:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257620894] [2024-11-07 00:20:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:01,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:20:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257620894] [2024-11-07 00:20:01,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257620894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:01,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:01,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426239164] [2024-11-07 00:20:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:01,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:01,315 INFO L87 Difference]: Start difference. First operand 90928 states and 148071 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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:20:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:02,413 INFO L93 Difference]: Finished difference Result 181614 states and 295752 transitions. [2024-11-07 00:20:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-07 00:20:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:02,578 INFO L225 Difference]: With dead ends: 181614 [2024-11-07 00:20:02,579 INFO L226 Difference]: Without dead ends: 90930 [2024-11-07 00:20:02,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:20:02,626 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 381 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:02,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2041 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90930 states. [2024-11-07 00:20:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90930 to 90928. [2024-11-07 00:20:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6215865474501523) internal successors, (147446), 90927 states have internal predecessors, (147446), 0 states have call successors, (0), 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:20:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 147446 transitions. [2024-11-07 00:20:04,332 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 147446 transitions. Word has length 128 [2024-11-07 00:20:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:04,332 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 147446 transitions. [2024-11-07 00:20:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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:20:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 147446 transitions. [2024-11-07 00:20:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 00:20:04,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:04,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:20:04,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:04,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1082243879, now seen corresponding path program 1 times [2024-11-07 00:20:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234804538] [2024-11-07 00:20:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:04,599 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:20:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234804538] [2024-11-07 00:20:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234804538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:04,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:04,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264032729] [2024-11-07 00:20:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:04,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:04,601 INFO L87 Difference]: Start difference. First operand 90928 states and 147446 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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:20:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:06,038 INFO L93 Difference]: Finished difference Result 265772 states and 431468 transitions. [2024-11-07 00:20:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-07 00:20:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:06,436 INFO L225 Difference]: With dead ends: 265772 [2024-11-07 00:20:06,436 INFO L226 Difference]: Without dead ends: 175088 [2024-11-07 00:20:06,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:20:06,545 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 190 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2561 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175088 states. [2024-11-07 00:20:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175088 to 175086. [2024-11-07 00:20:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175086 states, 175085 states have (on average 1.6129023045949111) internal successors, (282395), 175085 states have internal predecessors, (282395), 0 states have call successors, (0), 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:20:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175086 states to 175086 states and 282395 transitions. [2024-11-07 00:20:09,601 INFO L78 Accepts]: Start accepts. Automaton has 175086 states and 282395 transitions. Word has length 131 [2024-11-07 00:20:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:09,601 INFO L471 AbstractCegarLoop]: Abstraction has 175086 states and 282395 transitions. [2024-11-07 00:20:09,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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:20:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 175086 states and 282395 transitions. [2024-11-07 00:20:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:20:09,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:09,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:20:09,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:09,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -812087216, now seen corresponding path program 1 times [2024-11-07 00:20:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:09,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466504922] [2024-11-07 00:20:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:11,022 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:20:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466504922] [2024-11-07 00:20:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466504922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:20:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921835792] [2024-11-07 00:20:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:11,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:20:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:20:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:20:11,023 INFO L87 Difference]: Start difference. First operand 175086 states and 282395 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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:20:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:11,536 INFO L93 Difference]: Finished difference Result 178960 states and 288204 transitions. [2024-11-07 00:20:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:20:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-07 00:20:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:11,895 INFO L225 Difference]: With dead ends: 178960 [2024-11-07 00:20:11,895 INFO L226 Difference]: Without dead ends: 178958 [2024-11-07 00:20:11,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:11,968 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:11,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178958 states. [2024-11-07 00:20:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178958 to 178958. [2024-11-07 00:20:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178958 states, 178957 states have (on average 1.5994903803707037) internal successors, (286240), 178957 states have internal predecessors, (286240), 0 states have call successors, (0), 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:20:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178958 states to 178958 states and 286240 transitions. [2024-11-07 00:20:15,803 INFO L78 Accepts]: Start accepts. Automaton has 178958 states and 286240 transitions. Word has length 132 [2024-11-07 00:20:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:15,804 INFO L471 AbstractCegarLoop]: Abstraction has 178958 states and 286240 transitions. [2024-11-07 00:20:15,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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:20:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 178958 states and 286240 transitions. [2024-11-07 00:20:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:20:15,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:15,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:20:15,809 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1146801810, now seen corresponding path program 1 times [2024-11-07 00:20:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120012383] [2024-11-07 00:20:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:15,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 00:20:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120012383] [2024-11-07 00:20:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120012383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438748322] [2024-11-07 00:20:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:16,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:16,029 INFO L87 Difference]: Start difference. First operand 178958 states and 286240 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 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:20:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:18,803 INFO L93 Difference]: Finished difference Result 487720 states and 782945 transitions. [2024-11-07 00:20:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-07 00:20:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:19,787 INFO L225 Difference]: With dead ends: 487720 [2024-11-07 00:20:19,787 INFO L226 Difference]: Without dead ends: 409068 [2024-11-07 00:20:19,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:20:19,974 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1423 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:19,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2710 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409068 states. [2024-11-07 00:20:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409068 to 287506. [2024-11-07 00:20:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287506 states, 287505 states have (on average 1.5981913358028557) internal successors, (459488), 287505 states have internal predecessors, (459488), 0 states have call successors, (0), 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:20:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287506 states to 287506 states and 459488 transitions. [2024-11-07 00:20:27,662 INFO L78 Accepts]: Start accepts. Automaton has 287506 states and 459488 transitions. Word has length 163 [2024-11-07 00:20:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:27,662 INFO L471 AbstractCegarLoop]: Abstraction has 287506 states and 459488 transitions. [2024-11-07 00:20:27,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 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:20:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 287506 states and 459488 transitions. [2024-11-07 00:20:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:20:27,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:27,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:20:27,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:27,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1437847802, now seen corresponding path program 1 times [2024-11-07 00:20:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:27,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273838940] [2024-11-07 00:20:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 00:20:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273838940] [2024-11-07 00:20:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273838940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296232270] [2024-11-07 00:20:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:28,034 INFO L87 Difference]: Start difference. First operand 287506 states and 459488 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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:20:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:30,520 INFO L93 Difference]: Finished difference Result 518940 states and 833205 transitions. [2024-11-07 00:20:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:30,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-07 00:20:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:31,406 INFO L225 Difference]: With dead ends: 518940 [2024-11-07 00:20:31,406 INFO L226 Difference]: Without dead ends: 440288 [2024-11-07 00:20:31,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:20:31,547 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1394 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:31,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 3056 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:20:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440288 states. [2024-11-07 00:20:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440288 to 388624. [2024-11-07 00:20:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388624 states, 388623 states have (on average 1.599555353131441) internal successors, (621624), 388623 states have internal predecessors, (621624), 0 states have call successors, (0), 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:20:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388624 states to 388624 states and 621624 transitions. [2024-11-07 00:20:38,629 INFO L78 Accepts]: Start accepts. Automaton has 388624 states and 621624 transitions. Word has length 163 [2024-11-07 00:20:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 388624 states and 621624 transitions. [2024-11-07 00:20:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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:20:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 388624 states and 621624 transitions. [2024-11-07 00:20:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:20:38,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:38,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:20:38,635 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 606556970, now seen corresponding path program 1 times [2024-11-07 00:20:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:38,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060021501] [2024-11-07 00:20:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 00:20:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060021501] [2024-11-07 00:20:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060021501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172819647] [2024-11-07 00:20:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:38,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:38,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:38,996 INFO L87 Difference]: Start difference. First operand 388624 states and 621624 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)