./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:04:40,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:04:40,799 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:04:40,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:04:40,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:04:40,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:04:40,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:04:40,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:04:40,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:04:40,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:04:40,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:04:40,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:04:40,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:04:40,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:04:40,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:04:40,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:40,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:04:40,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:04:40,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:04:40,839 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 -> 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc [2024-11-07 00:04:41,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:04:41,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:04:41,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:04:41,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:04:41,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:04:41,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:42,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:04:42,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:04:42,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:42,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48fe46a7e/2a7536d3b9a1490580c9a2be86907e5d/FLAG4aa573716 [2024-11-07 00:04:42,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48fe46a7e/2a7536d3b9a1490580c9a2be86907e5d [2024-11-07 00:04:42,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:04:42,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:04:42,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:42,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:04:42,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:04:42,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:42,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d985fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42, skipping insertion in model container [2024-11-07 00:04:42,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:42,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:04:42,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-11-07 00:04:42,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:42,845 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:04:42,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-11-07 00:04:42,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:42,912 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:04:42,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42 WrapperNode [2024-11-07 00:04:42,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:42,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:42,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:04:42,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:04:42,925 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:04:42" (1/1) ... [2024-11-07 00:04:42,939 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:04:42" (1/1) ... [2024-11-07 00:04:42,972 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 313 [2024-11-07 00:04:42,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:42,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:04:42,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:04:42,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:04:42,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:42,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:42,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,017 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:04:43,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:04:43,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:04:43,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:04:43,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:04:43,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (1/1) ... [2024-11-07 00:04:43,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:43,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:43,101 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:04:43,110 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:04:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:04:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:04:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:04:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:04:43,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:04:43,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:04:43,523 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 00:04:43,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:04:43,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:04:43,531 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:04:43,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:43 BoogieIcfgContainer [2024-11-07 00:04:43,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:04:43,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:04:43,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:04:43,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:04:43,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:04:42" (1/3) ... [2024-11-07 00:04:43,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33139c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:43, skipping insertion in model container [2024-11-07 00:04:43,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:42" (2/3) ... [2024-11-07 00:04:43,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33139c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:43, skipping insertion in model container [2024-11-07 00:04:43,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:43" (3/3) ... [2024-11-07 00:04:43,564 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:43,575 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:04:43,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:04:43,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:04:43,631 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;@5d1dc596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:04:43,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:04:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.7228915662650603) internal successors, (143), 84 states have internal predecessors, (143), 0 states have call successors, (0), 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:04:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:43,642 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] [2024-11-07 00:04:43,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1338703135, now seen corresponding path program 1 times [2024-11-07 00:04:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460857090] [2024-11-07 00:04:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:43,877 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:04:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460857090] [2024-11-07 00:04:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460857090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:04:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553647271] [2024-11-07 00:04:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:04:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:43,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:04:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:04:43,901 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.7228915662650603) internal successors, (143), 84 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:43,918 INFO L93 Difference]: Finished difference Result 137 states and 229 transitions. [2024-11-07 00:04:43,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:04:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 00:04:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:43,925 INFO L225 Difference]: With dead ends: 137 [2024-11-07 00:04:43,925 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 00:04:43,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:04:43,931 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:43,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 00:04:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 00:04:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.7) internal successors, (136), 80 states have internal predecessors, (136), 0 states have call successors, (0), 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:04:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2024-11-07 00:04:43,961 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 29 [2024-11-07 00:04:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:43,961 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2024-11-07 00:04:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2024-11-07 00:04:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:43,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:43,964 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] [2024-11-07 00:04:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:04:43,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1472716641, now seen corresponding path program 1 times [2024-11-07 00:04:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125266701] [2024-11-07 00:04:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:44,254 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:04:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125266701] [2024-11-07 00:04:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125266701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:04:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826810132] [2024-11-07 00:04:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:44,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:04:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:04:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:04:44,260 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,361 INFO L93 Difference]: Finished difference Result 136 states and 222 transitions. [2024-11-07 00:04:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:04:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 00:04:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,363 INFO L225 Difference]: With dead ends: 136 [2024-11-07 00:04:44,363 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 00:04:44,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:04:44,366 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:44,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 00:04:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 00:04:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 0 states have call successors, (0), 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:04:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-11-07 00:04:44,371 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 29 [2024-11-07 00:04:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,371 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-11-07 00:04:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-11-07 00:04:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:44,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,373 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] [2024-11-07 00:04:44,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:04:44,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash -483680104, now seen corresponding path program 1 times [2024-11-07 00:04:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864415804] [2024-11-07 00:04:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:44,502 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:04:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864415804] [2024-11-07 00:04:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864415804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912429384] [2024-11-07 00:04:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:44,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:44,506 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,542 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2024-11-07 00:04:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-07 00:04:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,544 INFO L225 Difference]: With dead ends: 175 [2024-11-07 00:04:44,544 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 00:04:44,544 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:04:44,545 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 228 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:04:44,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 228 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 00:04:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-07 00:04:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 121 states have internal predecessors, (178), 0 states have call successors, (0), 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:04:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 00:04:44,560 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 52 [2024-11-07 00:04:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,563 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 00:04:44,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 00:04:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:44,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,564 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] [2024-11-07 00:04:44,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:04:44,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1993840089, now seen corresponding path program 1 times [2024-11-07 00:04:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622303999] [2024-11-07 00:04:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:44,776 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:04:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622303999] [2024-11-07 00:04:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622303999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132445926] [2024-11-07 00:04:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:44,782 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,917 INFO L93 Difference]: Finished difference Result 582 states and 918 transitions. [2024-11-07 00:04:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-07 00:04:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,920 INFO L225 Difference]: With dead ends: 582 [2024-11-07 00:04:44,920 INFO L226 Difference]: Without dead ends: 490 [2024-11-07 00:04:44,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:44,925 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 721 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:44,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 586 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-07 00:04:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 212. [2024-11-07 00:04:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.5213270142180095) internal successors, (321), 211 states have internal predecessors, (321), 0 states have call successors, (0), 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:04:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2024-11-07 00:04:44,951 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 52 [2024-11-07 00:04:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,952 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2024-11-07 00:04:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-11-07 00:04:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:04:44,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,953 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] [2024-11-07 00:04:44,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:04:44,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1296177241, now seen corresponding path program 1 times [2024-11-07 00:04:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755499841] [2024-11-07 00:04:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,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:04:45,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755499841] [2024-11-07 00:04:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755499841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:04:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633088540] [2024-11-07 00:04:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:04:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:04:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:04:45,291 INFO L87 Difference]: Start difference. First operand 212 states and 321 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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:04:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,337 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2024-11-07 00:04:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:04:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-07 00:04:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,339 INFO L225 Difference]: With dead ends: 226 [2024-11-07 00:04:45,340 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 00:04:45,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:04:45,342 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:45,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 00:04:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-07 00:04:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.493273542600897) internal successors, (333), 223 states have internal predecessors, (333), 0 states have call successors, (0), 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:04:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2024-11-07 00:04:45,362 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 53 [2024-11-07 00:04:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,362 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-11-07 00:04:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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:04:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2024-11-07 00:04:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:04:45,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,367 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] [2024-11-07 00:04:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:04:45,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1579367345, now seen corresponding path program 1 times [2024-11-07 00:04:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436804408] [2024-11-07 00:04:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,446 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:04:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436804408] [2024-11-07 00:04:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436804408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747568558] [2024-11-07 00:04:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,448 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:04:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,466 INFO L93 Difference]: Finished difference Result 582 states and 889 transitions. [2024-11-07 00:04:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 00:04:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,468 INFO L225 Difference]: With dead ends: 582 [2024-11-07 00:04:45,469 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 00:04:45,469 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:04:45,470 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:45,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 00:04:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 382. [2024-11-07 00:04:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5039370078740157) internal successors, (573), 381 states have internal predecessors, (573), 0 states have call successors, (0), 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:04:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 573 transitions. [2024-11-07 00:04:45,481 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 573 transitions. Word has length 54 [2024-11-07 00:04:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,482 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 573 transitions. [2024-11-07 00:04:45,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:04:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 573 transitions. [2024-11-07 00:04:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:45,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,483 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] [2024-11-07 00:04:45,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:04:45,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 681636818, now seen corresponding path program 1 times [2024-11-07 00:04:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576041654] [2024-11-07 00:04:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,533 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:04:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576041654] [2024-11-07 00:04:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576041654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959912993] [2024-11-07 00:04:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,534 INFO L87 Difference]: Start difference. First operand 382 states and 573 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:04:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,566 INFO L93 Difference]: Finished difference Result 1022 states and 1547 transitions. [2024-11-07 00:04:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:04:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,569 INFO L225 Difference]: With dead ends: 1022 [2024-11-07 00:04:45,569 INFO L226 Difference]: Without dead ends: 670 [2024-11-07 00:04:45,569 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:04:45,570 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 226 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:04:45,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-07 00:04:45,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2024-11-07 00:04:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.4917541229385307) internal successors, (995), 667 states have internal predecessors, (995), 0 states have call successors, (0), 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:04:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 995 transitions. [2024-11-07 00:04:45,586 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 995 transitions. Word has length 55 [2024-11-07 00:04:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,586 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 995 transitions. [2024-11-07 00:04:45,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:04:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 995 transitions. [2024-11-07 00:04:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:45,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,587 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] [2024-11-07 00:04:45,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:04:45,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1818745234, now seen corresponding path program 1 times [2024-11-07 00:04:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800449603] [2024-11-07 00:04:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,655 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:04:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800449603] [2024-11-07 00:04:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800449603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098454988] [2024-11-07 00:04:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,657 INFO L87 Difference]: Start difference. First operand 668 states and 995 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:04:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,684 INFO L93 Difference]: Finished difference Result 1816 states and 2701 transitions. [2024-11-07 00:04:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:04:45,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,688 INFO L225 Difference]: With dead ends: 1816 [2024-11-07 00:04:45,688 INFO L226 Difference]: Without dead ends: 1178 [2024-11-07 00:04:45,689 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:04:45,690 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 242 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:04:45,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-11-07 00:04:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2024-11-07 00:04:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.4629787234042553) internal successors, (1719), 1175 states have internal predecessors, (1719), 0 states have call successors, (0), 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:04:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1719 transitions. [2024-11-07 00:04:45,715 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1719 transitions. Word has length 55 [2024-11-07 00:04:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,716 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1719 transitions. [2024-11-07 00:04:45,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:04:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1719 transitions. [2024-11-07 00:04:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:04:45,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,717 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] [2024-11-07 00:04:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:04:45,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -258348272, now seen corresponding path program 1 times [2024-11-07 00:04:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838244213] [2024-11-07 00:04:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,760 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:04:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838244213] [2024-11-07 00:04:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838244213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183026512] [2024-11-07 00:04:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,762 INFO L87 Difference]: Start difference. First operand 1176 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:04:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,796 INFO L93 Difference]: Finished difference Result 2319 states and 3421 transitions. [2024-11-07 00:04:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:04:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,802 INFO L225 Difference]: With dead ends: 2319 [2024-11-07 00:04:45,802 INFO L226 Difference]: Without dead ends: 1676 [2024-11-07 00:04:45,803 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:04:45,803 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 253 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:04:45,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-11-07 00:04:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1674. [2024-11-07 00:04:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 1.4542737597130904) internal successors, (2433), 1673 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2433 transitions. [2024-11-07 00:04:45,848 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2433 transitions. Word has length 56 [2024-11-07 00:04:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,848 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2433 transitions. [2024-11-07 00:04:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:04:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2433 transitions. [2024-11-07 00:04:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:45,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:45,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:04:45,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -320122492, now seen corresponding path program 1 times [2024-11-07 00:04:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190632135] [2024-11-07 00:04:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:04:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190632135] [2024-11-07 00:04:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190632135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633594094] [2024-11-07 00:04:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:45,988 INFO L87 Difference]: Start difference. First operand 1674 states and 2433 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:46,089 INFO L93 Difference]: Finished difference Result 4724 states and 6970 transitions. [2024-11-07 00:04:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:46,102 INFO L225 Difference]: With dead ends: 4724 [2024-11-07 00:04:46,102 INFO L226 Difference]: Without dead ends: 3890 [2024-11-07 00:04:46,104 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:04:46,105 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 518 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:46,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 594 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-11-07 00:04:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2482. [2024-11-07 00:04:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 1.456267634018541) internal successors, (3613), 2481 states have internal predecessors, (3613), 0 states have call successors, (0), 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:04:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3613 transitions. [2024-11-07 00:04:46,175 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3613 transitions. Word has length 78 [2024-11-07 00:04:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3613 transitions. [2024-11-07 00:04:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3613 transitions. [2024-11-07 00:04:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:46,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:46,178 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:46,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:04:46,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1605488763, now seen corresponding path program 1 times [2024-11-07 00:04:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110155708] [2024-11-07 00:04:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:04:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110155708] [2024-11-07 00:04:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110155708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367690956] [2024-11-07 00:04:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:46,442 INFO L87 Difference]: Start difference. First operand 2482 states and 3613 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:46,693 INFO L93 Difference]: Finished difference Result 5532 states and 8150 transitions. [2024-11-07 00:04:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:46,723 INFO L225 Difference]: With dead ends: 5532 [2024-11-07 00:04:46,724 INFO L226 Difference]: Without dead ends: 4698 [2024-11-07 00:04:46,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:46,732 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 508 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:46,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 617 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2024-11-07 00:04:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 3290. [2024-11-07 00:04:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3289 states have (on average 1.4572818485861965) internal successors, (4793), 3289 states have internal predecessors, (4793), 0 states have call successors, (0), 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:04:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 4793 transitions. [2024-11-07 00:04:46,923 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 4793 transitions. Word has length 78 [2024-11-07 00:04:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:46,923 INFO L471 AbstractCegarLoop]: Abstraction has 3290 states and 4793 transitions. [2024-11-07 00:04:46,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 4793 transitions. [2024-11-07 00:04:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:46,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:46,925 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:04:46,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 140154659, now seen corresponding path program 1 times [2024-11-07 00:04:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193305761] [2024-11-07 00:04:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 00:04:47,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:47,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193305761] [2024-11-07 00:04:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193305761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:47,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820840732] [2024-11-07 00:04:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:47,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:47,169 INFO L87 Difference]: Start difference. First operand 3290 states and 4793 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:47,420 INFO L93 Difference]: Finished difference Result 6340 states and 9330 transitions. [2024-11-07 00:04:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:47,449 INFO L225 Difference]: With dead ends: 6340 [2024-11-07 00:04:47,453 INFO L226 Difference]: Without dead ends: 5506 [2024-11-07 00:04:47,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:47,461 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 473 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:47,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 681 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-11-07 00:04:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4098. [2024-11-07 00:04:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.457896021479131) internal successors, (5973), 4097 states have internal predecessors, (5973), 0 states have call successors, (0), 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:04:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5973 transitions. [2024-11-07 00:04:47,732 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5973 transitions. Word has length 78 [2024-11-07 00:04:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:47,732 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5973 transitions. [2024-11-07 00:04:47,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5973 transitions. [2024-11-07 00:04:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:47,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:47,734 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:47,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:04:47,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:47,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1548609917, now seen corresponding path program 1 times [2024-11-07 00:04:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:47,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140019161] [2024-11-07 00:04:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140019161] [2024-11-07 00:04:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140019161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255174633] [2024-11-07 00:04:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:47,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:47,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:47,827 INFO L87 Difference]: Start difference. First operand 4098 states and 5973 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:47,891 INFO L93 Difference]: Finished difference Result 8166 states and 11915 transitions. [2024-11-07 00:04:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:04:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:47,903 INFO L225 Difference]: With dead ends: 8166 [2024-11-07 00:04:47,904 INFO L226 Difference]: Without dead ends: 4100 [2024-11-07 00:04:47,909 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:04:47,910 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:47,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2024-11-07 00:04:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4098. [2024-11-07 00:04:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.4432511593849158) internal successors, (5913), 4097 states have internal predecessors, (5913), 0 states have call successors, (0), 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:04:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5913 transitions. [2024-11-07 00:04:48,072 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5913 transitions. Word has length 79 [2024-11-07 00:04:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:48,073 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5913 transitions. [2024-11-07 00:04:48,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5913 transitions. [2024-11-07 00:04:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:48,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:48,074 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:04:48,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:48,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1346852612, now seen corresponding path program 1 times [2024-11-07 00:04:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955755530] [2024-11-07 00:04:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955755530] [2024-11-07 00:04:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955755530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:48,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829312474] [2024-11-07 00:04:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:48,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:48,168 INFO L87 Difference]: Start difference. First operand 4098 states and 5913 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:48,214 INFO L93 Difference]: Finished difference Result 6134 states and 8855 transitions. [2024-11-07 00:04:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:48,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:04:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:48,228 INFO L225 Difference]: With dead ends: 6134 [2024-11-07 00:04:48,233 INFO L226 Difference]: Without dead ends: 2068 [2024-11-07 00:04:48,237 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:04:48,238 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:48,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2024-11-07 00:04:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2066. [2024-11-07 00:04:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.425181598062954) internal successors, (2943), 2065 states have internal predecessors, (2943), 0 states have call successors, (0), 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:04:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2943 transitions. [2024-11-07 00:04:48,288 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2943 transitions. Word has length 79 [2024-11-07 00:04:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 2943 transitions. [2024-11-07 00:04:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2943 transitions. [2024-11-07 00:04:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:48,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:48,289 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:04:48,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -960604293, now seen corresponding path program 1 times [2024-11-07 00:04:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596792732] [2024-11-07 00:04:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596792732] [2024-11-07 00:04:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596792732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:04:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163014012] [2024-11-07 00:04:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:04:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:48,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:04:48,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:04:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:49,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 00:04:49,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:04:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:49,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:04:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163014012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:04:50,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:04:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 31 [2024-11-07 00:04:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823281811] [2024-11-07 00:04:50,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:04:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 00:04:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 00:04:50,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2024-11-07 00:04:50,417 INFO L87 Difference]: Start difference. First operand 2066 states and 2943 transitions. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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:04:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:56,081 INFO L93 Difference]: Finished difference Result 18707 states and 26465 transitions. [2024-11-07 00:04:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-07 00:04:56,082 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:04:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:56,115 INFO L225 Difference]: With dead ends: 18707 [2024-11-07 00:04:56,115 INFO L226 Difference]: Without dead ends: 16673 [2024-11-07 00:04:56,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5638 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3254, Invalid=12246, Unknown=0, NotChecked=0, Total=15500 [2024-11-07 00:04:56,124 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 5898 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5898 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:56,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5898 Valid, 1843 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:04:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16673 states. [2024-11-07 00:04:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16673 to 14605. [2024-11-07 00:04:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14605 states, 14604 states have (on average 1.3900301287318544) internal successors, (20300), 14604 states have internal predecessors, (20300), 0 states have call successors, (0), 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:04:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14605 states to 14605 states and 20300 transitions. [2024-11-07 00:04:56,598 INFO L78 Accepts]: Start accepts. Automaton has 14605 states and 20300 transitions. Word has length 79 [2024-11-07 00:04:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:56,599 INFO L471 AbstractCegarLoop]: Abstraction has 14605 states and 20300 transitions. [2024-11-07 00:04:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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:04:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 14605 states and 20300 transitions. [2024-11-07 00:04:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:04:56,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:56,600 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:56,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:04:56,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 00:04:56,801 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:56,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash -226962490, now seen corresponding path program 1 times [2024-11-07 00:04:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574367428] [2024-11-07 00:04:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:04:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574367428] [2024-11-07 00:04:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574367428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378269686] [2024-11-07 00:04:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:56,912 INFO L87 Difference]: Start difference. First operand 14605 states and 20300 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:57,265 INFO L93 Difference]: Finished difference Result 26669 states and 37382 transitions. [2024-11-07 00:04:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:57,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-07 00:04:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:57,309 INFO L225 Difference]: With dead ends: 26669 [2024-11-07 00:04:57,309 INFO L226 Difference]: Without dead ends: 23621 [2024-11-07 00:04:57,318 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:04:57,319 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 459 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:57,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 785 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23621 states. [2024-11-07 00:04:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23621 to 17510. [2024-11-07 00:04:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17510 states, 17509 states have (on average 1.3889999428865154) internal successors, (24320), 17509 states have internal predecessors, (24320), 0 states have call successors, (0), 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:04:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17510 states to 17510 states and 24320 transitions. [2024-11-07 00:04:57,784 INFO L78 Accepts]: Start accepts. Automaton has 17510 states and 24320 transitions. Word has length 80 [2024-11-07 00:04:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:57,785 INFO L471 AbstractCegarLoop]: Abstraction has 17510 states and 24320 transitions. [2024-11-07 00:04:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:04:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17510 states and 24320 transitions. [2024-11-07 00:04:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:04:57,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:57,787 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:04:57,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:04:57,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -750605600, now seen corresponding path program 1 times [2024-11-07 00:04:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834993223] [2024-11-07 00:04:57,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834993223] [2024-11-07 00:04:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834993223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:04:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880059088] [2024-11-07 00:04:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:04:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:58,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:04:58,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:04:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:58,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:04:58,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:04:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:58,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:04:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880059088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:04:59,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:04:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-07 00:04:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725238541] [2024-11-07 00:04:59,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:04:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 00:04:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 00:04:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:04:59,305 INFO L87 Difference]: Start difference. First operand 17510 states and 24320 transitions. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 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:05:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:00,719 INFO L93 Difference]: Finished difference Result 69668 states and 97365 transitions. [2024-11-07 00:05:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:05:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:05:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:00,815 INFO L225 Difference]: With dead ends: 69668 [2024-11-07 00:05:00,815 INFO L226 Difference]: Without dead ends: 52436 [2024-11-07 00:05:00,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 00:05:00,832 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1222 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:00,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 628 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:05:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52436 states. [2024-11-07 00:05:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52436 to 40681. [2024-11-07 00:05:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40681 states, 40680 states have (on average 1.3815388397246804) internal successors, (56201), 40680 states have internal predecessors, (56201), 0 states have call successors, (0), 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:05:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40681 states to 40681 states and 56201 transitions. [2024-11-07 00:05:01,884 INFO L78 Accepts]: Start accepts. Automaton has 40681 states and 56201 transitions. Word has length 83 [2024-11-07 00:05:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:01,884 INFO L471 AbstractCegarLoop]: Abstraction has 40681 states and 56201 transitions. [2024-11-07 00:05:01,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 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:05:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 40681 states and 56201 transitions. [2024-11-07 00:05:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:01,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:01,886 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:05:01,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 00:05:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 00:05:02,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1726914593, now seen corresponding path program 1 times [2024-11-07 00:05:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:02,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16988220] [2024-11-07 00:05:02,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:02,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16988220] [2024-11-07 00:05:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16988220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:05:02,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:05:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:05:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565229712] [2024-11-07 00:05:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:05:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:05:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:05:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:05:02,162 INFO L87 Difference]: Start difference. First operand 40681 states and 56201 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:05:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:02,727 INFO L93 Difference]: Finished difference Result 63200 states and 87242 transitions. [2024-11-07 00:05:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:05:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:05:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:02,763 INFO L225 Difference]: With dead ends: 63200 [2024-11-07 00:05:02,763 INFO L226 Difference]: Without dead ends: 23004 [2024-11-07 00:05:02,788 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:05:02,788 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:02,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:05:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23004 states. [2024-11-07 00:05:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23004 to 23002. [2024-11-07 00:05:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23002 states, 23001 states have (on average 1.3542019912177732) internal successors, (31148), 23001 states have internal predecessors, (31148), 0 states have call successors, (0), 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:05:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23002 states to 23002 states and 31148 transitions. [2024-11-07 00:05:03,418 INFO L78 Accepts]: Start accepts. Automaton has 23002 states and 31148 transitions. Word has length 83 [2024-11-07 00:05:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:03,418 INFO L471 AbstractCegarLoop]: Abstraction has 23002 states and 31148 transitions. [2024-11-07 00:05:03,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:05:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23002 states and 31148 transitions. [2024-11-07 00:05:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:03,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:03,420 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:05:03,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:05:03,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -775907934, now seen corresponding path program 1 times [2024-11-07 00:05:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432645385] [2024-11-07 00:05:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432645385] [2024-11-07 00:05:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432645385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:05:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494488074] [2024-11-07 00:05:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:04,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:05:04,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:05:04,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:05:04,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:05:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:04,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 00:05:04,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:05,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:05:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494488074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:05:06,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:05:06,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-07 00:05:06,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770379134] [2024-11-07 00:05:06,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:05:06,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 00:05:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:06,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 00:05:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:05:06,692 INFO L87 Difference]: Start difference. First operand 23002 states and 31148 transitions. Second operand has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 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:05:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:26,757 INFO L93 Difference]: Finished difference Result 478999 states and 643897 transitions. [2024-11-07 00:05:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2024-11-07 00:05:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:05:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:27,757 INFO L225 Difference]: With dead ends: 478999 [2024-11-07 00:05:27,758 INFO L226 Difference]: Without dead ends: 456283 [2024-11-07 00:05:27,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27334 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=8390, Invalid=57402, Unknown=0, NotChecked=0, Total=65792 [2024-11-07 00:05:27,867 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 6392 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6392 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 5562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 5406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:27,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6392 Valid, 4543 Invalid, 5562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 5406 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 00:05:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456283 states.